Every 4-equivalenced association scheme is Frobenius
From MaRDI portal
Publication:2175774
DOI10.1007/S00373-019-02037-YzbMATH Open1439.05232arXiv1712.09761OpenAlexW3013294928MaRDI QIDQ2175774FDOQ2175774
Authors: Bora Moon
Publication date: 30 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: For a positive integer , we say that an association scheme is -equivalenced if each non-diagonal element of has valency . -equivalenced is weaker than pseudocyclic. It is known that every -equivalenced association scheme is Frobenius when and every -equivalenced association scheme is pseudocyclic. In this paper, we will show that every -equivalenced association scheme is Frobenius.
Full work available at URL: https://arxiv.org/abs/1712.09761
Recommendations
Cites Work
- An algebraic approach to association schemes
- Title not available (Why is that?)
- On pseudocyclic association schemes
- Bases of Schurian antisymmetric coherent configurations and an isomorphism test for Schurian tournaments
- Cartan coherent configurations
- On association schemes all elements of which have valency 1 or 2
- Construction of Ferrero pairs of all possible orders
- On even generalized table algebras
- Every 3-equivalenced association scheme is Frobenius
- ON 4-EQUIVALENCED ASSOCIATION SCHEMES
Cited In (2)
This page was built for publication: Every 4-equivalenced association scheme is Frobenius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175774)