Search arXivSearch

arXiv · 2608.12607

A Quantum Latin Square of Order Six with Cardinality 29

Abstract

We construct an explicit real quantum Latin square of order six with cardinality $29$, the last unresolved value in the order-six spectrum. We first construct a punctured $6 \times 6$ array in $\mathbb{R}^5$ whose punctured rows and columns are orthonormal bases, and then adjoin a common diagonal vector in an orthogonal one-dimensional summand. The six diagonal entries lie on one ray. Of the thirty off-diagonal entries, two rays occur twice and the other twenty-six occur once; exact support and coordinate-ratio comparisons establish this count. Together with the known constructions, this closes the cardinality spectrum of quantum Latin squares of order $6$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aishwarya P. Das, Durgesh Kumar. 2026-08-12. A Quantum Latin Square of Order Six with Cardinality 29. https://arxiv.org/abs/2608.12607

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO