Related papers: Lower Bounds for Subset Sum in Resolution with Mod…

In this note, we study the size of the support of integer solutions to linear equations $Ax=b, ~x\in\Z^n$ where $A\in\Z^{m\times n}, b\in\Z^n$. We give an upper bound on the smallest support size as a function of $A$, taken as a worst case…

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…

We establish Burgess-type bounds for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$ under a purely volumetric condition. We show that for a box $B \subset \mathbb{F}_{p^n}$, nontrivial cancellation occurs whenever…

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that the sumset $NA$ has predictable size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in some finite cone other than all…

We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function $f(r)$ such that, for any set $C$ of $r$-state characters, $C$ is compatible if and only…

We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…

Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and computational biology, insdel codes have recently become a focal…

In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that,…

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Let $\|x\|$ denote the distance from $x\in\mathbb{R}$ to the nearest integer. In this paper, we prove an existence and density statement for matrices $\boldsymbol{A}\in\mathbb{R}^{m\times n}$ satisfying…

Given an array A containing arbitrary (positive and negative) numbers, we consider the problem of supporting range maximum-sum segment queries on A: i.e., given an arbitrary range [i,j], return the subrange [i' ,j' ] \subseteq [i,j] such…

Rejection sampling is a common tool for low dimensional problems ($d \leq 2$), often touted as an "easy" way to obtain valid samples from a distribution $f(\cdot)$ of interest. In practice it is non-trivial to apply, often requiring…

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are…

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that $NA$ has a particular size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in a cone other than certain exceptional…

Given an integer array $A[1..n]$, the Range Minimum Query problem (RMQ) asks to preprocess $A$ into a data structure, supporting RMQ queries: given $a,b\in [1,n]$, return the index $i\in[a,b]$ that minimizes $A[i]$, i.e.,…

Many canonical machine learning problems boil down to a convex optimization problem with a finite sum structure. However, whereas much progress has been made in developing faster algorithms for this setting, the inherent limitations of…