Search arXivSearch

arXiv · 2606.19095

Schur rings over cyclic groups having Almost Commutative Terwilliger algebras

Abstract

Terwilliger algebras are subalgebras of a matrix algebra constructed from an association scheme. Rie Tanaka defined what it means for a Terwilliger algebra to be almost commutative and gave five equivalent conditions in the case where the association scheme is commutative. A sixth condition for a Terwilliger algebra coming from a commutative Schur ring to be almost commutative has since been discovered. In this paper we first provide a classification of orbit Schur rings that produce an almost commutative Terwilliger algebra for a finite cyclic group. In particular, we show that the subgroup of automorphisms used to form the orbit Schur ring is either trivial, or the whole automorphism group when the cyclic group has prime power order. If the cyclic group has order $2^n$, these are the only options. If the cyclic group has order $p^n$, for an odd prime $p$, then the automorphism subgroup of order $p^{n-1}$ also works. If the group has a non-prime power order then the only orbit Schur ring that produces an almost commutative Terwilliger algebra comes from the trivial subgroup of the automorphism group. We then give a condition for when a wedge product of Schur rings produces an almost commutative Terwilliger algebra. This allows us to determine exactly when a Schur ring over a cyclic group produces an almost commutative Terwilliger algebra.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicholas L. Bastian, Stephen P. Humphries. 2026-06-17. Schur rings over cyclic groups having Almost Commutative Terwilliger algebras. https://arxiv.org/abs/2606.19095

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