Metraipolis › archive › dc_9ee244a1fb32

Near-factorizations in association schemes — arXiv:2610.07394

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07394
License (as archived)
CC0-1.0
Archived
2026-10-07T11:53:04.996Z
SHA-256 of the archived text
561ee7981f1b6c9d5e369f160fd8347733993a1edee207901df9ef08461d0a49
Stable URL of this page
https://metraipolis.com/documento/dc_9ee244a1fb32

How to cite

Near-factorizations in association schemes — arXiv:2610.07394 — arXiv (en), https://arxiv.org/abs/2610.07394 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9ee244a1fb32 (Metraipolis archive dc_9ee244a1fb32, sha256 561ee7981f1b6c9d5e369f160fd8347733993a1edee207901df9ef08461d0a49)
BibTeX
@misc{dc9ee244a1fb32,
  title = {Near-factorizations in association schemes — arXiv:2610.07394},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07394},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9ee244a1fb32; sha256 561ee7981f1b6c9d5e369f160fd8347733993a1edee207901df9ef08461d0a49},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07394. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We formally initiate the study of $\lambda$-fold $(s,t)$ near-factorizations in association schemes. Namely, given an association $(X, \mathcal{A})$, we consider the existence of a factorization of $\lambda(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 $\lambda$-fold $(s,t)$ near-factorizations in association schemes and calculate bounds for $\lambda$, $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 $\lambda$-fold near-factorization.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.07394 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:22:09.537Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).