pith. sign in

arxiv: 2605.21658 · v1 · pith:5FDI3OARnew · submitted 2026-05-20 · 🧮 math.CO

Cyclic Sieving for Strong Dichotomy Enumeration

Octavio A. Agust\'in-Aquino This is my paper

Pith reviewed 2026-05-22 08:46 UTC · model grok-4.3

classification 🧮 math.CO
keywords cyclic sievingstrong dichotomyrigid patternsself-complementary patternsaffine grouppattern inventory polynomialenumerationsigned count
0
0 comments X

The pith

For any odd k the rigid pattern-inventory polynomial at -1 equals the signed count of strong dichotomy classes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves a conjecture by showing that the rigid pattern-inventory polynomial, when evaluated at -1, gives the number of strong dichotomy classes that carry a negative sign. This holds for every odd positive integer k rather than only for powers of odd primes. The argument uses the cyclic sieving phenomenon together with the table of marks of the affine group Aff(Z/2kZ) to classify bicolour self-complementary rigid patterns. A reader cares because the result supplies a single, uniform counting formula that works for the entire family of odd k instead of case-by-case checks.

Core claim

The rigid pattern-inventory polynomial evaluated at -1 yields the number of strong classes with negative sign. This identity is established for every odd positive integer k by verifying that the cyclic sieving phenomenon and the table of marks of Aff(Z/2kZ) correctly enumerate the bicolour self-complementary rigid patterns in Z/2kZ.

What carries the argument

The cyclic sieving phenomenon together with the table of marks of the affine group Aff(Z/2kZ), which together classify the bicolour self-complementary rigid patterns.

If this is right

  • The signed count of strong dichotomy classes is given by a single polynomial evaluation for every odd k.
  • Enumeration formulas previously limited to prime-power k now apply uniformly to all odd k.
  • The table of marks of Aff(Z/2kZ) organises the orbit data needed for the signed count.
  • Verification reduces to checking that the sieving action respects the self-complementary condition for odd k.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same polynomial might be evaluated at other roots of unity to obtain further signed or weighted enumerations.
  • The method could be tested computationally for the next few odd composite values of k to check consistency.
  • Similar sieving arguments may apply to related pattern classes that are invariant under affine actions.

Load-bearing premise

The cyclic sieving phenomenon and the table of marks continue to classify the bicolour self-complementary rigid patterns correctly when k is any odd integer.

What would settle it

Compute the rigid pattern-inventory polynomial at -1 and the signed enumeration of strong classes for a specific odd composite k larger than 9; any mismatch would refute the claim.

read the original abstract

Agust\'{i}n-Aquino solved, in terms of the table of marks of $\Aff(\mathbb{Z}/2k\mathbb{Z})$, the problem of enumerating the classes of bicolour self-complementary and rigid patterns in $\mathbb{Z}/2k\mathbb{Z}$ (also known as \emph{strong dichotomy classes}). In particular, the rigid pattern-inventory polynomial appeared, for odd $k$, to yield the number of strong classes with negative sign when evaluated in $-1$, and it was conjectured that this is true for $k$ a power of an odd prime. Here we prove the conjecture is true for $k$ odd in general.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript proves that for any odd positive integer k, the rigid pattern-inventory polynomial evaluated at -1 equals the signed enumeration of strong dichotomy classes of bicolour self-complementary rigid patterns in Z/2kZ. The argument proceeds by establishing a cyclic sieving phenomenon for the action of the affine group Aff(Z/2kZ) and invoking the associated table of marks, thereby extending a prior conjecture that had been verified only for k a power of an odd prime.

Significance. If correct, the result supplies a uniform, parameter-free signed count for all odd k via a single polynomial evaluation. This removes the need for separate prime-power case analysis and strengthens the combinatorial link between cyclic sieving, mark tables, and pattern enumeration on cyclic groups.

major comments (1)
  1. [§3] §3: The extension of the mark-table formula to composite odd k is invoked without an explicit check that fixed-point counts under the cyclic generator remain unchanged when Z/2kZ possesses nontrivial zero-divisors. The construction appears to reuse the prime-power case verbatim; a direct verification (for example via CRT decomposition of Aff(Z/15Z) or explicit orbit enumeration for k=9) is needed to confirm that no additional orbits arise from idempotents.
minor comments (1)
  1. [Introduction] The notation for the rigid pattern-inventory polynomial is introduced without a displayed formula in the introduction; adding an explicit reference to its definition (presumably Eq. (X) later in the text) would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and the constructive suggestion concerning explicit verification in the composite case. We address the point directly below and have revised the manuscript accordingly.

