English
Related papers

Related papers: Square-weighted zero-sum constants

200 papers

We show that a finite zero-sum-free sequence $\alpha$ over an abelian group has at least $c|\alpha|^{4/3}$ distinct subsequence sums, unless $\alpha$ is "controlled" by a small number of its terms; here $|\alpha|$ denotes the number of…

Number Theory · Mathematics 2022-12-21 Vsevolod F. Lev

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_1, \ldots, a_k)$ of its elements such that the partial sums $(s_0, s_1, \ldots, s_k)$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i a_i$ for $1 \leq i \leq k$,…

Combinatorics · Mathematics 2022-05-25 Simone Costa , Stefano Della Fiore

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Computational Geometry · Computer Science 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

For any integer $r \geq 1$, the sequence of numbers $\{{c^{(r)}_{k}}\}_{k \geq 0} $ is defined implicitly by [\sum_k\binom{n}{k}^r\binom{n+k}{k}^r = \sum_k\binom{n}{k}\binom{n+k}{k}c^{(r)}_k,\quad n=0,1,2,...] Asmus Schmidt conjectured that…

Combinatorics · Mathematics 2013-08-07 Thotsaporn "Aek" Thanatipanonda

The main purpose of this paper is to obtain strong laws of large numbers for arrays or weighted sums of random variables under a scenario of dependence. Namely, for triangular arrays $\{X_{n,k}, \, 1 \leqslant k \leqslant n, \, n \geqslant…

Probability · Mathematics 2019-04-03 João Lita da Silva

A sequence $\{f_n\}$ of strongly-measurable functions taking values in a Banach space $\X$ is scalarly null a\.e\. (resp. scalarly null in measure) if $x^*f_n \rightarrow0$ a\.e\. (resp. $x^*f_n \rightarrow 0$ in measure) for every $x^*\in…

Functional Analysis · Mathematics 2016-09-06 Stephen J. Dilworth , Maria Girardi

For k>=3 let A \subset [1,N] be a set not containing a solution to a_1 x_1+...+a_k x_k=a_1 x_{k+1}+...+a_k x_{2k} in distinct integers. We prove that there is an epsilon>0 depending on the coefficients of the equation such that every such A…

Number Theory · Mathematics 2015-06-26 Boris Bukh

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

Statistics Theory · Mathematics 2008-10-06 Zuoxiang Peng , Jiaona Li , Saralees Nadarajah

We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…

Optimization and Control · Mathematics 2026-05-28 Amir Ali Ahmadi , Sanjeeb Dash , Yixuan Hua , Bartolomeo Stellato

An absent factor of a string $w$ is a string $u$ which does not occur as a contiguous substring (a.k.a. factor) inside $w$. We extend this well-studied notion and define absent subsequences: a string $u$ is an absent subsequence of a string…

Formal Languages and Automata Theory · Computer Science 2026-04-08 Maria Kosche , Tore Koß , Florin Manea , Stefan Siemer

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

Number Theory · Mathematics 2026-03-31 Ethan S. Lee , Rowan O'Clarey

Let $G$ be a graph. A zero-sum flow of $G$ is an assignment of non-zero real numbers to the edges of $G$ such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be a natural number. A zero-sum $k$-flow is a…

Combinatorics · Mathematics 2016-01-29 Fan Yang , Xiangwen Li

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

Combinatorics · Mathematics 2013-06-25 Tanya Khovanova , Sergei Konyagin

An $(n,k)$ sequence covering array is a set of permutations of $[n]$ such that each sequence of $k$ distinct elements of $[n]$ is a subsequence of at least one of the permutations. An $(n,k)$ sequence covering array is perfect if there is a…

Combinatorics · Mathematics 2020-02-21 Raphael Yuster

A real sequence $(b_k)_{k=0}^\infty$ is called totally positive if all minors of the infinite matrix $ \left\| b_{j-i} \right\|_{i, j =0}^\infty$ are nonnegative (here $b_k=0$ for $k<0$). In this paper, we investigate the problem of…

Complex Variables · Mathematics 2024-02-08 Olga Katkova , Anna Vishnyakova

Let $G$ be a finite abelian group with exponent $n$. Let $\eta(G)$ denote the smallest integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a zero-sum subsequence of length at most $n$. We determine the precise…

Number Theory · Mathematics 2016-08-19 Sammy Luo

Let $h\geq 2$ be a positive integer. For any subset $\mathcal{A}\subset \mathbb{Z}_n$, let $h^{\wedge}\mathcal{A}$ be the set of the elements of $\mathbb{Z}_n$ which are sums of $h$ distinct elements of $\mathcal{A}$. In this paper, we…

Number Theory · Mathematics 2018-10-19 Min Tang , Meng-Ting Wei

Let K be an algebraic number field and O_K be its ring of integers. Let S_K be the set of elements in O_K which are sums of squares in O_K and s(O_K) the minimal number of squares necessary to represent -1in O_K. Let g( S_K ) be the…

Number Theory · Mathematics 2020-05-29 Srijonee Shabnam Chaudhury

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

Probability · Mathematics 2017-04-03 Amir Dembo , Bjorn Poonen , Qi-Man Shao , Ofer Zeitouni

The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the weight of the minimum spanning tree tends to a constant,…

Combinatorics · Mathematics 2024-05-31 Nikita Zvonkov