SearcharxivSearch

arXiv subjects

Cosmas Kravaris

Publications and source records attributed to Cosmas Kravaris.

6 recordsLinked to original sources

Metric embeddings of cubes into dense subsets of cubes

Fix $k \in \mathbb{N}, 0 < \delta < 1$. We study how large $N$ must be so that every $\delta$-dense subset $\mathcal{D} \subset \{0,1\}^N$ (meaning $|\mathcal{D}|\geq \delta 2^N$) contains the image of a metric embedding $f: \{0,1\}^k \to \mathcal{D}$. We study $3$ variants: For a $(1+\varepsilon)$-bi-Lipschitz map $f$ for a fixed $\varepsilon>0$, we show that $N = O(\varepsilon^{-2}\log(1/\delta) k^3)$. For an isometric map $f$ with arbitrary rescaling (i.e. undistorted), we show that $N = \log(1/\delta) e^{\Omega(k)}$. For an isometric map $f$ with bounded rescaling we show that $N = \exp{[\log(1/\delta)e^{\Theta(k)}]}$. Regarding the path space, we prove the density analog of a coloring theorem of R\"odl--Sales. We give bounds for $(1+\varepsilon)$-bi-Lipschitz embeddings of the path $[k] = \{1,...,k\}$ into dense subsets of the path $[N] = \{1,...,N\}$, improving a bound of Dumitrescu. We prove similar bounds for the binary tree space, using the tree replicas theorem of Pach--Solymosi--Tardos. As a geometric application we obtain a non-positive Alexandrov curvature counterpart to the work of Bartal--Linial--Mendel--Naor on the nonlinear Dvoretzky problem who showed that any $\mathcal{D} \subset \{0,1\}^N$ that embeds with bi-Lipschitz distortion $<\alpha$ into a metric space of non-negative Alexandrov curvature must be small, namely, necessarily $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-2}))}$. We prove that for every $N\gtrsim \alpha^{6}\ge 1$, any $\mathcal{D} \subset \{0,1\}^N$ that embeds with distortion $<\alpha$ into some metric space of non-positive Alexandrov curvature must satisfy $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-4}))}$ via an approach which is entirely different from that of Bartal--Linial--Mendel--Naor. We also show that nontrivial metric type and non-universality are preserved by taking finite unions of subspaces.

math.CO

$L_1$ and $L_2$ embeddings of the symmetric group

We show that the Cayley graph of the symmetric group $Sym_n$ generated by the cycle $(123...n)$ and the transposition $(12)$ embeds into $L_1$ with bi-Lipschitz distortion $O(1)$. This answers a question of Ostrovskii, and along with Kassabov's theorem gives the first example of a sequence of groups which embed bi-Lipschitzly into $L_1$ for one choice of bounded size generating sets, but not for another choice of bounded size generating sets. In particular, the Cayley graphs generated by the cycle and the transposition cannot contain coarsely any unbounded sequence of expander graphs. Moreover, within the context of the Ribe program, they are a new example of bounded degree Cayley graphs which are test spaces for Rademacher type.

math.MG

The Poisson boundary of Thompson's group $T$ is not the circle

Let $μ$ be a nondegenerate probability measure with finite entropy on a countable group $G \leq \mathrm{Homeo}_+(S^1)$ of orientation-preserving homeomorphisms of the circle acting proximally, minimally and topologically nonfreely on $S^1$. We prove that the circle $S^1$ endowed with its unique $μ$-stationary probability measure is not the Poisson boundary of $(G,μ)$. When $G$ is Thompson's group $T$ and $μ$ is finitely supported, this answers a question posed by B. Deroin [Ergodic Theory Dynam. Systems, 2013] and A. Navas [Proceedings of the International Congress of Mathematicians, 2018].

math.DS

Lower bounds for the universal TSP on the plane

We show a lower bound for the universal traveling salesman heuristic on the plane: for any linear order on the unit square $[0,1]^2$, there are finite subsets $S \subset [0,1]^2$ of arbitrarily large size such that the path visiting each element of $S$ according to the linear order has length $\geq C \sqrt{\log |S| / \log \log |S|}$ times the length of the shortest path visiting each element in $S$. ($C>0$ is a constant that depends only on the linear order.) This improves the previous lower bound $\geq C \sqrt[6]{\log |S| / \log \log |S|}$ of Hajiaghayi, Kleinberg and Leighton (SODA 2006). The proof establishes a dichotomy about any long walk on a cycle: the walk either zig-zags between two far away points, or else for a large amount of time it stays inside a set of small diameter.

math.MG

On the density of eigenvalues on periodic graphs

Suppose that $Γ=(V,E)$ is a graph with vertices $V$, edges $E$, a free group action on the vertices $\mathbb{Z}^d \curvearrowright V$ with finitely many orbits, and a linear operator $D$ on the Hilbert space $l^2(V)$ such that $D$ commutes with the group action. Fix $λ\in \mathbb{R}$ in the pure-point spectrum of $D$ and consider the vector space of all eigenfunctions of finite support $K$. Then $K$ is a non-trivial finitely generated module over the ring of Laurent polynomials, and the density of $λ$ is given by an Euler-characteristic type formula by taking a finite free resolution of $K$. Furthermore, these claims generalize under suitable assumptions to the non-commutative setting of a finite generated amenable group acting on the vertices freely with finitely many orbits, and commuting with the operator $D$.

math.SP

On the growth of the wallpaper groups

We develop further Cannon's method of cone types for finding the growth function of a group, which can also be used to find the coordination sequences of certain infinite graphs. We then apply this method to compute the growth functions and series of the wallpaper groups (the 2 dimensional crystallographic groups). The paper has a number of illustrating colored figures and tables summarizing the results.

math.GR