Related papers: A note on lower bounds for arithmetic regularity p…

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

This paper provides new observations on the Lov\'{a}sz $\theta$-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for…

Inspired by the paper [1] of V. Bergelson, John H.Johnson Jr., J. Moreira, we formulate an abstract version of image partition regularity. To establish the result we have used a variant of first entry condition and for infinite case we…

Let $R$ be a standard graded algebra over a field $k$. We prove an Auslander-Buchsbaum formula for the absolute Castelnuovo-Mumford regularity, extending important cases of previous works of Chardin and R\"omer. For a bounded complex of…

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

In 1952, J.H.Braun claimed to have established a formula giving a lower bound for certain partitions of sets of integers into weakly sum-free classes. However, no proof or supporting construction was published at that time. In today's…

In this article we continue our investigation of the thin obstacle problem with variable coefficients which was initiated in \cite{KRS14}, \cite{KRSI}. Using a partial Hodograph-Legendre transform and the implicit function theorem, we prove…

Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

We study a class of focusing nonlinear Schroedinger-type equations derived recently by Dumas, Lannes and Szeftel within the mathematical description of high intensity laser beams [7]. These equations incorporate the possibility of a…

We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…

Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

The logarithmic minimal models are not rational but, in the W-extended picture, they resemble rational conformal field theories. We argue that the W-projective representations are fundamental building blocks in both the boundary and bulk…

In this paper, the study of extreme value bounds for topological indices is crucial for understanding their influence on trees and bipartite graphs. For integers $\alpha, p$ satisfying $1 \leq p \leq \alpha \leq \Delta - 3$, the minimum…

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

Since the seminal results by Avellaneda \& Lin it is known that elliptic operators with periodic coefficients enjoy the same regularity theory as the Laplacian on large scales. In a recent inspiring work, Armstrong \& Smart proved…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…