English
Related papers

Related papers: Asymptotic dimension for covers with controlled gr…

200 papers

Since persistence diagrams do not admit an inner product structure, a map into a Hilbert space is needed in order to use kernel methods. It is natural to ask if such maps necessarily distort the metric on persistence diagrams. We show that…

Machine Learning · Computer Science 2020-07-31 Peter Bubenik , Alexander Wagner

In this paper we find asymptotic enumerations for the number of line graphs on $n$-labelled vertices and for different types of related combinatorial objects called 2-covers. We find that the number of 2-covers, $s_n$, and proper 2-covers,…

Combinatorics · Mathematics 2007-07-05 Peter Cameron , Thomas Prellberg , Dudley Stark

Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of genus $g$. We show that the sequence $(C_{n,g}:g\ge 0)$ is asymptotically normal with mean and variance asymptotic to $(1/2)(n-\ln n)$ and…

Combinatorics · Mathematics 2023-07-11 Zhicheng Gao

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

Geometric Topology · Mathematics 2019-05-06 Senja Barthel

Even though big mapping class groups are not countably generated, certain big mapping class groups can be generated by a coarsely bounded set and have a well defined quasi-isometry type. We show that the big mapping class group of a stable…

Geometric Topology · Mathematics 2021-10-08 Curtis Grant , Kasra Rafi , Yvon Verberne

Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…

Probability · Mathematics 2007-12-05 Marie Albenque , Jean-François Marckert

In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a…

Combinatorics · Mathematics 2025-09-08 Tung Nguyen , Alex Scott , Paul Seymour

P. M. Akhmetiev used a controlled version of the stable Hopf invariant to show that any (continuous) map N -> M between stably parallelizable compact n-manifolds, n\ne 1,2,3,7, is realizable in R^{2n}, i.e. the composition of f with an…

Geometric Topology · Mathematics 2007-05-23 Sergey A. Melikhov

In this paper we study the rigidity of proper holomorphic maps $f\colon \Omega\to\Omega'$ between irreducible bounded symmetric domains $\Omega$ and $\Omega'$ with small rank differences: $2\leq \text{rank}(\Omega')<…

Complex Variables · Mathematics 2025-01-14 Sung-Yeon Kim , Ngaiming Mok , Aeryeong Seo

We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on…

Combinatorics · Mathematics 2008-05-06 Andrei Gagarin , Gilbert Labelle , Pierre Leroux

We develop a probabilistic framework for large-scale dimension bounds in metric geometry, based on padded decompositions, randomized ball carving on net graphs, and the Lov\'asz Local Lemma. For metric measure spaces with volume doubling…

Metric Geometry · Mathematics 2026-05-18 Jing Yu , Xingyu Zhu

We introduce, for every surface {\Sigma}, a two-way connection between FO transductions (first-order logical transformations) of the graphs embeddable in {\Sigma} and a certain variant of fan-crossing drawings of graphs in {\Sigma}. If the…

Computational Geometry · Computer Science 2026-03-13 Petr Hliněný , Jan Jedelský

For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we…

Probability · Mathematics 2020-07-20 Cyril Marzouk

We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for…

Computational Complexity · Computer Science 2021-07-20 Andreas Galanis , Daniel Stefankovic , Eric Vigoda

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

Combinatorics · Mathematics 2024-06-17 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , David R. Wood

Let $H$ be a fixed graph. What can be said about graphs $G$ that have no subgraph isomorphic to a subdivision of $H$? Grohe and Marx proved that such graphs $G$ satisfy a certain structure theorem that is not satisfied by graphs that…

Combinatorics · Mathematics 2022-05-10 Chun-Hung Liu , Robin Thomas

We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…

Geometric Topology · Mathematics 2022-04-12 S. Avvakumov , I. Mabillard , A. Skopenkov , U. Wagner

We consider {\em monotone} embeddings of a finite metric space into low dimensional normed space. That is, embeddings that respect the order among the distances in the original space. Our main interest is in embeddings into Euclidean…

Combinatorics · Mathematics 2007-05-23 Yonatan Bilu , Nati Linial

In this paper we prove a general and sharp Asymptotic Theorem for minimal surfaces in $H^2\times R$. As a consequence, we prove that there is no properly immersed minimal surface whose asymptotic boundary $C$ is a Jordan curve homologous to…

Differential Geometry · Mathematics 2007-12-19 Ricardo Sa Earp , Eric Toubiana

In this paper, we study conditions for the existence of an embedding $\widetilde{f} \colon P \to Q \times \mathbb{R}$ such that $f = \mathrm{pr}_Q \circ \widetilde{f}$, where $f \colon P \to Q$ is a piecewise linear map between polyhedra.…

Geometric Topology · Mathematics 2025-08-14 Alexey Gorelov