Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.05292

On the lengths of MDS codes with a two-transitive permutation automorphism group

Haihua Deng·Tao Feng·Andrey V. Vasil'ev
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $C$ be an $[n,k]_q$ maximum distance separable (MDS) code with $4\le k\le q-3$, and suppose that it has a $2$-transitive permutation automorphism group. In this paper we show that $n\le q+1$, so the MDS conjecture holds for this class of codes.

Explore related subjects

math.COcs.ITmath.GRmath.IT

Keep this discovery

BibTeXRIS

Haihua Deng, Tao Feng, Andrey V. Vasil'ev. 2026-09-04. On the lengths of MDS codes with a two-transitive permutation automorphism group. https://arxiv.org/abs/2609.05292

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

Discover connections

cs.IT subjectmath.CO subjectmath.GR subjectmath.IT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Group-averaged Markov chains II: tuning of group action in finite state space

We study group-averaged Markov chains obtained by augmenting a $π$-stationary kernel $P$ with orbit kernels induced by a group action. We analyse the Gibbs ($G$), Metropolis--Hastings ($M$), and Barker ($B$) kernels, their sandwiches $QPQ$, and mixtures $\tfrac{1}{2}(P+Q)$, where $Q\in\{G,M,B\}$. Under suitable conditions, $M^t$ and $B^t$ converge blockwise to $G$. The projection chains of $GPG$ and $P$ coincide, while every sandwich $QPQ$ has absolute spectral gap no smaller than that of reversible $P$. For $GPG$, we derive an additive asymptotic-variance bound, prove monotonicity for $G$-invariant observables, and identify it as the Kullback--Leibler (KL) information projection of $P$ onto the $G$-invariant kernels. For a fixed orbit partition, the spectral and KL properties of $GPG$ reduce to those of a lower-dimensional orbit-space chain. Among Gibbs projections with a prescribed number of orbits, we identify the partition minimizing KL divergence to stationarity and characterize exact stationarity. Finally, alternating group projections converge at a rate determined by singular values of an overlap matrix and, in structured cases, can yield exact sampling with logarithmically many group actions. These results motivate tuning heuristics and yield polynomial mixing for a Curie--Weiss example in a regime where Glauber dynamics is exponentially slow.

math.PR↗
arXiv2026

Extremal Asymmetric Depth of Planar Graphs and Hidden Near-Mirror Symmetries of IPR Fullerenes

Although almost all graphs are asymmetric -- having no nontrivial global automorphisms -- they may still possess local symmetries in the form of isomorphisms between induced subgraphs, i.e., partial automorphisms. We study such local symmetries via asymmetric depth, defined in terms of the maximum rank of a nontrivial partial automorphism. We prove a tight upper bound on asymmetric depth in the class of planar graphs and identify the extremal graphs: duals of IPR fullerenes attain the maximum already on $47$ vertices. Our main structural result concerns the IPR fullerenes that are neither maximally asymmetric nor symmetric. In such a cage no purely local action realises a low asymmetric depth, and we show that the map which does realise it cannot be confined to a small part of the cage either: neither to a single face, nor behind an interface of at most $5-k$ edges, $k \le 3$ being the deficiency. A cage of asymmetric depth $2$ or $3$ is therefore not asymmetric in one place; it carries a broken symmetry invisible to its automorphism group. Such cages are rare -- under $2\%$ of the asymmetric IPR fullerenes at $n = 118$. In all $727$ of them the largest partial automorphism is a near-mirror reflection, which we state as an explicit conjecture. We also extend the asymmetric depth bound to graphs of higher genus.

math.CO↗