相关论文: A note on lower bounds for arithmetic regularity p…
In this paper we are concerned with higher regularity properties of the elliptic system \[ \Delta\mathbf{u}= |\mathbf{u}|^{q-1}\mathbf{u}\chi_{\{|\mathbf{u}|>0\}},\qquad\mathbf{u}=(u^1,\dots,u^m) \] for $0\leq q<1$. We show analyticity of…
Regularity theorems \`a la Avellaneda-Lin are an indispensable part of the modern quantitative theory of stochastic homogenization. While interior regularity results for random elliptic operators have been available for a while, on general…
Obtaining an efficient bound for the triangle removal lemma is one of the most outstanding open problems of extremal combinatorics. Perhaps the main bottleneck for achieving this goal is that triangle-free graphs can be highly unstructured.…
We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…
Let G be a semisimple Lie group with associated symmetric space D, and let Gamma subset G be a cocompact arithmetic group. Let L be a lattice inside a Z Gamma-module arising from a rational finite-dimensional complex representation of G.…
A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…
Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…
We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$-uniform semialgebraic hypergraphs satisfies a very strong regularity…
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that…
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of…
We show that there exists $c>0$ such that any subset of $\{1, \dots, N\}$ of density at least $(\log\log{N})^{-c}$ contains a nontrivial progression of the form $x,x+y,x+y^2$. This is the first quantitatively effective version of the…
We establish uniform bounds for the solutions $e^{it\Delta}u$ of the Schr\"{o}dinger equation on arithmetic flat tori, generalising earlier results by J. Bourgain. We also study the regularity properties of weak-* limits of sequences of…
We study regularity for solutions of quasilinear elliptic equations of the form $\div \A(x,u,\nabla u) = \div \F $ in bounded domains in $\R^n$. The vector field $\A$ is assumed to be continuous in $u$, and its growth in $\nabla u$ is like…
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov\'asz, Catlin, Kostochka and Rabern.
We develop a large-scale regularity theory of higher order for divergence-form elliptic equations with heterogeneous coefficient fields $a$ in the context of stochastic homogenization. The large-scale regularity of $a$-harmonic functions is…
Recently, Dvir, Golovnev, and Weinstein have shown that sufficiently strong lower bounds for linear data structures would imply new bounds for rigid matrices. However, their result utilizes an algorithm that requires an $NP$ oracle, and…
We deal with homogeneous Dirichlet and Neumann boundary-value problems for anisotropic elliptic operators of p-Laplace type. They emerge as Euler-Lagrange equations of integral functionals of the Calculus of Variations built upon possibly…
Twin-width is a structural width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS 2020], and has interesting applications in the areas of logic on graphs and in parameterized algorithmics. Very briefly, the essence of…
It is known that the size of the largest common subtree (i.e., the maximum agreement subtree) of two independent random binary trees with $n$ given labeled leaves is of order between $n^{0.366}$ and $n^{1/2}$. We improve the lower bound to…
We prove new lower bounds on the modularity of graphs. Specifically, the modularity of a graph $G$ with average degree $\bar d$ is $\Omega(\bar{d}^{-1/2})$, under some mild assumptions on the degree sequence of $G$. The lower bound…