相关论文: A Colorful Steinitz Lemma with Applications to Blo…

Let the integers $1,\ldots,n$ be assigned colors. Szemer\'edi's theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing…

The Gilbert-Pollak Conjecture \citep{gilbert1968steiner}, also known as the Steiner Ratio Conjecture, states that for any finite point set in the Euclidean plane, the Steiner minimum tree has length at least $\sqrt{3}/2 \approx 0.866$ times…

Given a network property or a data structure, a local certification is a labeling that allows to efficiently check that the property is satisfied, or that the structure is correct. The quality of a certification is measured by the size of…

The purpose of this paper is to study a one-dimensional polymer penalized by its range and placed in a random environment $\omega$. The law of the simple symmetric random walk up to time $n$ is modified by the exponential of the sum of…

The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the…

The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…

We prove a known 2-coloring of the integers $[N] := \{1,2,3,\ldots,N\}$ minimizes the number of monochromatic arithmetic 3-progressions under certain restrictions. A monochromatic arithmetic progression is a set of equally-spaced integers…

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with constant coefficients. This generalizes a result of…

The search of the optimal constant for a generalized Wirtinger inequality in an interval consists in minimizing the $p$-norm of the derivative among all functions whose $q$-norm is equal to~1 and whose $(r-1)$-power has zero average.…

The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…

We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…

We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on $n$ vertices with min O(Delta^{1/3} log^{1/2} Delta log n),…

A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ of the permutations.…

We prove that the statement "for every infinite cardinal nu, every graph with list chromatic nu has coloring number at most beth_omega (nu)" proved by Kojman [6] using the RGCH theorem [11] implies the RGCG theorem via a short forcing…

The chromatic number of the random graph $\mathcal{G}(n,p)$ has long been studied and has inspired several landmark results. In the case where $p = d/n$, Achlioptas and Naor showed the chromatic number is asymptotically concentrated at…

Consider an operator that takes the Fourier transform of a discrete measure supported in $\mathcal{X}\subset[-\frac 12,\frac 12)^d$ and restricts it to a compact $\Omega\subset\mathbb{R}^d$. We provide lower bounds for its smallest singular…

Let $G = C_{n_1} \oplus \cdots \oplus C_{n_r}$ with $1 < n_1 | \cdots | n_r$ be a finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence $S$ over $G$ of length $|S|\ge t$ has a…

We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let $\mathsf{HT}^{\leq n}_k$ denote the assertion…

Lemma 1 from the paper [N.E. Gretsky, J.M. Ostroy, W.R. Zame, Subdifferentiability and the duality gap, Positivity 6: 261--274, 2002] asserts that the value function $v$ of an infinite dimensional linear programming problem in standard form…