Search arXivSearch

arXiv · 2609.08553

Fundamentals of the cocyclic development of Hadamard matrices over loops

Abstract

This paper establishes a formal framework for the cocyclic development of Hadamard matrices over loops based on a novel cohomology theory with associativity obstructions. In this context, we formalize the notion of a loop-cocyclic Hadamard matrix, so that both the classical cocyclic Hadamard matrices over groups and the recently introduced pseudococyclic Hadamard matrices over loops are naturally embedded within this broader algebraic architecture. To validate the computational viability of this framework, we prove the existence of four new Hadamard equivalence classes of order 24 and eight new classes of order 28 that are strictly non-cocyclic over any finite group, arising uniquely as loop-cocyclic developments over Moufang and right Bol loops.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raúl M. Falcón, Manuel González-Regadera, Félix Gudiel. 2026-09-08. Fundamentals of the cocyclic development of Hadamard matrices over loops. https://arxiv.org/abs/2609.08553

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