Finite cyclic orbit spaces for necklaces
DefinitionAnalyticCombinatorics_Ch1_Polya_NecklacePhianalytic-combinatoricsgroup-actionslean4polya-enumeration
For a nonzero natural number , the binary colorings are considered modulo cyclic translations of their positions. This foundation supplies the finite orbit-quotient structure for those colorings, using the translation action already defined in the enumeration foundation. It does not define a numerical necklace count by a prescribed gcd or totient formula.
Definition code
import Definitions.Def_AnalyticCombinatorics_Ch1_Polya_Enumeration
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Binary necklaces, totient form
This file converts the gcd-form Burnside sum for binary necklaces into the
classical Euler-totient form.
-/
namespace AnalyticCombinatorics.Ch1.Polya.NecklacePhi
open scoped BigOperators
attribute [local instance] arrowAction
noncomputable local instance orbitRelDecidableRel {G X : Type*} [Group G] [MulAction G X] :
DecidableRel (MulAction.orbitRel G X).r :=
Classical.decRel _
noncomputable local instance orbitQuotientFintype (n : ℕ) [NeZero n] :
Fintype
(MulAction.orbitRel.Quotient (Multiplicative (ZMod n)) (ZMod n → Bool)) :=
Quotient.fintype (MulAction.orbitRel (Multiplicative (ZMod n)) (ZMod n → Bool))
end AnalyticCombinatorics.Ch1.Polya.NecklacePhi
Source