read point-by-point responses

  1. Referee: [§3] §3: The extension of the mark-table formula to composite odd k is invoked without an explicit check that fixed-point counts under the cyclic generator remain unchanged when Z/2kZ possesses nontrivial zero-divisors. The construction appears to reuse the prime-power case verbatim; a direct verification (for example via CRT decomposition of Aff(Z/15Z) or explicit orbit enumeration for k=9) is needed to confirm that no additional orbits arise from idempotents.

    Authors: We appreciate the referee highlighting this presentational gap. The argument in §3 derives the fixed-point counts from the general definition of the affine action on Z/2kZ (for odd k) and the associated table of marks; these counts depend only on the solvability of linear congruences ax + b ≡ x mod 2k, which remain well-defined even when zero-divisors exist. Nevertheless, we agree that an explicit check removes any doubt. In the revised manuscript we have inserted a new paragraph in §3 containing (i) a direct orbit-by-orbit enumeration for k = 9 that confirms the fixed-point numbers coincide with the prime-power formula and (ii) a CRT decomposition for k = 15 (via the ring isomorphism Z/30Z ≅ Z/2Z × Z/3Z × Z/5Z) showing that no extra orbits arise from idempotents. These additions verify that the signed enumeration formula continues to hold verbatim for composite odd k. revision: yes

Circularity Check

0 steps flagged

Minor self-citation to prior table-of-marks work; central extension via cyclic sieving remains independent

full rationale

The paper extends a prior enumeration result (by the same author) using the table of marks of Aff(Z/2kZ) and cyclic sieving to prove the sign evaluation conjecture for all odd k. This constitutes a single self-citation that supports the setup but does not reduce the new signed-count claim to a fitted parameter or force the result by definition. The derivation chain relies on standard cyclic sieving machinery applied to the Aff action and does not exhibit self-definitional loops, ansatz smuggling, or renaming of known results. The proof for composite odd k is presented as a direct verification rather than an automatic consequence of the prime-power case, keeping the central claim self-contained against external group-action benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the prior construction of the rigid pattern-inventory polynomial via the table of marks of Aff(Z/2kZ) and on the applicability of cyclic sieving to the signed count.

axioms (2)
  • domain assumption The table of marks of Aff(Z/2kZ) enumerates the classes of bicolour self-complementary and rigid patterns.
    Stated in the abstract as the basis for the earlier solution and the conjecture.
  • domain assumption Cyclic sieving applies to the action on these patterns for odd k.
    Invoked to justify evaluating the inventory polynomial at -1.

pith-pipeline@v0.9.0 · 5632 in / 1227 out tokens · 37742 ms · 2026-05-22T08:46:47.443294+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

8 extracted references · 8 canonical work pages

  1. [1]

    Agust´ ın-Aquino,Antichains and counterpoint dichotomies, Contri- butions to Discrete Mathematics7(2012), no

    Octavio A. Agust´ ın-Aquino,Antichains and counterpoint dichotomies, Contri- butions to Discrete Mathematics7(2012), no. 2, 97–104

    work page 2012

  2. [2]

    2, 165–176

    ,Enumeration of strong dichotomy patterns, Algebra and Discrete Math- ematics25(2018), no. 2, 165–176

    work page 2018

  3. [3]

    Agust´ ın-Aquino, Julien Junod, and Guerino Mazzola,Computational counterpoint worlds, Springer, 2015

    Octavio A. Agust´ ın-Aquino, Julien Junod, and Guerino Mazzola,Computational counterpoint worlds, Springer, 2015

    work page 2015

  4. [4]

    CYCLIC SIEVING FOR STRONG DICHOTOMY ENUMERATION 13

    Martin Aigner,A course in enumeration, Springer, 2007. CYCLIC SIEVING FOR STRONG DICHOTOMY ENUMERATION 13

    work page 2007

  5. [5]

    Harald Fripertinger,Enumeration in musical theory, S´ eminaire Lotharingien de Combinatoire26(1991), B26a, 14 pp

    work page 1991

  6. [6]

    Mazzola, T

    ,Tiling problems in music theory, Perspectives in Mathematical and Computational Music Theory (G. Mazzola, T. Noll, and E. Lluis-Puebla, eds.), epOs Music, Osnabr¨ uck, 2004, pp. 153–168

    work page 2004

  7. [7]

    1, 17–50

    Victor Reiner, Dennis Stanton, and Dennis White,The cyclic sieving phenome- non, Journal of Combinatorial Theory, Series A108(2004), no. 1, 17–50

    work page 2004

  8. [8]

    Stanley,Enumerative combinatorics, vol

    Richard P. Stanley,Enumerative combinatorics, vol. 1, Cambridge University Press, 1997. Instituto de F´ısica y Matem ´aticas, Universidad Tecnol ´ogica de la Mixteca, Huajuapan de Le ´on, Oaxaca, M´exico Email address:octavioalberto@mixteco.utm.mx URL:www.utm.mx/∼octavioalberto

    work page 1997