Related papers: A Concise Proof of the $L_0$ Dichotomy

In 1977 the celebrated theorem of B. Dahlberg established that the harmonic measure is absolutely continuous with respect to the Hausdorff measure on a Lipschitz graph of dimension $n-1$ in $\mathbb R^n$, and later this result has been…

We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring…

We generalize and strengthen the theorem of Gromov that every compact Riemannian manifold of diameter at most D has a set of generators g_1,...,g_k of length at most 2D and relators of the form g_ig_m = g_j . In particular, we obtain an…

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

We provide a new proof of a theorem of Hell and Ne\v{s}et\v{r}il [J. Comb. Theory B, 48(1):92-110, 1990] using tools from topological combinatorics based on ideas of Lov\'asz [J. Comb. Theory, Ser. A, 25(3):319-324, 1978]. The…

The neighborhood complex $\N(G)$ of a graph $G$ were introduced by L. Lov{\'a}sz in his proof of Kneser conjecture. He proved that for any graph $G$, \begin{align} \label{abstract} \chi(G) \geq conn(\N(G))+3. \end{align} In this article we…

We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…

We establish a purely geometric form of the concentration theorem (also called localization theorem) for actions of a linearly reductive group $G$ on an affine scheme $X$ over an affine base scheme $S$. It asserts the existence of a…

Let $k$ be an algebraically closed field of characteristic $p>0$, $W$ the ring of Witt vectors over $k$ and ${R}$ the integral closure of $W$ in the algebraic closure ${\bar{K}}$ of $K:=Frac(W)$; let moreover $X$ be a smooth, connected and…

The main purpose of the paper is to construct a sequence of graphs of constant degree with indefinitely growing girths admitting embeddings into $\ell_1$ with uniformly bounded distortions. This result answers the problem posed by N.…

We study the well-known variational and large deviation principle for graph homomorphisms from $\mathbb{Z}^m$ to $\mathbb{Z}$. We provide a robust method to deduce those principles under minimal a priori assumptions. The only ingredient…

By discretizing an argument of Kislyakov, Naor and Schechtman proved that the 1-Wasserstein metric over the planar grid $\{0,1,\dots n\}^2$ has $L_1$-distortion bounded below by a constant multiple of $\sqrt{\log n}$. We provide a new…

We consider a generalization of the concept of $d$-flattenability of graphs - introduced for the $l_2$ norm by Belk and Connelly - to general $l_p$ norms, with integer $P$, $1 \le p < \infty$, though many of our results work for $l_\infty$…

We look at the question of which distance-regular graphs are core-complete, meaning they are isomorphic to their own core or have a complete core. We build on Roberson's homomorphism matrix approach by which method he proved the…

A classical result by Lov\'asz asserts that two graphs $G$ and $H$ are isomorphic if and only if they have the same left profile, that is, for every graph $F$, the number of homomorphisms from $F$ to $G$ coincides with the number of…

Fix $n=1,2,3,\dots$ or $n=\omega$. We prove a dichotomy for Borel homomorphisms from the $n$-th Friedman-Stanley jump $=^{+n}$ to an equivalence relation $E$ which is classifiable by countable structures: if there is no reduction from…

Let $\Omega\subset\mathbb{R}^n$ be a strictly convex domain with smooth boundary and diameter $D$. The fundamental gap conjecture claims that if $V:\bar\Omega\to\mathbb{R}$ is convex, then the spectral gap of the Schr\"odinger operator…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

The problem of chromatic thresholds seeks for minimum degree conditions that ensure $H$-free graphs to have a bounded chromatic number, or equivalently a bounded size homomorphic image. The strengthened homomorphism thresholds problem…