English
Related papers

Related papers: Avoiding zero-sum subsequences of prescribed lengt…

200 papers

A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…

Combinatorics · Mathematics 2014-07-29 Papa A. Sissokho

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

Let $G$ be an additive finite abelian group. A sequence over $G$ is called a minimal zero-sum sequence if the sum of its terms is zero and no proper subsequence has this property. Davenport's constant of $G$ is the maximum of the lengths of…

Number Theory · Mathematics 2010-01-14 Wolfgang A. Schmid

Let G be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer $m$, denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with…

Combinatorics · Mathematics 2011-12-02 Sukumar Das Adhikari , David J. Grynkiewicz , Zhi-Wei Sun

Let $\mathcal{S}$ be a finite commutative semigroup written additively, and let $\exp(\mathcal{S})$ be its exponent which is defined as the least common multiple of all periods of the elements in $\mathcal{S}$. For every sequence $T$ of…

Combinatorics · Mathematics 2013-10-22 Sukumar Das Adhikari , Weidong Gao , Guoqing Wang

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $D(G)$ such that every sequence of $G$ with $D(G)$ elements has a non-empty subsequence with product $1$. Let $D_{2n}$ be…

Number Theory · Mathematics 2017-02-01 Fabio Enrique Brochero Martínez , Sávio Ribas

Let $G$ be an additive finite abelian group with exponent $\exp(G)$. For $L\subseteq \mathbb N$, let $\mathsf{s}_{L}(G)$ be the smallest integer $\ell$ such that every sequence $S$ over $G$ of length $\ell$ has a zero-sum subsequence $T$ of…

Combinatorics · Mathematics 2023-10-10 Shiwen Zhang

Let $p$ be any odd prime number. Let $k$ be any positive integer such that $2\leq k\leq [\frac{p+1}3]+1$. Let $S = (a_1,a_2,...,a_{2p-k})$ be any sequence in ${\Bbb Z}_p$ such that there is no subsequence of length $p$ of $S$ whose sum is…

Combinatorics · Mathematics 2007-05-23 W D Gao , A Panigrahi , R Thangadurai

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$,…

Number Theory · Mathematics 2020-12-23 Jun-Yu Zhou , Quan-Hui Yang

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

Number Theory · Mathematics 2023-01-31 Luke Pebody

The $k$-deck problem is concerned with finding the smallest positive integer $S(k)$ such that there exist at least two strings of length $S(k)$ that share the same $k$-deck, i.e., the multiset of subsequences of length $k$. We introduce the…

Combinatorics · Mathematics 2025-10-28 Jonas Golm , Mina Nahvi , Ryan Gabrys , Olgica Milenkovic

For $(G,+)$ a finite abelian group the plus-minus weighted Davenport constant, denoted $\mathsf{D}_{\pm}(G)$, is the smallest $\ell$ such that each sequence $g_1 ... g_{\ell}$ over $G$ has a weighted zero-subsum with weights +1 and -1,…

Number Theory · Mathematics 2013-08-16 Luz Elimar Marchan , Oscar Ordaz , Wolfgang Schmid

Let $G$ be a finite abelian group and let $\varnothing \neq A \subset \mathbb Z$. The $A$-weighted Davenport constant of $G$ is the smallest positive integer ${\sf D}_A(G)$ such that every sequence $x_1 \boldsymbol{\cdot} {\dots}…

Number Theory · Mathematics 2021-07-19 Fabio Enrique Brochero Martínez , Sávio Ribas

A sequence $\bfx=(x_1,\ldots,x_m)$ of elements of $\Z_n$ is called an \textit{$A$-weighted Davenport Z-sequence} if there exists $\bfa:=(a_1,\ldots,a_m)\in (A\cup\{0\})^m\setminus\bfzero_m$ such that $\sum_i a_ix_i=0$. Here…

Number Theory · Mathematics 2021-03-03 Niranjan Balachandran , Eshita Mazumdar

Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $\theta \in (0,1)$ such that, for each $\ell>0$, there is a…

Classical Analysis and ODEs · Mathematics 2018-05-29 Paolo Leonetti

For a finite abelian group $G$ and a splitting field $K$ of $G$, let $d(G, K)$ denote the largest integer $l \in \N$ for which there is a sequence $S = g_1 \cdot ... \cdot g_l$ over $G$ such that $(X^{g_1} - a_1) \cdot ... \cdot (X^{g_l} -…

Combinatorics · Mathematics 2010-12-30 Daniel Smertnig

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

Classical Analysis and ODEs · Mathematics 2024-07-01 Trevor D. Wooley

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-01-31 Caixia Shen , Li-meng Xia

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

Number Theory · Mathematics 2020-04-16 S. S. Rout , N. K. Meher

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be…

Number Theory · Mathematics 2012-11-13 A. Geroldinger , D. J. Grynkiewicz