Related papers: A Colorful Steinitz Lemma with Applications to Blo…

We study the reconstruction problem of permutation sequences from their $k$-minors, which are subsequences of length $k$ with entries renumbered by $1,2,\ldots,k$ preserving order. We prove that the minimum number $k$ such that any…

Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques…

For positive integers $n,r,s$ with $r > s$, the set-coloring Ramsey number $R(n;r,s)$ is the minimum $N$ such that if every edge of the complete graph $K_N$ receives a set of $s$ colors from a palette of $r$ colors, then there is a subset…

We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…

We study the kernel complexity of constraint satisfaction problems over a finite domain, parameterized by the number of variables, whose constraint language consists of two relations: the non-equality relation and an additional…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…

A celebrated theorem of Spencer states that for every set system $S_1,\dots, S_m \subseteq [n]$, there is a coloring of the ground set with $\{\pm 1\}$ with discrepancy $O(\sqrt{n\log(m/n+2)})$. We provide an algorithm to find such a…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

We consider the online vector bin packing problem where $n$ items specified by $d$-dimensional vectors must be packed in the fewest number of identical $d$-dimensional bins. Azar et al. (STOC'13) showed that for any online algorithm $A$,…

In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of partitioning the set of nodes into a fixed number of subsets with…

The main theorem of this paper establishes a uniform syndeticity result concerning the multiple recurrence of measure-preserving actions on probability spaces. More precisely, for any integers $d,l\geq 1$ and any $\varepsilon > 0$, we prove…

For $q,n,d \in \mathbb{N}$, let $A_q^L(n,d)$ denote the maximum cardinality of a code $C \subseteq \mathbb{Z}_q^n$ with minimum Lee distance at least $d$, where $\mathbb{Z}_q$ denotes the cyclic group of order $q$. We consider a…

The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite…

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

A box is the cartesian product of real intervals, which are either bounded or equal to $\mathbb{R}$. A box is said to be $d$-local if at most $d$ of the intervals are bounded. In this paper, we investigate the recently introduced local…

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

Let $Z \subseteq \proj{n}$ be a fat points scheme, and let $d(Z)$ be the minimum distance of the linear code constructed from $Z$. We show that $d(Z)$ imposes constraints (i.e., upper bounds) on some specific shifts in the graded minimal…

The Ramsey number $r(t;\ell)$ is the smallest $n$ such that every $\ell$-coloring of the edges of $K_n$ gives a monochromatic $K_{t}$. In recent years, there have been several improvements on asymptotic lower bounds for these numbers when…

The inductive size bias coupling technique and Stein's method yield a Berry-Esseen theorem for the number of urns having occupancy $d \ge 2$ when $n$ balls are uniformly distributed over $m$ urns. In particular, there exists a constant $C$…

Term Coding asks: given a finite system of term identities $\Gamma$ in $v$ variables, how large can its solution set be on an $n$--element alphabet, when we are free to choose the interpretations of the function symbols? This turns familiar…