Lower bound for the Erd\H{o}s-Burgess constant of finite commutative rings

Let $R$ be a finite commutative unitary ring. An idempotent in $R$ is an element $e\in R$ with $e^2=e$. The Erd\H{o}s-Burgess constant associated with the ring $R$ is the smallest positive integer $\ell$ such that for any given $\ell$ elements (repetitions are allowed) of $R$, say $a_1,\ldots,a_{\ell}\in R$, there must exist a nonempty subset $J\subset \{1,2,\ldots,\ell\}$ with $\prod\limits_{j\in J} a_j$ being an idempotent. In this paper, we give a lower bound of the Erd\H{o}s-Burgess constant in a finite commutative unitary ring in terms of all its maximal ideals, and prove that the lower bound is attained in some cases. The result unifies some recently obtained theorems on this invariant.


Introduction
Let S be a nonempty commutative semigroup, endowed with a binary associative operation * . Let E(S) be the set consisting of all idempotents of S, where e ∈ S is said to be an idempotent if e * e = e. Idempotent is one of central notions in Semigroup Theory and Algebra. One of our interest to combinatorial properties concerning idempotents in semigroups comes from a question of P. Erdős to D.A. Burgess (see [1] and [7]), which is stated as follows.
Let S be a finite nonempty semigroup of order n. A sequence of terms from S of length n must contain one or more terms whose product, in some order, is an idempotent?
Burgess [1] in 1969 gave an answer to this question in the case when S is commutative or contains only one idempotent. Note that every nonempty finite semigroup contains at least one idempotent (see [8] Chapter I, Corollary 5.9). D.W.H. Gillam, T.E. Hall and N.H. Williams [7] proved that a sequence T over any finite semigroup S of length at least |S \ E(S)| + 1 must contain one or more terms whose product, in the order induced from the sequence T , is an idempotent, and therefore, completely answered Erdős' question. The Gillam-Hall-Williams Theorem was extended to infinite semigroups by the author [14] in 2019. It was also remarked that the bound |S \ E(S)| + 1, although is optimal for general semigroups S, can be improved, at least in principle, for specific classed of semigroups. Naturally, one combinatorial invariant was aroused by Erdős' question with respect to idempotents of semigroups. Since we deal with the multiplicative semigroup of a commutative ring in this paper, we introduce only the definition of this invariant for commutative semigroups here.
Definition A. ( [14], Definition 4.1) For a commutative semigroup S, define the Erdős-Burgess constant of S, denoted by I(S), to be the least ℓ ∈ N ∪ {∞} such that every sequence T of terms from S and of length ℓ must contain one or more terms whose product is an idempotent.
Note that if the commutative semigroup S is finite, Gillam-Hall-Williams Theorem definitely tells us that the Erdős-Burgess constant of S exists, i.e., I(S) ∈ N is finite and bounded above by |S \ E(S)| + 1. In particular, when the semigroup S happens to be a finite abelian group, the Erdős-Burgess constant reduces to a classical combinatorial invariant, the Davenport constant. The Davenport constant of a finite abelian group G, denoted by D(G), is defined as the smallest positive integer ℓ such that every sequence of terms from G of length ℓ must contain one or more terms with the product being the identity element of G. This invariant was popularized by H. Davenport in the 1960's, notably for its link with algebraic number theory (as reported in [11]). For the progress about D(G), the reader may consult e.g., [3,6] on commutative groups, [4,5] on noncommutative groups, and [2,12,13,17,18] on commutative semigroups and commutative rings.
The author [15] obtained some conditions such that the Erdős-Burgess constant exists in general commutative rings, which is stated in Theorem B below.
• For any commutative unitary ring R, let U(R) be the group of units and S R the multiplicative semigroup of the ring R. Theorem B. [15] Let R be a commutative unitary ring. If I(S R ) is finite, then one of the following two conditions holds: Boolean unitary ring, and F q 1 , . . . , F q t are finite fields with 0 ≤ t ≤ I(S R ) − 1 and prime powers q 1 , . . . , q t > 2.
The above Theorem B asserts that the Erdős-Burgess constant exists only for finite com-mutative rings except for a family of infinite commutative rings with very special forms given as (ii) above. That is, to study this invariant in the realm of commutative rings, we may consider it only for finite commutative rings. Recently, J. Hao, H. Wang and L. Zhang obtained a sharp lower bound of the Erdős-Burgess constant in two classes of finite commutative rings, i.e., in the residue class ring Z nZ and in the quotient ring F q [x] K of the polynomial ring F q [x] modulo a nonzero proper ideal K, which are stated as Theorem C and Theorem D below.
Theorem C. [16] Let q be a prime power, and let F q [x] be the ring of polynomials over the where Ω(K) is the number of the prime ideals (repetitions are counted) and ω(K) the number of distinct prime ideals in the factorization when K is factored into a product of prime ideals. Moreover, equality holds for the case when K is factored into either a power of some prime ideal or a product of some pairwise distinct prime ideals.
Theorem D. [9] Let n > 1 be an integer, and let R = Z nZ be the ring of integers modulo n.
where Ω(n) is the number of primes occurring in the prime-power decomposition of n counted with multiplicity, and ω(n) is the number of distinct primes. Moreover, equality holds if n is a prime power or a product of pairwise distinct primes.
Note that both the ring F q [x] of polynomials over a finite field and the ring Z of integers are principal ideal domains and definitely are Dedekind domains, in which every nonzero proper ideal has a unique factorization as a product of prime ideals (which are also maximal ideals). N. Kravitz and A. Sah [10] completely generalized Theorems C and D to the finite quotient ring of any Dedekind domain. For a Dedekind domain D and a nonzero proper ideal K of D, let Ω(K) be the total number of prime ideals in the prime ideal factorization of K (with multiplicity), and let ω(K) be the number of distinct prime ideals in this factorization.
Theorem E. [10] Let D be a Dedekind domain and K a nonzero proper ideal of D such that R = D K is a finite ring. Then I(S R ) ≥ D(U(R)) + Ω(K) − ω(K). Moreover, equality holds if K is either a power of a prime ideal or a product of distinct prime ideals.
In this paper, we shall obtain a sharp lower bound for the Erdős-Burgess constant of a general finite commutative unitary ring, which generalizes Theorem E, and definitely deduces Theorem C and Theorem D as consequences. To give the theorem, we need one notion as follows.
Let R be a finite commutative unitary ring, and let N be an ideal of R. For any nonnegative integer i, let N i be the i-th power of the ideal N. In particular, we define N 0 = R. Define the index of the ideal N, denoted by Ind(N), to be the least nonnegative integer k such that N k = N k+1 , equivalently, the descending chain of ideals N 0 N 1 · · · N k = N k+1 = N k+2 = · · · becomes stationary starting from N k . Now we are in a position to give the theorem of this paper.
where M is taken over all distinct maximal ideals of R. Moreover, equality holds if R is a local ring or all its maximal ideals have the indices one.
Remark. Since any ideal K is prime if and only if it is maximal in a finite commutative unitary ring, we can restate Theorem 1.1 in terms of prime ideals of R as the following theorem. Moreover, we will show that Theorem 1.1 implies Theorem E, and therefore Theorem C and Theorem D as consequences in the final Concluding remarks section. where M is taken over all distinct prime ideals of R. Moreover, equality holds if R has a unique prime ideal or all its prime ideals have the indices one.

