2021
DOI: 10.26493/1855-3974.2101.b76
|View full text |Cite
|
Sign up to set email alerts
|

On few-class Q-polynomial association schemes: feasible parameters and nonexistence results

Abstract: We present the tables of feasible parameters of primitive 3-class Q-polynomial association schemes and 4and 5-class Q-bipartite association schemes (on up to 2800, 10000, and 50000 vertices, respectively), accompanied by a number of nonexistence results for such schemes obtained by analysing triple intersection numbers of putative open cases.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…We are aware of one more feasibility condition for symmetric association schemes, the forbidden quadruple condition described in [7,Corollary 4.2]. Our 4-point transitive examples do not have any nontrivial Krein parameters equal to zero, so they satisfy this condition vacuously.…”
Section: Accepted Manuscriptmentioning
confidence: 99%
“…We are aware of one more feasibility condition for symmetric association schemes, the forbidden quadruple condition described in [7,Corollary 4.2]. Our 4-point transitive examples do not have any nontrivial Krein parameters equal to zero, so they satisfy this condition vacuously.…”
Section: Accepted Manuscriptmentioning
confidence: 99%
“…Moreover, this scheme is Qpolynomial (see [2] for the definitions and more results about P, Q-polynomial association schemes). Williford [8,9] compiled the tables of feasible parameters of primitive 3-class Qpolynomial association schemes (on up to 2800 vertices), where the uniqueness of the scheme W was left blank (see also [6,Appendix B]). In this note, we show that W is unique, i.e., it is determined up to isomorphism by its parameters.…”
Section: Introductionmentioning
confidence: 99%