Related papers: Square-weighted zero-sum constants

Let $\mathcal S$ be a multiset of integers. We say $\mathcal S$ is a $\textit{zero-sum sequence}$ if the sum of its elements is 0. We study zero-sum sequences whose elements lie in the interval $[-k,k]$ such that no subsequence of length…

Let $G$ be an additive abelian group. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1, \ldots, \varepsilon_{\ell} \in \{-1, 1\}$ such that…

A finite set $A$ of integers is square-sum-free if there is no subset of $A$ sums up to a square. In 1986, Erd\H os posed the problem of determining the largest cardinality of a square-sum-free subset of $\{1, ..., n \}$. Answering this…

The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $\Omega \subset B(G$),…

A weakly consecutive sequence (WCS) is a permutation $\sigma$ of $\{1, \ldots, k\}$ such that if an integer $d$ divides $\sigma(i)$, then $d$ also divides $\sigma(i \pm d)$ insofar as these are defined. The structure of weakly consecutive…

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

Given a matrix $M = (a_{i,j})$ a square is a $2 \times 2$ submatrix with entries $a_{i,j}$, $a_{i, j+s}$, $a_{i+s, j}$, $a_{i+s, j +s}$ for some $s \geq 1$, and a zero-sum square is a square where the entries sum to $0$. Recently,…

Let $G$ be a finite abelian group of exponent $n$ and let $A$ be a non-empty subset of $[1,n-1]$. The Davenport constant of $G$ with weight $A$, denoted by $D_A(G)$, is defined to be the least positive integer $\ell$ such that any sequence…

Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…

The following result gives the flavor of this paper: Let $t$, $k$ and $q$ be integers such that $q\geq 0$, $0\leq t < k$ and $t \equiv k \,({\rm mod}\, 2)$, and let $s\in [0,t+1]$ be the unique integer satisfying $s \equiv q +…

For a fixed integer $k$, we define a sequence $A_k=(a_k(n))_{n\geq0}$ and a corresponding sparse subsequence $S_k$ using the cardinality of the $n$-th symmetric power of the set $\{1,2,\ldots, k\}$. For $k\in\{2,\dots,8\}$, we find…

We consider two families of weighted zero-sum constants for finite abelian groups. For a finite abelian group $( G , + )$, a set of weights $W \subset \mathbb{Z}$, and an integral parameter $m$, the $m$-wise Davenport constant with weights…

Let $G$ be an additive abelian group. A sequence $S=g_1\cdot\ldots\cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1,\ldots,\varepsilon_{\ell}\in\{-1,1\}$ such that $\varepsilon_1…

Suppose $G$ is a finite abelian group and $S=g_{1}\cdots g_{l}$ is a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\mathbb{Z}\backslash\left\{ 0\right\} $, let $N_{A,g}(S)$ denote the number of subsequences…

For a sequence $S$ over a finite abelian group, let $MZ(S)$ denote the length of the shortest nonempty zero-sum subsequence of $S$. We prove that if $G$ is finite abelian of order $n$ and $S$ has length $n$, then $MZ(S)\le n-|\supp(S)|+1$.…

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

We announce conditions under which a given sequence of points on the complex plane is a subsequence of zeros of an entire function with weight restrictions on growth.

In this article, we study a sum of squares of integers except for a fixed one. For any nonnegative integer $n$, we find the minimum number of squares of integers except for $n$ whose sums represent all positive integers that are represented…

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.