The Proof
To prove Theorem 1.1, we need to introduce some necessary notation and terminology, and follow the notation of A. Geroldinger, D.J. Grynkiewicz and others used for sequences over groups (see [5] for example). For integers a, b ∈ Z, we set [a, b] = {x ∈ Z : a ≤ x ≤ b}. Let R be a finite commutative unitary ring with multiplication *, an element e in R is called an idempotent if e * e = e. A sequence T of terms from R is a multi-set for which the repetitions of terms are allowed, denoted as where a i ∈ R for each i ∈ [1, ℓ]. By · we denote the concatenation of sequences which differs from the notation * used for the multiplication of the ring R. By |T | we denote the length of the sequence T . In particular, |T | = ℓ for the sequence T in (1). Since the ring R is commutative and the order of terms of T does not matter for the combinatorial property of sequences which will be investigated here, then for any permutation τ of [1, ℓ] we always identify a τ(1) a τ(2) · . . . · a τ(ℓ) with the sequence T given in (1). For any subset X ⊆ [1, ℓ], we say T ′ = • i∈X a i is a subsequence of T , denoted by T ′ | T , and in particular we call T ′ a proper [resp. nonempty] subsequence of T if X [1, ℓ] [resp. if X φ]. By ε we denote the empty sequence with |ε| = 0, which is a proper subsequence of every nonempty sequence. Let π(T ) = i∈ [1,ℓ] a i = a 1 * a 2 * · · · * a ℓ be the product of all terms of T . We adopt the convention that π(ε) = 1 R . By (T ) we denote the set of elements of R that can be represented as a product of one or more terms from T , i.e., (T ) = {π(T ′ ) : T ′ is taken over all nonempty subsequences of T }.
We call T an idempotent-product free sequence provided that no idempotent of R can be represented as a product of one or more terms from T , i.e., (T ) contains no idempotent.
Since x i is a finite sum of products of the form a 1 * a 2 * · · · * a k i −1 where a 1 , a 2 , . . . , a k i −1 ∈ M i , it follows that there exist k i − 1 elements, say y i,1 , . . . , y i,k i −1 ∈ M i such that Since M k 1 1 , . . . , M k r r are pairwise coprime ideals of R, by the Chinese Remainder Theorem, for any i ∈ [1, r] and j ∈ [1, k i − 1], we can find an element y i, j of R such that and By the definition of the Davenport constant, we can take a sequence V of terms from the group U(R) with length |V| = D(U(R)) − 1 (5) such that the identity element 1 R of the group U(R) can not be represented as a product of one or more terms from V, i.e., 1 R (V). Let y r, j ).
Assertion. The sequence T is idempotent-product free.
Proof. Assume to the contrary that T contains a nonempty subsequence T ′ such that π(T ′ ) is an idempotent. Since 1 R is the unique idempotent in U(R), it follows from (6) that at least one term of ( • y r, j ) appears in the sequence T ′ , then by rearranging the indices i ∈ [1, r] and j ∈ [1, k i − 1] we may assume without loss of generality that [1,n] where and 1 ≤ n ≤ k 1 − 1.
Suppose k 1 = · · · = k r = 1. To prove I(S R ) = D(U(R)) + r i=1 (k i − 1) = D(U(R)), we take an arbitrary sequence L of terms from R and of length D(U(R)). It suffices to show that L is not idempotent-product free. By the Chinese Remainder Theorem, for any term a of L we can take an element a ′ ∈ R such that for each i ∈ [1, r], It follows that a ′ M 1 ∪ · · · ∪ M r and so a ′ ∈ U(R  (14), M i = 0, we have that π(W) * π(W) = π(W) and so L is not idempotent-product free. This completes the proof of the theorem.

Concluding remarks
To show that Theorem 1.1 implies Theorem E, we shall prove the fact that in Theorem E the quantity Ω(K)−ω(K) coincides with Proof. Since D is a Dedekind domain, then the nonzero proper ideal K has a prime factorization, say K = P k 1 1 * P k 2 2 * · · · * P k r r where r > 0, P 1 , P 2 , . . . , P r are distinct prime ideals (maximal ideals) and k 1 , k 2 , . . . , k r > 0. Let θ : D → D K be the canonical epimorphism of D onto the quotient ring D K. Since P 1 , . . . , P r are all maximal ideals containing Ker(θ) = K in the ring D , we know that θ(P 1 ), θ(P 2 ), . . . , θ(P r ) are all distinct maximal ideals of D K. We see that P i P 2 i · · · P k i i , P t i i ⊇ K and θ(P i ) t i = θ(P t i i ) where i ∈ [1, r] and t i ∈ [1, k i ]. It follows that θ(P i ) θ(P i ) 2 · · · θ(P i ) k i , and so Ind(θ(P i )) ≥ k i for each i ∈ [1, r].
On the other hand, for each i ∈ [1, r] we have that θ −1 (θ(P k i +1 i )) = P k i +1 i + K = P k i +1 i + j∈ [1,r] P k j j = P k i i * (P i + j∈ [1,r]\{i} P k j j ) = P k i i * R = P k i i = P k i i + j∈ [1,r] P k j j = P k i i + K = θ −1 (θ(P k i i )). Since θ is surjective, we derive that θ(P k i +1 i ) = θ(P k i i ) and so θ(P i ) k i +1 = θ(P i ) k i . Combined with (16), we have that Ind(θ(P i )) = k i for each i ∈ We close this paper with the following problem.