OpenAlex ·
Near-factorizations in association schemes
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.07394
- Original
- Read it at the publisher
- Topics
Abstract
We formally initiate the study of $λ$-fold $(s,t)$ near-factorizations in association schemes. Namely, given an association $(X, \mathcal{A})$, we consider the existence of a factorization of $λ(J-I)$ into 01-matrices $S$ and $T$ with the constraint that $S$ and $T$ must belong to the adjacency algebra of $(X, \mathcal{A})$. We establish basic properties of $λ$-fold $(s,t)$ near-factorizations in association schemes and calculate bounds for $λ$, $s$, and $t$ relative to the order of the association scheme. We completely determine all near-factorizations in symmetric and asymmetric 2-class association schemes. Furthermore, we construct near-factorizations in certain Hamming schemes, cyclotomic association schemes, Schurian schemes on small primitive groups, and the folded cube and halved cube association schemes. Finally, we establish that certain Hamming schemes, Johnson schemes, and Grassmann schemes do not admit a $λ$-fold near-factorization.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Dimension Amplification for Tarski Fixed-Point Query Lower Bounds
Perfect state transfer on mixed graphs: complete classes and transfer times
Non-dyadic Laver algebras
On the complexity of the single-move labeled token routing problem
Random independent sets in triangle-free and linear Berge-$C_4$-free hypergraphs
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.