Enumeration of strong dichotomy patterns
Octavio A. Agust\'in-Aquino

TL;DR
This paper uses advanced group action counting techniques to enumerate specific bicolor patterns with trivial symmetry, proposing a potential cyclic sieving phenomenon in combinatorics.
Contribution
It applies White's Pólya-Redfield theory to enumerate strong dichotomy patterns, introducing new counts and conjectures in combinatorial symmetry analysis.
Findings
Counted bicolor patterns with trivial automorphism groups
Proposed a conjectural cyclic sieving phenomenon
Extended enumeration methods for combinatorial patterns
Abstract
We apply the version of P\'{o}lya-Redfield theory obtained by White to count patterns with a given automorphism group to the enumeration of strong dichotomy patterns, that is, we count bicolor patterns of with respect to the action of and with trivial isotropy group. As a byproduct, a conjectural instance of phenomenon similar to cyclic sieving for special cases of these combinatorial objects is proposed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematical Dynamics and Fractals · semigroups and automata theory
