Weighted Zero-Sum Subsequence Theory
- Weighted zero-sum subsequences are sequences of group elements with assigned weights that sum to zero, forming a fundamental structure in combinatorial number theory.
- They reveal deep structural properties of finite abelian groups, with key invariants such as the weighted Davenport constant and extremal sequence constructions.
- Recent developments, especially in the plus-minus weighted case, integrate factorization theory, commutative algebra, and additive combinatorics to solve open problems.
A weighted zero-sum subsequence is a fundamental structure in additive and combinatorial number theory, where one seeks subsequences of group elements such that their weighted sum, under prescribed sets of coefficients (“weights”), vanishes in the group. The precise nature of “weighting,” the types of groups considered, and the corresponding extremal invariants (e.g., Davenport constants, extremal sequences, structural monoid properties) yield a rich and highly developed theory, especially in the context of finite abelian groups. The plus-minus weighted zero-sum case (where weights are restricted to ) has recently received a comprehensive algebraic and arithmetic treatment, synthesizing techniques from factorization theory, commutative algebra, and additive combinatorics (Fabsits et al., 2023, Geroldinger et al., 2022).
1. Definitions and Core Principles
Let be an (additively written) abelian group. The free abelian monoid consists of finite sequences with terms ; the monoid operation is concatenation. A sequence is called a plus-minus weighted zero-sum sequence if there are signs such that
The collection of all plus-minus weighted zero-sum sequences forms the submonoid , equipped with concatenation as its operation and the empty sequence as its identity.
More generally, for a given set of group automorphisms (“weight-set”), a -weighted zero-sum sequence is for which there exist with
The monoid of all such sequences is denoted (Geroldinger et al., 2022).
2. Algebraic and Structural Properties
The monoid admits a rich ideal-theoretic and algebraic theory:
- Mori property: is a Mori monoid (i.e., satisfies ACC on divisorial/v-ideals) if and only if $2G$ is finite, equivalently with an elementary $2$-group and finite.
- Krull property: is a Krull monoid if and only if is an elementary $2$-group. Hence, for almost all beyond the trivial () cases, the plus-minus weighted zero-sum monoid is not Krull.
- Finite generation (C-monoid): is finitely generated if and only if is finite. In this case, its atoms (irreducibles) are exactly the minimal plus-minus weighted zero-sum sequences; these are necessarily finite in number.
A parallel theory holds for more general ; the monoids are always reduced, finitely generated, and cancellative for finite , with factorization invariants controlled by the structure of and the weight-set (Geroldinger et al., 2022). Seminormality can be characterized in terms of group exponent ( for ).
3. Invariants and Extremal Constants
The study of weighted zero-sum subsequences centers around several extremal invariants:
- Weighted Davenport constant : Minimal so every sequence of length over contains a nonempty -weighted zero-sum subsequence, where is the weight-set (e.g., in the plus-minus case).
- Counting function : Number of nonempty subsequences of whose -weighted sum is zero. For and of exponent , the bound holds, and is sharp for extremal (Lemos et al., 2015, Lemos et al., 2018, Lemos et al., 2022).
- Consecutive weighted zero-sum constant : Minimal so every sequence of length in has a (consecutive) -weighted zero-sum subsequence. For in cyclic or direct sum settings, explicit recursive/closed formulas are obtained, e.g., for odd (Mondal et al., 2021).
- Unit-weighted and higher residue-structure constants: For , , and odd, explicit closed forms for and are known and admit recursive constructions depending on prime decomposition and residue degree (Mondal et al., 2021, Mondal et al., 2022, Paul et al., 2022).
4. Isomorphism and Characterization Problems
A key structural question is the isomorphism problem: for which does as monoids imply as groups? For finite direct sums of cyclic groups, the answer is affirmative: an isomorphism of monoids necessarily induces a group isomorphism (Fabsits et al., 2023). The proof extracts invariants from factorization structure, notably through atom-squares.
A related question is the characterization problem: does equality of systems of lengths imply ? This is resolved positively for cyclic groups of odd order (determined by factorization lengths) and for various small groups, with the exception of certain index-two phenomena in composite order cases (Fabsits et al., 2023, Geroldinger et al., 2022).
| property | Main invariant/control | |
|---|---|---|
| Elementary $2$-group | Krull monoid | Krull class group/C-monoid |
| finite | Finitely generated | Atoms enumerate all minimal sums |
| , odd | Sets of lengths characterize | |
| Not Mori | Infinite $2G$ |
5. Explicit Constructions and Extremal Sequences
For each weighted zero-sum invariant, sharp constructions realize the critical threshold:
- For (e.g., , ), extremal sequences avoid nontrivial -weighted zero-sum subsequences up to the critical length, by explicit combinatorial or linear-algebraic constructions (Godinho et al., 2011).
- For , extremal sequences for the unit-weighted consecutive constant are constructed recursively: for , a C-extremal sequence contains exactly one odd term (at the midpoint) and all others even, with recursively C-extremal left and right halves after division by 2 (Mondal et al., 2022).
- For non-principal weight-sets (e.g., cubes, squares), extremal sequences combine prime-power and CRT-local constructions, with the critical length determined by the corresponding local invariants (Sarkar, 2022, Paul et al., 2022).
Minimal zero-sum sequences and the structure of the extremals for enumeration bounds (e.g., sequences achieving ) have been systematically classified for finite cyclic and direct product groups (Lemos et al., 2018, Lemos et al., 2015, Lemos et al., 2022).
6. Connections to Factorization Theory and Arithmetic Applications
The investigation of monoids of weighted zero-sum sequences is tightly bound to non-unique factorization theory. A monoid is atomic if every nonunit factors into irreducibles ("atoms"), and much of the arithmetic structure (lengths of factorizations, catenary degrees, -invariants, union and distance sets) is determined by the configuration of minimal zero-sum sequences:
- For norm monoids in Galois number fields, transfer homomorphisms to monoids of weighted zero-sum sequences show that the factorization theory of number rings is governed by the corresponding zero-sum monoid (Geroldinger et al., 2022).
- Sets of lengths in weighted monoids often form intervals or unions with endpoints explicitly described; for and plus-minus weighting, the set of distances is and major invariants (catenary degree, -invariant) are all equal to (Geroldinger et al., 2022).
- Open questions remain regarding realization of possible length sets, monotone catenary degree comparison between monoids, and the full scope of the invertibility of the length-system-characterization mapping.
The structure and arithmetic of encode both combinatorial and monoidal complexity, with deep links to classical invariants and modern factorization-theoretic techniques (Fabsits et al., 2023, Geroldinger et al., 2022).
7. Open Problems and Research Directions
Active areas of inquiry include:
- Extension to infinite abelian groups: The universal zero-sum invariant framework generalizes these problems and admits interpretations in infinite settings, with covering theory (Neumann) linking finiteness of weighted Davenport constants to group structure (Wang, 2022).
- Classification for general weight-sets: While much is known for , further classes (arbitrary subgroups, "Jacobi symbol" weights, polynomial images) remain to be fully characterized with respect to invariants such as and (Mondal et al., 2022).
- Factorization set-determination: To what extent does the system of sets of lengths or distance sets determine the group up to isomorphism for ?
- Structural arithmetic in monoids of higher weights: Determining Krull, seminormal, and root-closed properties in wider classes of weighted zero-sum monoids, and understanding their role as transfer targets from number-theoretic monoids.
Continued research is likely to focus on the interplay between higher-order weightings, noncyclic groups, modular parameters, and arithmetic invariants.
References:
- (Fabsits et al., 2023): On Monoids of plus-minus weighted Zero-Sum Sequences: The Isomorphism Problem and the Characterization Problem
- (Geroldinger et al., 2022): On monoids of weighted zero-sum sequences and applications to norm monoids in Galois number fields and binary quadratic forms
- (Mondal et al., 2021): Extremal sequences for a weighted zero-sum constant
- (Mondal et al., 2021): On a different weighted zero-sum constant
- (Lemos et al., 2015): On the number of weighted subsequences with zero-sum in a finite abelian group
- (Lemos et al., 2018): On the number of fully weighted zero-sum subsequences
- (Lemos et al., 2022): On the Number of Weighted Zero-sum Subsequences
- (Mondal et al., 2021): Zero-sum constants related to the Jacobi symbol
- (Sarkar, 2022): Generalization of some weighted zero-sum theorems and related Extremal sequence
- (Wang, 2022): The universal zero-sum invariant and weighted zero-sum for infinite abelian groups
- (Godinho et al., 2011): Weighted Zero-Sum Problems Over
- (Mondal et al., 2022): On unit-weighted zero-sum constants of