arXiv subjects

Vojtěch Kaluža

Publications and source records attributed to Vojtěch Kaluža.

10 recordsLinked to original sources

arXiv2026

Planar Bilipschitz Extension from Separated Nets

We prove that every $L$-bilipschitz mapping $\mathbb{Z}^2\to\mathbb{R}^2$ can be extended to a $C(L)$-bilipschitz mapping $\mathbb{R}^2\to\mathbb{R}^2$ and provide a polynomial upper bound for $C(L)$. Moreover, we extend the result to every separated net in $\mathbb{R}^2$ instead of $\mathbb{Z}^2$, with the upper bound gaining a polynomial dependence on the separation and net constants associated to the given separated net. This answers an Oberwolfach question of Navas from 2015 and is also a positive solution of the two-dimensional form of a decades old open (in all dimensions at least two) problem due to Alestalo, Trotsenko and Väisälä.

math.MG↗

arXiv2026

Extending Bilipschitz Mappings between Separated Nets

We provide a new characterisation of the decades old open problem of extending bilipschitz mappings given on a Euclidean separated net. In particular, this allows for the complete positive solution of the open problem in dimension two. Along the way, we develop a set of tools for bilipschitz extensions of mappings between subsets of Euclidean spaces.

math.MG↗

arXiv2024

Three observations on the Colin de Verdière spectral graph parameter

In this small note, we collect several observations pertaining to the famous spectral graph parameter $μ$ introduced in 1990 by Y. Colin de Verdière. This parameter is defined as the maximum corank among certain matrices akin to weighted Laplacians; we call them CdV matrices. First, we answer negatively a question mentioned in passing in the influential 1996 survey on $μ$ by van der Holst, Lovász, and Schrijver concerning the Perron--Frobenious eigenvector of CdV matrices. Second, by definition, CdV matrices posses certain transversality property. In some cases, this property is known to be satisfied automatically. We add one such case to the list. Third, Y. Colin de Verdière conjectured an upper bound on $μ(G)$ for graphs embeddable into a fixed closed surface. Following a recent computer-verified counterexample to a continuous version of the conjecture by Fortier Bourque, Gruda-Mediavilla, Petri, and Pineault [arXiv:2312.03504], we also check using computer that the analogous example shows the failure of the conjectured upper bound on $μ(G)$ for graphs embeddable into 10-torus as well as to several other larger surfaces.

math.CO↗

arXiv2023

Divergence of separated nets with respect to displacement equivalence

We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions $ϕ\colon (0,\infty)\to(0,\infty)$. Two separated nets are called $ϕ$-displacement equivalent if, roughly speaking, there is a bijection between them which, for large radii $R$, displaces points of norm at most $R$ by something of order at most $ϕ(R)$. We show that the spectrum of $ϕ$-displacement equivalence spans from the established notion of bounded displacement equivalence, which corresponds to bounded $ϕ$, to the indiscrete equivalence relation, coresponding to $ϕ(R)\in Ω(R)$, in which all separated nets are equivalent. In between the two ends of this spectrum, the notions of $ϕ$-displacement equivalence are shown to be pairwise distinct with respect to the asymptotic classes of $ϕ(R)$ for $R\to\infty$. We further undertake a comparison of our notion of $ϕ$-displacement equivalence with previously studied relations on separated nets. Particular attention is given to the interaction of the notions of $ϕ$-displacement equivalence with that of bilipschitz equivalence.

math.MG↗

arXiv2021

Highly irregular separated nets

In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate that such notions also give rise to distinct equivalence classes. Put differently, we find occurrences of particularly strong divergence of separated nets from the integer lattice. Our approach generalises that of Burago and Kleiner and McMullen which takes place largely in a continuous setting. Existence of irregular separated nets is verified via the existence of non-realisable density functions $ρ\colon [0,1]^{d}\to(0,\infty)$. In the present work we obtain stronger types of non-realisable densities.

math.MG↗

arXiv2020

