Related papers: A General Lower Bound for the Limited Augmented Za…

We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…

A $Z_2\times Z_2$-graded Lie superalgebra $g$ is a $Z_2\times Z_2$-graded algebra with a bracket $[.,.]$ that satisfies certain graded versions of the symmetry and Jacobi identity. In particular, despite the common terminology, $g$ is not a…

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. We prove that $r_4(5,n)\ge 2^{2^{cn^{1/7}}}$, where $c>0$ is an absolute…

The Kruithof iterative scaling process, which adjusts matrices to meet target row and column sums, is a longstanding problem that lacks a general closed form for its limit. While Nathanson derived the closed form for the Sinkhorn limit of…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

In this paper, based on the local comparison principle in [12], we study the local behavior of the difference of two spacelike graphs in a neighborhood of a second contact point. Then we apply it to the constant mean curvature equation in…

For a smooth $k$-dimensional submanifold $\Sigma$ of a $d$-dimensional compact Riemannian manifold $M$, we extend the $L^p(\Sigma)$ restriction bounds of Burq-G\'erard-Tzvetkov -- originally proved for individual Laplace--Beltrami…

Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant $s_r(G)$ is the smallest integer $s$ such that every sequence of length $s$ over $G$ has a zero-sum subsequence of…

We show that a simple scoring-based tie-breaking can help improve lower bounds for the expansion (aka isoperimetric number) of random regular graphs with small even degrees. Specifically, for degrees 4, 6 and 8, we show that, with high…

In this paper, we shed new light on the spectrum of the relation algebra we call $A_{n}$, which is obtained by splitting the non-flexible diversity atom of $6_{7}$ into $n$ symmetric atoms. Precisely, we show that the minimum value in…

In 1993 E. I. Zelmanov asked the following question in Dniester Notebook: "Suppose that F_{2, m} is a 2-generated associative ring with the identity x^m=0. Is it true, that the nilpotency degree of F_{2, m} has exponential growth?" We show…

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

In this paper, the two settings we are concerned with are $\Gamma < \operatorname{SO}(n, 1)$ a Zariski dense Schottky semigroup and $\Gamma < \operatorname{SL}_2(\mathbb C)$ a Zariski dense continued fractions semigroup. In both settings,…

We provide polynomial upper bounds for the minimal sizes of distal cell decompositions in several kinds of distal structures, particularly weakly $o$-minimal and $P$-minimal structures. The bound in general weakly $o$-minimal structures…

For a simple graph $G$, let $n$ denote its number of vertices, and let $N(G,K_t)$ denote the number of copies of $K_t$ in $G$. Zykov's theorem (1949) asserts that for any $K_{r+1}$-free graph and $t \ge 2$, \[ N(G,K_t) \le {r \choose…

Let A and B be two affinely generating sets of (Z_2)^n. As usual, we denote their Minkowski sum by A+B. How small can A+B be, given the cardinalities of A and B? We give a tight answer to this question. Our bound is attained when both A and…

Let $I(n,l)$ denote the maximum possible number of incidences between $n$ points and $l$ lines. It is well known that $I(n,l) = \Theta(n^{2/3}l^{2/3} + n + l)$. Let $c_{\mathrm{SzTr}}$ denote the lower bound on the constant of…

Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…

Given a graph $G$ of degree $k$ over $n$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth $2L$, we develop a local message passing algorithm whose…