English
Related papers

Related papers: Zero sums in restricted sequences

200 papers

Let $G$ be an abelian group, and let $\mathcal F (G)$ be the free commutative monoid with basis $G$. For $\Omega \subset \mathcal F (G)$, define the universal zero-sum invariant ${\mathsf d}_{\Omega}(G)$ to be the smallest integer $\ell$…

Combinatorics · Mathematics 2024-10-11 Guoqing Wang

Let $Z$ and $X$ be Banach spaces. Suppose that $X$ is Asplund. Let $\mathcal{M}$ be a bounded set of operators from $Z$ to $X$ with the following property: a bounded sequence $(z_n)_{n\in \mathbb{N}}$ in $Z$ is weakly null if, for each $M…

Functional Analysis · Mathematics 2024-05-10 José Rodríguez

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$),…

Combinatorics · Mathematics 2017-02-06 Weidong Gao , Yuanlin Li , Jiangtao Peng , Guoqing Wang

For a finite abelian group $G,$ the Davenport Constant, denoted by $D(G)$, is defined to be the least positive integer $k$ such that every sequence of length at least $k$ has a non-trivial zero-sum subsequence. A long-standing conjecture is…

Number Theory · Mathematics 2024-02-16 Anamitro Biswas , Eshita Mazumdar

Generalized Davenport-Schinzel sequences are sequences that avoid a forbidden subsequence and have a sparsity requirement on their letters. Upper bounds on the lengths of generalized Davenport-Schinzel sequences have been applied to a…

Discrete Mathematics · Computer Science 2019-12-12 Jesse Geneson

Let $G$ be a multiplicative finite group and $S=a_1\cdot\ldots\cdot a_k$ a sequence over $G$. We call $S$ a product-one sequence if $1=\prod_{i=1}^ka_{\tau(i)}$ holds for some permutation $\tau$ of $\{1,\ldots,k\}$. The small Davenport…

Combinatorics · Mathematics 2018-11-27 Dongchun Han , Hanbin Zhang

The Erd\H{o}s-Burgess constant of a semigroup $S$ is the smallest positive integer $k$ such that any sequence over $S$ of length $k$ contains a nonempty subsequence whose elements multiply to an idempotent element of $S$. In the case where…

Combinatorics · Mathematics 2018-08-21 Noah Kravitz , Ashwin Sah

The classical Cauchy-Davenport theorem implies the lower bound n+1 for the number of distinct subsums that can be formed from a sequence of n elements of the cyclic group Z_p (when p is prime and n<p). We generalize this theorem to a…

Number Theory · Mathematics 2012-09-03 Greg Martin , Alexis Peilloux , Erick B. Wong

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

Number Theory · Mathematics 2017-09-28 David J. Grynkiewicz

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…

Number Theory · Mathematics 2021-02-01 Abílio Lemos , Allan de Oliveira Moura

Given an additively written abelian group $G$ and a set $X\subseteq G$, we let $\mathsf{D}(X)$ denote the Davenport constant of $X$, namely the largest non-negative integer $n$ for which there exists a sequence $x_1, \dots, x_n$ of elements…

Number Theory · Mathematics 2025-10-24 Benjamin Girard , Alain Plagne

Let $\mathsf{A}=\{a_1,\dots,a_m\}$, $m\in\mathbb{N}$, be measurable functions on a measurable space $(\mathcal{X},\mathfrak{A})$. If $\mu$ is a positive measure on $(\mathcal{X},\mathfrak{A})$ such that $\int a_i d\mu<\infty$ for all $i$,…

Functional Analysis · Mathematics 2018-09-05 Philipp J. di Dio , Konrad Schmüdgen

In this paper, our primary objective is to study a possible decomposition of an approximately convex sequence. For a given $\varepsilon>0$; a sequence $\big<u_n\big>_{n=0}^{\infty}$ is said to be $\varepsilon$-convex, if for any…

General Mathematics · Mathematics 2024-06-25 Angshuman Robin Goswami

Let A be a zero-sum free subset of Z_n with |A|=k. We compute for k\le 7 the least possible size of the set of all subset-sums of A.

Number Theory · Mathematics 2008-12-18 Gautami Bhowmik , Immanuel Halupczok , Jan-Christoph Schlage-Puchta

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal…

Combinatorics · Mathematics 2022-04-18 Boris Brimkov , Joshua Carlson

Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with…

Number Theory · Mathematics 2022-11-17 John Ebert , David J. Grynkiewicz

Let $C_n$ be a cyclic group of order $n$. A sequence $S$ of length $\ell$ over $C_n$ is a sequence $S = a_1\boldsymbol\cdot a_2\boldsymbol\cdot \ldots\boldsymbol\cdot a_{\ell}$ of $\ell$ elements in $C_n$, where a repetition of elements is…

Combinatorics · Mathematics 2024-09-04 Sang June Lee , Jun Seok Oh

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

Number Theory · Mathematics 2022-11-24 Jagannath Bhanja , Ram Krishna Pandey

For a finite abelian group $G$ and a positive integer $k$, let $s_{k}(G)$ denote the smallest integer $\ell\in\mathbb{N}$ such that any sequence $S$ of elements of $G$ of length $|S|\geq\ell$ has a zero-sum subsequence with length $k$. The…

Combinatorics · Mathematics 2017-07-19 Xiaoyu He