Search arXivSearch

arXiv · 2507.21774

Coherent configurations and Frobenius structures

Abstract

We prove that coherent configurations can be represented as modules over Frobenius structures in the category of real nonnegative matrices. We generalize the notion of admissible morphism from association schemes to coherent configurations. We show that the Frobenius structure associated to a coherent configuration can be modified to become a dagger Frobenius structure, and use this to connect the coherent configurations to groupoids and $H^*$-algebras. We examine the properties of the dagger Frobenius structure with respect to admissible morphisms. We introduce the matrix $O$ obtained as the composition of comultiplication and multiplication of the dagger Frobenius structure and prove that we may obtain the valencies of colors, and thus recover the original coherent configuration, as an eigenvector of $O$. In the last part of the paper, we examine the spectrum of $O$ and apply it to generalize the Lagrange theorem from groups to association schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gejza Jenča, Anna Jenčová, Dominik Lachman. 2025-07-29. Coherent configurations and Frobenius structures. https://arxiv.org/abs/2507.21774

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