Search arXivSearch

arXiv · 2608.06920

Classification of Symmetric Hadamard Matrices Up to Order 32

Abstract

In this paper, symmetric Hadamard matrices are classified up to Hadamard equivalence for all orders at most 32. In particular, an error in the previous classification of symmetric Hadamard matrices of order 28 is corrected. The number of distinct symmetric Hadamard matrices at each order is also enumerated. The classification and enumeration are carried out using a new algorithm that determines whether a given Hadamard matrix is equivalent to a symmetric one. The extension of the algorithm to weighing matrices is also described, and theoretical results concerning symmetric Hadamard and weighing matrices are established.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tuomo Valtonen. 2026-09-09. Classification of Symmetric Hadamard Matrices Up to Order 32. https://arxiv.org/abs/2608.06920

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