English

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} Γ(S)\Gamma(S) of a finite semigroup SS. Since we record global factorization multiplicities and local alternative counts, we define three counting invariants NS,NR,NCN_S,N_R,N_C. This gives that we have a simple degree formula deg(v)=2n3+Q(v),Q(v)=NS(sk)2NR(v)2NC(v). \text{deg}(v)=2n-3+Q(v),\qquad Q(v)=N_S(s_k)-2N_R(v)-2N_C(v). We show that Γ(S)\Gamma(S) is regular exactly when QQ is constant. We apply the framework to cancellative semigroups, bands, Brandt semigroups and null semigroups. For null semigroups, since we identify Γ(S)Kn×Kn\Gamma(S)\cong K_n\times K_n, we compute the spectrum and energy. A concise computational appendix lists the \texttt{GAP} driver and representative outputs.

Keywords

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

R2 v1 2026-07-01T07:59:26.509Z