Even maps, the Colin de~Verdière number and representations of graphs

Van der Holst and Pendavingh introduced a graph parameter $σ$, which coincides with the more famous Colin de Verdière graph parameter $μ$ for small values. However, the definition of $σ$ is much more geometric/topological directly reflecting embeddability properties of the graph. They proved $μ(G) \leq σ(G) + 2$ and conjectured $μ(G) \leq σ(G)$ for any graph $G$. We confirm this conjecture. As far as we know, this is the first topological upper bound on $μ(G)$ which is, in general, tight. Equality between $μ$ and $σ$ does not hold in general as van der Holst and Pendavingh showed that there is a graph $G$ with $μ(G) \leq 18$ and $σ(G)\geq 20$. We show that the gap appears on much smaller values, namely, we exhibit a graph $H$ for which $μ(H)\leq 7$ and $σ(H)\geq 8$. We also prove that, in general, the gap can be large: The incidence graphs $H_q$ of finite projective planes of order $q$ satisfy $μ(H_q) \in O(q^{3/2})$ and $σ(H_q) \geq q^2$.

math.CO↗

arXiv2018

Mapping $n$ grid points onto a square forces an arbitrarily large Lipschitz constant

We prove that the regular $n\times n$ square grid of points in the integer lattice $\mathbb{Z}^{2}$ cannot be recovered from an arbitrary $n^{2}$-element subset of $\mathbb{Z}^{2}$ via a mapping with prescribed Lipschitz constant (independent of $n$). This answers negatively a question of Feige from 2002. Our resolution of Feige's question takes place largely in a continuous setting and is based on some new results for Lipschitz mappings falling into two broad areas of interest, which we study independently. Firstly the present work contains a detailed investigation of Lipschitz regular mappings on Euclidean spaces, with emphasis on their bilipschitz decomposability in a sense comparable to that of the well known result of Jones. Secondly, we build on work of Burago and Kleiner and McMullen on non-realisable densities. We verify the existence, and further prevalence, of strongly non-realisable densities inside spaces of continuous functions.

math.MG↗

arXiv2017

Shortest path embeddings of graphs on surfaces

The classical theorem of Fáry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of Fáry's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a shortest path embedding. The main question addressed in this paper is whether given a closed surface S, there exists a Riemannian metric for which every topologically embeddable graph admits a shortest path embedding. This question is also motivated by various problems regarding crossing numbers on surfaces. We observe that the round metrics on the sphere and the projective plane have this property. We provide flat metrics on the torus and the Klein bottle which also have this property. Then we show that for the unit square flat metric on the Klein bottle there exists a graph without shortest path embeddings. We show, moreover, that for large g, there exist graphs G embeddable into the orientable surface of genus g, such that with large probability a random hyperbolic metric does not admit a shortest path embedding of G, where the probability measure is proportional to the Weil-Petersson volume on moduli space. Finally, we construct a hyperbolic metric on every orientable surface S of genus g, such that every graph embeddable into S can be embedded so that every edge is a concatenation of at most O(g) shortest paths.

cs.CG↗

arXiv2016

A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane

We reprove the strong Hanani-Tutte theorem on the projective plane. In contrast to the previous proof by Pelsmajer, Schaefer and Stasi, our method is constructive and does not rely on the characterization of forbidden minors, which gives hope to extend it to other surfaces. Moreover, our approach can be used to provide an efficient algorithm turning a Hanani-Tutte drawing on the projective plane into an embedding.

cs.CG↗

arXiv2016

Density not realizable as the Jacobian determinant of a bilipschitz map

Are every two separated nets in the plane bilipschitz equivalent? In the late 1990s, Burago and Kleiner and, independently, McMullen resolved this beautiful question negatively. Both solutions are based on a construction of a density function that is not realizable as the Jacobian determinant of a bilipschitz map. McMullen's construction is simpler than the Burago-Kleiner one, and we provide a full proof of its nonrealizability, which has not been available in the literature.

math.MG↗