Table of Contents
Fetching ...

$\{\pm 1\}$-weighted zero-sum constants

Krishnendu Paul, Shameek Paul

Abstract

Let $A,B\subseteq \mathbb Z_n\setminus\{0\}$. A sequence $S=(x_1,\ldots, x_k)$ in $\mathbb Z_n$ is called an $(A,B)$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ and $b_1,\ldots,b_k\in B$ such that $a_1x_1+\cdots+a_kx_k=0$ and $b_1a_1+\cdots+b_ka_k=0$. The constant $E_{A,B}(n)$ is defined to be the smallest positive integer $k$ such that every sequence of length $k$ in $\mathbb Z_n$ has an $(A,B)$-weighted zero-sum subsequence of length $n$. We determine the constant $E_{A,B}(n)$ and the related constants $C_{A,B}(n)$ and $D_{A,B}(n)$ when $A=\{\pm 1\}$ and $B=\{1\}$.

$\{\pm 1\}$-weighted zero-sum constants

Abstract

Let . A sequence in is called an -weighted zero-sum sequence if there exist and such that and . The constant is defined to be the smallest positive integer such that every sequence of length in has an -weighted zero-sum subsequence of length . We determine the constant and the related constants and when and .
Paper Structure (6 sections, 8 theorems, 3 equations)

This paper contains 6 sections, 8 theorems, 3 equations.

Key Result

Proposition 2.2

If either $A\subseteq R^*$ or $B\subseteq R^*$, then $C_{A,B}(M)\geq 2C_A(M)$.

Theorems & Definitions (17)

  • Proposition 2.2
  • proof
  • Proposition 2.3
  • proof
  • Theorem 3.2
  • proof
  • Lemma 3.3
  • proof
  • Theorem 3.4
  • proof
  • ...and 7 more