📚 Circular Permutations Investigation | 圆周排列探究
In combinatorics, arranging objects in a circle introduces fascinating subtleties that distinguish circular permutations from linear ones. This investigation explores the counting principles for arranging distinct items around a circle, considering rotational and reflectional symmetries. We will derive key formulas, examine special cases, and discuss extensions to repeated elements and constraints, laying a solid foundation for problem-solving in IB Mathematics.
在组合数学中，将物体排成一个圆圈会引入一些与线性排列不同的微妙之处。本探究将探讨在圆周上排列不同物品的计数原理，并考虑旋转对称与反射对称。我们将推导关键公式，研究特殊情况，并讨论处理重复元素和限制条件的扩展，为 IB 数学中的问题解决打下坚实基础。
1. Introduction to Circular Permutations | 圆周排列简介
When we arrange n distinct objects in a row, the number of permutations is n!. However, placing them around a circle changes the count because rotations of the same arrangement are often considered indistinguishable. This foundational shift leads to the concept of circular permutations.
当我们将 n 个不同的物体排成一行时，排列数是 n!。然而，将它们放置在圆周上时，计数方式会发生变化，因为相同排列的旋转通常被视为不可区分。这一根本性的转变引出了圆周排列的概念。
Imagine seating guests at a round table. If we rotate every guest one seat to the left, the relative order among them remains the same, so we regard it as the same arrangement. This rotational equivalence is the core idea behind circular permutation formulas.
想象一下让宾客围坐在圆桌旁。如果我们将每位宾客向左旋转一个座位，他们之间的相对顺序保持不变，因此我们将其视为同一种排法。这种旋转等价性是圆周排列公式背后的核心思想。
2. Basic Principle: Rotations as Identical | 基本原理：旋转视为相同
In a linear arrangement, each shift of all objects creates a new permutation. However, on a circle there is no fixed starting point. Any arrangement can be rotated to place any chosen object at the "top", and the sequence of objects remains cyclically equivalent. Therefore, every distinct circular arrangement corresponds to n different linear representations.
在线性排列中，将所有对象整体平移一次就会产生一个新的排列。但在圆周上没有固定的起点。任何一个排列都可以通过旋转把任意选定的物体放在“顶端”，而物体序列保持循环等价。因此，每一种不同的圆周排列对应着 n 种不同的线性表示。
To account for this overcounting, we treat all rotations of a given configuration as the same arrangement. This leads to the rule that the number of circular permutations of n distinct items is the total linear arrangements divided by n, provided no other symmetries are involved.
为了修正这种重复计数，我们将给定构型的所有旋转视为同一个排列。这就引出一条规则：在不涉及其他对称性时，n 个不同物品的圆周排列数等于总的线性排列数除以 n。
Circular permutations (rotations equivalent) = n! / n = (n-1)!
圆周排列数（旋转视为相同）= n! / n = (n-1)!
3. Deriving the Formula (n-1)! | 推导公式 (n-1)!
One elegant way to derive (n-1)! is to fix one object in place to break the rotational symmetry. Choose any object and anchor it at a specific position on the circle. The remaining (n-1) objects can then be arranged in the remaining (n-1) positions in any order.
推导 (n-1)! 的一种优雅方法是固定一个物体的位置来打破旋转对称性。任意选择一个物体并将其固定在圆周的某个特定位置上。剩下的 (n-1) 个物体就可以按任意顺序排在余下的 (n-1) 个位置上。
e number of ways to seat the others is simply the linear permutation of (n-1) items: (n-1)! = (n-1)(n-2)...2·1. This method confirms the division by n, because n!/n = (n-1)! after cancelling factors.
由于固定的物体消除了所有旋转带来的重复，安排其余物体的方式数就是 (n-1) 个物品的线性排列数：(n-1)! = (n-1)(n-2)...2·1。这种方法印证了除以 n 的操作，因为 n!/n 约分后正是 (n-1)!。
This anchoring technique is extremely useful when additional constraints are introduced, as it provides a clear reference point from which to apply other counting principles.
当引入额外限制条件时，这种固定参照物的技巧非常有用，因为它提供了一个明确的参考点，便于应用其他计数原理。
4. Example: Seating Arrangements at a Round Table | 实例：圆桌座次安排
Consider inviting 4 guests to a round table. In a linear arrangement you would have 4! ns are regarded as the same meal setting, so the number of distinct seating plans is (4-1)! = 3! = 6.
考虑邀请 4 位宾客到一张圆桌。线性排列时有 4! = 24 种方式。而对于圆桌，旋转被视为相同的宴席布置，因此不同的座次方案数为 (4-1)! = 3! = 6。
ents relative to one fixed guest, say Alice. With Alice anchored, the remaining three guests can be permuted in the three remaining chairs: 3! d as cyclic orders clockwise: ABCA, ACBA, ABDA, etc. The following table compares linear and circular counts for small values of n.
我们可以通过相对于一位固定宾客（例如 Alice）的排列来验证。将 Alice 固定，其余三位宾客可在另外三把椅子上任意排列：3! = 6。这些排法按顺时针循环顺序表示：ABCA、ACBA、ABDA 等。下表对比了较小 n 值时的线性排列数和圆周排列数。
| n | Linear n! | Circular (n-1)! |
|---|---|---|
| 1 | 1 | 1 |
| 2 | 2 | 1 |
| 3 | 6 | 2 |
| 4 | 24 | 6 |
| 5 | 120 | 24 |
The table confirms that circular permutations grow more slowly than linear permutations, as rotational duplicates are removed.
该表证实圆周排列的增长速度比线性排列慢，因为旋转产生的重复已被剔除。
5. The Role of Reflections: Necklaces vs. Bracelets | 反射对称的影响：项链与手镯
In some problems, not only rotations but also reflections (flipping over) are considered identical. Think of a necklace that can be turned over; the clockwise order may become counterclockwise. In combinatorics, arrangements that allow reflections are often called "bracelets" or "free necklaces", while those that only allow rotations are "fixed necklaces".
在某些问题中，不仅旋转，反射（翻转）也被视为相同。想象一条可以翻面的项链，顺时针排列可能变成逆时针排列。在组合数学中，允许翻转的排列常被称为“手镯”或“自由项链”，而只允许旋转的则称为“固定项链”。
not create a new distinct arrangement because of symmetry, so special handling is needed.
当允许翻转时，每个排列及其镜像被视为同一种。对于 n ≥ 3 个不同物体，每个圆周排列恰好有两个互为镜像的旋转等价类，因此计数将减半。对于 n = 1 或 n = 2，由于对称性，翻转不会产生新的不同排列，需要特殊处理。
6. Deriving the Formula with Reflections | 考虑反射的公式推导
that permit reflection (turning over), we start with the circular permutation count (n-1)! h configuration and its reflection are distinct as linear orders but should be identified.
要计算允许翻转（翻面）的排列数，我们从圆周排列数 (n-1)! 出发，再除以 2。因为当 n ≥ 3 时，每个构型及其镜像作为线性序是不同的，但应该被视为同一。
Number of bracelet arrangements = (n-1)! / 2, for n ≥ 3.
手镯排列数 = (n-1)! / 2，适用于 n ≥ 3。
of symmetries now has size 2n (n rotations and n reflections). When acting on the set of n! linear arrangements, the number of orbits can be computed by Burnside's Lemma, but the simple halving works when all objects are distinct and n ≥ 3.
这个公式的出现是因为翻转是一种对合：此时对称群的规模为 2n（n 个旋转和 n 个翻转）。该群作用在线性排列的 n! 个集合上，轨道数可用伯恩赛德引理计算，但当所有物体不同且 n ≥ 3 时，简单的折半是有效的。
We must check consistency: for n=3, (3-1)! tinct beads on a bracelet can always be rotated and flipped to look the same. For n=4, (3)!/2 = 3, and indeed there are exactly 3 distinct bracelets with 4 different beads.
我们需要检验一致性：n=3 时，(3-1)!/2 = 2/2 = 1，这与三个不同珠子在手镯上总是可以通过旋转和翻转变得相同的事实吻合。n=4 时，(3)!/2 = 3，实际上用 4 颗不同的珠子恰好可以串出 3 条不同的手镯。
7. Special Cases: n = 1, 2, 3 | 特殊情况：n = 1, 2, 3
hanges anything. So the count is 1 for both circular and bracelet scenarios. Formula (1-1)! = 0! = 1 works.
当 n=1 时，只有一个物体，圆周排列是唯一的。旋转和翻转都不会改变任何东西。因此无论是圆周还是手镯情形，计数都为 1。公式 (1-1)! = 0! = 1 成立。
inear ways (AB and BA). With rotational equivalence, AB and BA are rotations of each other? Let' . In a circle of 2, both linear orders yield the same relative arrangement because there is no third object to define direction. Therefore, the number of circular permutations is 1, matching (2-1)! = 1.
当 n=2 时，两个不同的物体可以以两种线性方式放置在圆上（AB 和 BA）。考虑旋转等价性，AB 和 BA 是否互为旋转？让我们检验：将 A 和 B 放在相对的位置。如果旋转 180°，A 和 B 交换位置，但原来的循环顺序 A 然后 B 变成了 B 然后 A。在只有 2 个物体的圆上，两个线性排列给出了相同的相对排布，因为没有第三个物体来定义方向。因此，圆周排列数为 1，与 (2-1)! = 1 一致。
ions are also allowed, the bracelet count for n=2 should still be 1, but the formula (2-1)! firms that the halving formula only holds for n ≥ 3. For n=3, circular permutations: (3-1)! e any arrangement of three distinct items on a bracelet can be flipped to match the other.
如果也允许翻转，n=2 的手镯数仍应为 1，但公式 (2-1)!/2 会给出 0.5，这显然无效。这证实了折半公式仅适用于 n ≥ 3。对于 n=3，圆周排列数为 (3-1)! = 2。手镯数：2/2 = 1，这是正确的，因为三个不同物品在手镯上的任何一种排法都可以通过翻转变成另一种。
8. Circular Permutations with Repeated Elements | 带有重复元素的圆周排列
When some objects are identical, the problem becomes more complex because rotational symmetry may interact with the repetitions. For linear permutations with repeats, the formula n! / (k₁! k₂! ...) holds. In a circle we cannot simply divide by n, because not every rotation yields n distinct linear arrangements when duplicates exist.
当某些物体相同时，问题变得更加复杂，因为旋转对称可能与重复相互作用。对于有重复的线性排列，公式 n! / (k₁! k₂! ...) 成立。但在圆周上不能简单地除以 n，因为当存在重复时，并非每次旋转都会产生 n 种不同的线性排列。
Consider 4 beads: two red (R) and two blue (B). Linear distinct arrangements: 4!/(2!2! ar equivalence classes by rotating. For example, the linear string RRBB can be rotated to RB BR, which are the same circular arrangement. Enumerating carefully gives only 2 distinct circular permutations: one with adjacent same-colour beads and one with alternating colours. This illustrates that a simple closed-form formula does not exist in general.
考虑 4 颗珠子：两颗红色（R），两颗蓝色（B）。线性不同排列数为：4!/(2!2!) = 6。我们需要通过旋转将它们归入圆周等价类。例如，线性串 RRBB 可以旋转成 RB BR，即相同的圆周排列。仔细枚举可得到仅有 2 种不同的圆周排列：一种同色珠子相邻，另一种同色珠子交替。这说明了通常不存在简单的闭式公式。
To handle such cases systematically, especially when reflections are also permitted, we turn to more advanced tools such as Polya's Enumeration Theorem or Burnside's Lemma, which we will touch on later.
要系统处理这类问题，尤其是当也允许翻转时，我们需要借助更高级的工具，例如波利亚计数定理或伯恩赛德引理，稍后我们将简要提及。
9. Restrictions in Circular Arrangements | 圆周排列中的限制条件
Restrictions often appear in examination questions: certain items must sit together, or two particular individuals must not be adjacent. The anchoring method is extremely useful here. Fix one object (often an unrestricted one) to create a linear reference, then apply familiar constraint-handling techniques.
限制条件常常出现在考试题目中：某些物品必须相邻，或两个特定个体不得相邻。此时固定法极为有用。先固定一个物体（通常是不受限制的那个）来建立线性参考系，然后再应用熟悉的约束处理技巧。
angements becomes: (number of ways to arrange the remaining individuals and the block) × 2! for internal swapping. This yields a clear finite count.
例题：5 个人围坐圆桌。有一对必须相邻。固定一个人（不是这对中的）来消除旋转。将这对视为一个整体，但记得他们内部可以交换。排列数为：（安排其余人和这个整体的方式数）× 2!（内部交换）。这样就得到了清晰的有限计数。
If the restriction is that two people must NOT be adjacent, we can fix one, place the other in a non-adjacent seat, then arrange the rest. This method extends to many standard constraint scenarios, making the anchoring approach a powerful problem-solving strategy.
如果限制是两个人不能相邻，我们可以固定一人，将另一人安排在非相邻位置，然后再排列其他人。这种方法可扩展到许多标准的约束情境，使固定法成为一种强大的解题策略。
10. Connection to Group Theory and Burnside's Lemma (Optional Insight) | 与群论和伯恩赛德引理的联系（可选深入）
Circular permutations are a gateway to group-theoretic counting. The set of symmetries of a regular n-gon — rotations and reflections — forms the dihedral group Dₙ. Counting arrangements that are equivalent under a group action exactly leads to Burnside's Lemma (the Cauchy-Frobenius formula).
圆周排列是通向群论计数的大门。正 n 边形的对称集合——旋转和反射——构成二面体群 Dₙ。计算在群作用下等价的排列数正对应伯恩赛德引理（柯西 - 弗罗贝尼乌斯公式）。
Burnside's Lemma states: Number of orbits = (1/|G|) Σg∈ e the simple halving fails. For IB students, understanding this connection provides a deeper appreciation of symmetry in combinatorial enumeration.
伯恩赛德引理指出：轨道数 = (1/|G|) Σg∈G fix(g)，其中 fix(g) 是在对称操作 g 下保持不变的构型数目。将其应用于带有重复颜色的项链排列可以得到精确计数，即使在 n ≤ 2 这种简单折半公式失效的情况下也适用。对 IB 学生来说，理解这一联系能让他们更深入地领会组合计数中的对称性。
For example, with 4 beads of two colours, Burnside's Lemma systematically calculates the number of distinct necklaces under both rotations and reflections, yielding 6 distinct necklaces for 2 colours without restrictions, confirming manual enumeration.
例如，对于两种颜色的 4 颗珠子，伯恩赛德引理能系统地计算出在考虑旋转和翻转下的不同项链数，得到 6 条不同的项链（当颜色无限制时），与手工枚举吻合。
11. Applications and Real-Life Examples | 实际应用与例子
Circular permutations are not just abstract mathematics; they appear in arranging seats for diplomatic conferences, scheduling round-robin tournaments, designing combination locks with rotating dials, and enumerating molecular structures where atoms form rings.
圆周排列不仅是抽象数学；它们出现在外交会议的座次安排、循环赛日程编排、带有旋转拨盘的密码锁设计，以及原子形成环状的分子结构枚举等实际问题中。
In chemistry, organic molecules like benzene (C₆H₆) have a hexagonal ring; counting possible isomers with substituted groups around the ring uses circular permutation principles with repeated substituents. In computer science, circular lists and cyclical data structures rely on similar combinatorial reasoning.
在化学中，像苯（C₆H₆）这样的有机分子具有六元环；计算环上不同取代基可能形成的异构体数量就要用到带重复元素的圆周排列原理。在计算机科学中，循环链表和周期性数据结构也依赖于类似的组合推理。
These applications highlight why the seemingly simple shift from linear to circular arrangements demands careful consideration of symmetry and equivalence.
这些应用凸显了为什么从线性排列到圆周排列这一看似简单的转变，需要仔细考虑对称性和等价性。
12. Conclusion and Further Investigation | 结论与延伸探究
This investigation has built the core formulas for circular permutations: (n-1)! when rotations are equivalent, and (n-1)! g method for constrained arrangements and touched on the complexity introduced by repeated elements.
本探究构建了圆周排列的核心公式：旋转等价时为 (n-1)!，对于 n ≥ 3 个不同物体的手镯为 (n-1)!/2，同时注意到 n = 1,2 的特殊情况。我们探讨了用于受限排列的固定法，并触及了由重复元素引入的复杂性。
Further exploration could include the use of generating functions for distributions on a circle, the counting of necklaces with at most a given number of colours via Polya theory, or investigating arrangements on multiple concentric circles — a common extension in advanced combinatorics.
进一步的探索可以包括利用生成函数处理圆周
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图