🔢 mathematics

Doubly-weighted zero-sum constants

This paper establishes that every sequence of length $2n-1$ in $\mathbb{Z}_n$ contains an $(A,B)$ -weighted zero-sum subsequence of length $n$ , determines the corresponding minimal constant $E_{A,B}$ , and characterizes the extremal sequences that fail to satisfy this property for specific pairs of subsets $A$ and $B$ .

Original authors: Krishnendu Paul, Shameek Paul

Published 2026-07-09

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Krishnendu Paul, Shameek Paul

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are hosting a game night with a group of friends sitting in a circle. The game involves numbers, and the goal is to find a specific "magic combination" within a long line of numbers that adds up to zero. This paper is like a rulebook for a very specific, high-stakes version of this game played in a world called $\mathbb{Z}_n$ (think of this as a clock face where the numbers wrap around, like a 12-hour clock, but with $n$ hours).

Here is a simple breakdown of what the authors, Krishnendu Paul and Shameek Paul, discovered.

The Game Setup: The "Double-Check" Rule

In this game, you have a sequence (a line) of numbers. Usually, in math games, you just look for a group of numbers that add up to zero. But this paper introduces a "Double-Check" rule.

To win, you need to find a sub-group of numbers that satisfies two conditions at the same time:

The Sum: When you multiply each number by a specific "weight" (a multiplier chosen from a set $A$ ) and add them up, the result must be zero.
The Balance: When you multiply those same weights by another set of numbers (from a set $B$ ) and add those up, the result must also be zero.

Think of it like a seesaw. You have to place weights on the seesaw so that:

The total weight balances the load (Condition 1).
The total weight of the people holding the weights also balances out (Condition 2).

If you can find a group of numbers that does both, you have found a "Doubly-Weighted Zero-Sum Sequence."

The Big Question: How Long is the Line?

The authors ask a fundamental question: "How many numbers do I need to write down in a row before I am guaranteed to find a winning group?"

They define three specific "guarantee numbers" (constants):

$D$ (The General Guarantee): How long the line must be to guarantee any winning group, no matter how the numbers are arranged.
$C$ (The Consecutive Guarantee): How long the line must be to guarantee a winning group where the numbers are right next to each other (like a block of friends sitting together).
$E$ (The Exact Size Guarantee): How long the line must be to guarantee a winning group that has exactly $n$ numbers (the same size as the whole clock face).

The Main Discoveries

The paper calculates these "guarantee numbers" for different scenarios. Here are the key findings translated into everyday terms:

1. The "Standard" Game (Weights are 1)
If the weights are just the number 1 (meaning we just want numbers that add to zero), the authors confirm a known rule: You need a line of $2n - 1$ numbers to guarantee a winning group of size $n$ .

Analogy: If you have a 12-hour clock, you need to write down 23 numbers to be 100% sure you can find 12 of them that add up to zero.

2. The "Double-Check" Game (Weights are any non-zero number)
The authors looked at what happens when the weights can be any non-zero number on the clock face.

The "Exact Size" Result: For most clock sizes, you need a line of $n + 1$ numbers to guarantee a winning group of size $n$ $n$ .
- Analogy: If you have a 12-hour clock, you only need to write down 13 numbers to guarantee you can find a group of 12 that passes the double-check. This is much easier than the standard game!
- The Exception: There is a weird exception for a 3-hour clock, where you need 5 numbers instead of 4.

3. The "Consecutive" Game (Numbers must be neighbors)
If the winning group must be a block of neighbors:

For the standard game, you need $n^2$ numbers (e.g., 144 numbers for a 12-hour clock).
For the double-check game, the number drops significantly to just 4 (for clocks larger than 2 hours).
- Analogy: It is surprisingly easy to find a "double-check" winning block of neighbors. If you write down just 4 numbers, you are almost guaranteed to find a winning trio right next to each other.

The "Extreme" Sequences (The Losers)

The paper also identifies the "worst-case scenarios." These are sequences that are just one number short of the guarantee.

