Every 4-equivalenced association scheme is Frobenius
classification
🧮 math.CO
keywords
equivalencedassociationschemeeveryfrobeniuspseudocyclicelementinteger
read the original abstract
For a positive integer $k$, we say that an association scheme $(\Omega,S)$ is $k$-equivalenced if each non-diagonal element of $S$ has valency $k$. $k$-equivalenced is weaker than pseudocyclic. It is known that every $k$-equivalenced association scheme is Frobenius when $k=2,3$ and every $4$-equivalenced association scheme is pseudocyclic. In this paper, we will show that every $4$-equivalenced association scheme is Frobenius.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.