arXiv Analytics

Sign in

arXiv:1612.06523 [math.CO]AbstractReferencesReviewsResources

Zero-sum subsequences in bounded-sum $\{-1, 1\}$-sequences

Yair Caro, Adriana Hansberg, Amanda Montejano

Published 2016-12-20Version 1

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 + \frac{k-t-2}{2} \,({\rm mod} \, (t+2))$. Then for any integer $n$ such that \[n \ge \max\left\{k,\frac{1}{2(t+2)}k^2 + \frac{q-s}{t+2}k - \frac{t}{2} + s\right\}\] and any function $f:[n]\to \{-1,1\}$ with $|\sum_{i=1}^nf(i)| \le q$, there is a set $B \subseteq [n]$ of $k$ consecutive integers with $|\sum_{y\in B}f(y)| \le t$. Moreover, this bound is sharp for all the parameters involved and a characterization of the extremal sequences is given. This and other similar results involving different subsequences are presented, including decompositions of sequences into subsequences of bounded weight.

Related articles: Most relevant | Search more
arXiv:1907.06623 [math.CO] (Published 2019-07-15)
Zero-sum subsequences in bounded-sum $\{-r,s\}$-sequences
arXiv:1909.02864 [math.CO] (Published 2019-09-04)
Negami's like splitting formula for the Jones polynomial
arXiv:math/9810127 [math.CO] (Published 1998-10-20, updated 1999-05-18)
Another Combinatorial Determinant