If you have a line of length $D-1$ (or $C-1$ , or $E-1$ ), it is possible to arrange the numbers so that no winning group exists.
The authors describe exactly what these "losing" lines look like. They usually involve a lot of zeros and a few specific numbers repeated in a pattern that "breaks" the balance.
- Analogy: Imagine trying to arrange 12 friends so that no group of 12 can balance the seesaw. The paper tells you exactly how to stand them up to fail the test.

Summary of the "Rules" Found

The authors created a map showing how the difficulty of the game changes based on the rules:

If the weights are "units" (numbers that can be divided): The game is harder. You need longer lines to guarantee a win.
If the weights include "zero-divisors" (numbers that multiply to zero): The game becomes much easier. You can guarantee a win with a much shorter line.

Why This Matters (According to the Paper)

The paper doesn't claim this will cure diseases or build bridges. Instead, it solves a puzzle in number theory. It answers the question: "What are the absolute limits of these number games?"

By figuring out the exact "guarantee numbers" ( $D$ , $C$ , and $E$ ) for these specific double-check rules, the authors have filled in missing pieces of a larger mathematical picture. They showed that adding a second condition (the "Balance" rule) often makes the game easier to win than the standard version, requiring fewer numbers to guarantee a solution.

In short, they mapped out the "tipping points" where chaos turns into order for these specific types of number sequences.

Technical Summary: Doubly-Weighted Zero-Sum Constants

Problem Statement
This paper investigates the existence of "doubly-weighted zero-sum subsequences" within sequences of elements from the ring $\mathbb{Z}_n$ . Given non-empty subsets $A, B \subseteq \mathbb{Z}_n$ and a sequence $S = (x_1, \dots, x_k)$ in $\mathbb{Z}_n$ , the authors define $S$ as an $(A, B)$ -weighted zero-sum sequence if there exist weights $a_1, \dots, a_k \in A$ and $b_1, \dots, b_k \in B$ such that:

$\sum_{i=1}^k a_i x_i = 0$
$\sum_{i=1}^k b_i a_i = 0$

The study focuses on determining the minimal length constants required to guarantee the existence of such subsequences under specific constraints. Three primary constants are defined for a module $M$ (specifically $\mathbb{Z}_n$ ):

$C_{A,B}(M)$ : The least integer $k$ such that every sequence of length $k$ has an $(A, B)$ -weighted zero-sum subsequence of consecutive terms.
$D_{A,B}(M)$ : The least integer $k$ such that every sequence of length $k$ has an $(A, B)$ -weighted zero-sum subsequence (non-consecutive allowed).
$E_{A,B}(M)$ : The least integer $k$ such that every sequence of length $k$ has an $(A, B)$ -weighted zero-sum subsequence of length exactly $|M|$ .

The paper also characterizes "extremal sequences"—sequences of length $k-1$ that do not possess the required zero-sum property—for specific pairs $(A, B)$ .

Methodology
The authors employ a combination of combinatorial arguments, structural analysis of sequences in $\mathbb{Z}_n$ , and the use of specific weight sets. The methodology involves:

Establishing Bounds: Using the Erdős-Ginzburg-Ziv theorem and properties of the ring characteristic to derive upper bounds for the constants (e.g., $C_{A,B}(n) \leq n^2$ and $E_{A,B}(n) \leq 2n-1$ ).
Constructing Extremal Examples: Creating specific sequences (often involving repetitions of 0 and 1, or permutations of units) to prove that the derived upper bounds are sharp.
Case Analysis: Analyzing the behavior of the constants based on the properties of the weight sets $A$ and $B$ , specifically distinguishing between cases where subsets are contained within the group of units $U(n)$ versus cases where they contain zero-divisors.
Equivalence and Translation: Utilizing the concepts of "equivalent" sequences (via permutation and multiplication by a unit) and "translates" (adding a constant to all terms) to classify extremal sequences. The paper leverages the observation that if $S$ is an $(A, 1)$ -weighted zero-sum sequence, any translate of $S$ retains this property.

Key Results
The paper determines exact values for the constants and characterizes the corresponding extremal sequences for several specific pairs of weight sets $(A, B)$ :

