Related papers: Zarankiewicz bounds from distal regularity lemma
Let $A$ be an unbounded operator on a Banach space $X$. It is sometimes useful to improve the operator $A$ by extending it to an operator $B$ on a larger Banach space $Y$ with smaller spectrum. It would be preferable to do this with some…
In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…
An $\epsilon$-net theorem for a hypergraph upper bounds the minimum size of a vertex set that pierces all $\epsilon$-heavy hyperedges. A $(p,2)$-theorem bounds from above the minimum size of a vertex set that pierces all hyperedges, in…
In this note, we report five mathematical discoveries made in collaboration with Grok, all of which have been subsequently verified by the authors. These include an improved lower bound on the maximal Gaussian perimeter of convex sets in…
Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…
We generalize the family of $(\sigma, \rho)$-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-$r$ dominating set and distance-$r$ independent…
We extend Hoffman's coclique bound for regular digraphs with the property that its adjacency matrix is normal, and discuss cocliques attaining the inequality. As a consequence, we characterize skew-Bush-type Hadamard matrices in terms of…
This survey hinges on the interplay between regularity and approximation for linear and quasi-linear fractional elliptic problems on Lipschitz domains. For the linear Dirichlet integral Laplacian, after briefly recalling H\"older regularity…
We give a new geometric proof of a theorem of Heuer showing that, in the presence of letter-quasimorphisms (which are analogues of real-valued quasimorphisms with image in free groups), and in particular in RAAGs, there is a sharp lower…
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a…
We sharpen the bounds of J. Bourgain, A. Gamburd and P. Sarnak (2016) on the possible number of nodes outside the "giant component" and on the size of individual connected components in the suitably defined functional graph of Markoff…
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erd\H{o}s, R\'{e}nyi, and S\'{o}s (1966). The proof relies on a closed-form expression for the Lov\'{a}sz $\vartheta$-function of…
We prove that $q+1$-regular Morgenstern Ramanujan graphs $X^{q,g}$ (depending on $g\in\mathbb{F}_q[t]$) have diameter at most $\left(\frac{4}{3}+\varepsilon\right)\log_{q}|X^{q,g}|+O_{\varepsilon}(1)$ (at least for odd $q$ and irreducible…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
It has long been conjectured that for nonlinear wave equations which satisfy a nonlinear form of the null condition, the low regularity well-posedness theory can be significantly improved compared to the sharp results of Smith-Tataru for…
Wiener's criterion for the regularity of a boundary point with respect to the Dirichlet problem for the Laplace equation has been extended to various classes of elliptic and parabolic partial differential equations. They include linear…
In this paper,based on the available mathematical works on geometry and topology of hyperbolic manifolds and discrete groups, some results of Freedman et al (hep-th/9804058) are reproduced and broadly generalized. Among many new results the…
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…
We study the bilinear estimates in the Sobolev spaces with the Dirichlet and the Neumann boundary condition. The optimal regularity is revealed to get such estimates in the half space case, which is related to not only smoothness of…