Metraipolis › archive › dc_42d22feeaa1e

Finite identity bases for flat semirings of linear words — arXiv:2609.14349

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14349
License (as archived)
CC0-1.0
Archived
2026-10-16T01:25:17.107Z
SHA-256 of the archived text
d5b8d66dd921be22c0d8c98f6f50e5e37e0879e15881d7c363ac1fdb31bdbcd4
Stable URL of this page
https://metraipolis.com/documento/dc_42d22feeaa1e

How to cite

Finite identity bases for flat semirings of linear words — arXiv:2609.14349 — arXiv (en), https://arxiv.org/abs/2609.14349 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_42d22feeaa1e (Metraipolis archive dc_42d22feeaa1e, sha256 d5b8d66dd921be22c0d8c98f6f50e5e37e0879e15881d7c363ac1fdb31bdbcd4)
BibTeX
@misc{dc42d22feeaa1e,
  title = {Finite identity bases for flat semirings of linear words — arXiv:2609.14349},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14349},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_42d22feeaa1e; sha256 d5b8d66dd921be22c0d8c98f6f50e5e37e0879e15881d7c363ac1fdb31bdbcd4},
  year = {2026}
}

Archived text

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

For a set $W$ of nonempty words, let $S(W)$ be the flat semiring formed by the nonempty factors of words in $W$, together with an absorbing zero. We prove that $S(W)$ has a finite identity basis whenever every word in $W$ is linear, with no restriction on the size of $W$ or on the lengths of its words. In the bounded case its variety is generated by the interval semiring $A_m\cong S(a_1\cdots a_m)$, where $m$ is the maximum word length and the letters $a_i$ are distinct. In the unbounded case its variety is generated by the interval semiring on all finite intervals of the nonnegative integers. We give explicit finite bases in both cases. The proofs encode nonzero polynomial evaluations by endpoint graphs and derive the required graph identifications using finitely many splicing identities. In particular, the eleven-element semiring $S(abcd)$ is finitely based, providing a counterexample to the length-bound conjectures for $S(W)$ proposed by Gao, Ren and Zhao.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Group Theory (math.GR).
Pagina del lavoro: https://arxiv.org/abs/2609.14349 — 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-16T00:39:30.207Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).