The Pair $(1, 1)$ :
- The constants are determined as $D_{1,1}(n) = E_{1,1}(n) = 2n - 1$ and $C_{1,1}(n) = n^2$ .
- $D$ - and $E$ -extremal sequences are characterized as translates of sequences equivalent to $(0, \dots, 0, 1, \dots, 1)$ (with $n-1$ zeros and $n-1$ ones).
- $C$ -extremal sequences are characterized as translates of sequences formed by interleaving zeros with terms from a $C$ -extremal sequence for the set $\{1\}$ .
The Pair $(\mathbb{Z}'_n, 1)$ :
- Here $\mathbb{Z}'_n = \mathbb{Z}_n \setminus \{0\}$ .
- $D_{\mathbb{Z}'_n, 1} = 3$ and $C_{\mathbb{Z}'_n, 1} = 4$ .
- $E_{\mathbb{Z}'_n, 1} = n + 1$ for $n \neq 3$ , and $E_{\mathbb{Z}'_3, 1} = 5$ .
- The paper characterizes the extremal sequences for these constants, showing that for $n \neq 3$ , $E$ -extremal sequences for $(\mathbb{Z}'_n, 1)$ are translates of $E$ -extremal sequences for $\mathbb{Z}'_n$ . For $n=3$ , the extremal sequences are translates of sequences equivalent to $(0, 0, 1, 1)$ .
The Pair $(A, \mathbb{Z}'_n)$ where $A \subseteq \mathbb{Z}'_n$ :
- The paper establishes relationships between the constants for $(A, \mathbb{Z}'_n)$ and those for $A$ alone.
- If $A \subseteq U(n)$ (units), then $D_{A, \mathbb{Z}'_n} = D_A + 1$ and $C_{A, \mathbb{Z}'_n} = 2C_A$ .
- If $A \not\subseteq U(n)$ , then $D_{A, \mathbb{Z}'_n} = D_A$ and $C_{A, \mathbb{Z}'_n} = C_A$ .
- For the length-specific constant, $E_{A, \mathbb{Z}'_n} = E_A$ for all $n \geq 2$ .
- Extremal sequences are characterized based on whether $A$ consists of units or contains zero-divisors. For instance, if $A \subseteq U(n)$ , a $C$ -extremal sequence for $(A, \mathbb{Z}'_n)$ takes the form $(0, x_1, 0, x_2, \dots, 0, x_k, 0)$ where $(x_1, \dots, x_k)$ is a $C$ -extremal sequence for $A$ .
The Pair $(\mathbb{Z}'_n, B)$ :
- For $B \subseteq \mathbb{Z}'_n$ , the bounds are $2 \leq C_{\mathbb{Z}'_n, B} \leq 4$ and $2 \leq D_{\mathbb{Z}'_n, B} \leq 3$ .
- If $B \subseteq U(n)$ , the values are exactly $C_{\mathbb{Z}'_n, B} = 4$ and $D_{\mathbb{Z}'_n, B} = 3$ .
- The value of $E_{\mathbb{Z}'_n, B}$ is $n+1$ when $n \neq 3$ or when $B = \mathbb{Z}'_n$ .

Significance and Claims
The paper claims to extend the study of weighted zero-sum problems by introducing a "doubly-weighted" framework where two independent sets of weights must satisfy simultaneous linear conditions. The authors demonstrate that for specific choices of $A$ and $B$ , the constants $C_{A,B}$ , $D_{A,B}$ , and $E_{A,B}$ can be explicitly calculated and are often closely related to the standard weighted constants $C_A$ , $D_A$ , and $E_A$ .

The significance lies in the precise characterization of extremal sequences for these new constants, which provides a deeper structural understanding of zero-sum problems in $\mathbb{Z}_n$ . The paper notes that while the upper bounds derived from general module theory are sharp for the $(1,1)$ case, the behavior changes significantly when the weight sets involve units versus zero-divisors. The authors conclude by noting that the values for other subsets $B \subseteq \mathbb{Z}'_n$ remain an open area for computation, suggesting that the methods developed here can be applied to further subsets.