Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.33050

Permutation automorphism groups of cyclic codes I: cyclotomic association schemes

Yanni Wu·Ziqing Xiang
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Berger-Charpin conjecture predicts that the permutation automorphism group of a cyclic code is generally the $q$-affine group, which is generated by the shift and the Frobenius multiplier on the index set. The word {\em generally} is not made precise in the literature, and the goal of this series of papers is to study when the Berger-Charpin conjecture or its variants hold. In this first part, we establish a natural connection between the theory of cyclic codes and the theory of cyclotomic association schemes (equivalently, Schur rings over cyclic groups). Using it, we show that the $q$-affine group is not the correct group to expect for certain code lengths. We characterize these lengths by an arithmetic condition, and show that they have density zero.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanni Wu, Ziqing Xiang. 2026-09-27. Permutation automorphism groups of cyclic codes I: cyclotomic association schemes. https://arxiv.org/abs/2609.33050

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Two poset polytopes are mutation-equivalent

The combinatorial mutation $\mathrm{mut}_w(P,F)$ for a lattice polytope $P$ was introduced in the context of mirror symmetry for Fano manifolds in [1]. It was also proved in \cite{ACGK} that for a lattice polytope $P \subseteq N_\mathbb{R}$ containing the origin in its interior, the polar dual $P^* \subseteq M_\mathbb{R}$ and $\mathrm{mut}_w(P,F)^* \subseteq M_\mathbb{R}$ have the same Ehrhart quasi-polynomial. To extend this framework, we introduce combinatorial mutation for rational pointed polyhedra in $N_\mathbb{R}$ containing the origin in their interiors. Such polyhedra are Minkowski sums of rational polytopes and rational polyhedral pointed cones. On the dual side $M_\mathbb{R}$, the construction applies to full-dimensional rational polytopes containing the origin, not necessarily in their interiors. As an application of this extension of the combinatorial mutation, we prove that the chain polytope of a poset $Π$ can be obtained by a sequence of combinatorial mutations in $M_\mathbb{R}$ from the order polytope of $Π$. Namely, the order polytope and the chain polytope of the same poset $Π$ are mutation-equivalent.

math.CO↗
arXiv2026

Congruences of shifted Jack Littlewood-Richardson coefficients

The shifted Jack Littlewood-Richardson coefficients generalize the ordinary Jack coefficients and are Laurent polynomials in the Jack parameter $α$. We prove a previously conjectured congruence: coefficients indexed by triples differing by a single box move are congruent modulo the shared $α$-hook at the pivot. We also prove a shifted Macdonald analogue, with a power-of-$t$ twist, and establish that the normalized shifted Macdonald coefficients are Laurent polynomials in $q$ and $t$. The proofs combine coincidences of shifted coordinates with Laurent-preserving shift transforms, and the Macdonald input uses Knop's inversion formula and the integrality of the Bergeron-Garsia-Haiman-Tesler operators. Finally, we realize the Jack and Macdonald congruences as necessary edge conditions on Hilbert schemes of points, in equivariant cohomology and equivariant $K$-theory, respectively. In the Macdonald case a tautological determinant twist accounts for the power-of-$t$ normalization

math.CO↗
arXiv2026

A 3-regular counterexample to the Bilu--Linial signing conjecture

We construct a finite connected simple cubic graph $F$ such that every signing of its edges yields a signed adjacency matrix with an eigenvalue outside $[-2\sqrt2,2\sqrt2]$. This disproves the Bilu--Linial signing conjecture for general regular graphs. The graph $F$ is not Ramanujan, and the conjecture restricted to Ramanujan base graphs remains open.

math.CO↗