Generalized Latin Square Graphs of Semigroups: A Counting Framework for Regularity and Spectra
Combinatorics
2026-01-01 v2
Abstract
We introduce the \emph{Generalized Latin Square Graph} of a finite semigroup . Since we record global factorization multiplicities and local alternative counts, we define three counting invariants . This gives that we have a simple degree formula We show that is regular exactly when is constant. We apply the framework to cancellative semigroups, bands, Brandt semigroups and null semigroups. For null semigroups, since we identify , we compute the spectrum and energy. A concise computational appendix lists the \texttt{GAP} driver and representative outputs.
Cite
@article{arxiv.2511.23190,
title = {Generalized Latin Square Graphs of Semigroups: A Counting Framework for Regularity and Spectra},
author = {Mohammad Reza Sorouhesh and Mayam Golriz and Bozorg Panbehkar},
journal= {arXiv preprint arXiv:2511.23190},
year = {2026}
}
Comments
21 pages, 3 figure, 1 Table