Papers
Topics
Authors
Recent
Search
2000 character limit reached

Semigroup rings and algebraically independent sequences with respect to idempotents in commutative semigroups

Published 23 Sep 2025 in math.CO | (2509.18724v1)

Abstract: For any finite abelian group GG and commutative unitary ring RR, by R[G]R[G] we denote the group algebra over RR. Let T=(g1,,g)T=(g_1,\ldots,g_{\ell}) be a sequence over the group GG. We say TT is algebraically zero-sum free over R if i=1<sup>r(X<sup>giai)</sup></sup>0R[G]\prod\limits_{i=1}<sup>r(X<sup>{g_i}-a_i)\neq</sup></sup> 0\in R[G] for all a1,,aR0a_1,\ldots,a_{\ell}\in R\setminus {0}. Let $d(G,R)={\rm sup}{|T|: T \mbox{ is an algebraically zero-sum free sequence over } R \mbox{ of terms from }G}.$ This invariant of the group algebra R[G]R[G] plays a powerful role in the research for the zero-sum theory. In this paper, we generalize this invariant to the semigroup algebra R[S]R[S] for a commutative periodic semigroup SS. We give the best possible lower and upper bounds for d(S,R)d(S,R) for a general commutative periodic semigroup SS. In case that KK is a field, and SS is a finite commutative semigroup, we give more precise result, including the equality for Clifford semigroups, Archimedean semigroups and elementary semigroups, which covers all types of irreducible components associated with the semilattice decomposition and the subdirect product decomposition of a commutative semigroup. Also, the invariant d(S,K)d(S,K) was applied to the study of some zero-sum invariants in semigroups. One conjecture on the equality for d(S,K)d(S,K) in case KK is an algebraically closed field of characteristic zero was proposed which has been also partially affirmed in this paper.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.