English
Related papers

Related papers: On Expansion and Topological Overlap

200 papers

It is known, that for every elliptic curve over Q there exists a quadratic extension in which the rank does not go up. For a large class of elliptic curves, the same is known with the rank replaced by the 2-Selmer group. We show, however,…

Number Theory · Mathematics 2015-08-27 Alex Bartel

We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…

Combinatorics · Mathematics 2021-02-26 Baptiste Louf

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

Combinatorics · Mathematics 2025-08-27 Mikhail Isaev , Brendan D. McKay

This is an extensive (published) survey on CR geometry, whose major themes are: formal analytic reflection principle; generic properties of Systems of (CR) vector fields; pairs of foliations and conjugate reflection identities; Sussmann's…

Complex Variables · Mathematics 2007-05-23 Joël Merker , Egmont Porten

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

Combinatorics · Mathematics 2012-05-22 Liviu Ilinca , Jeff Kahn

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Computational Geometry · Computer Science 2023-02-17 Joseph O'Rourke

Orbifold and logarithmic structures provide independent routes to the virtual enumeration of curves with tangency orders for a simple normal crossings pair $(X|D)$. The theories do not coincide and their relationship has remained…

Algebraic Geometry · Mathematics 2023-06-30 Luca Battistella , Navid Nabijou , Dhruv Ranganathan

We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…

Combinatorics · Mathematics 2025-10-02 Jan Kynčl , Jan Soukup

A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect…

Combinatorics · Mathematics 2023-04-26 Shujing Miao , Shuchao Li , Wei Wei

Let $S$ and $X$ be two connected topological surfaces without boundary, and assume that $S$ is either of infinite type or has negative Euler characteristic. In this paper, we prove that if $p:S\rightarrow X$ is a fully ramified branched…

Geometric Topology · Mathematics 2026-01-16 Nestor Colin , Ruben Hidalgo , Rita Jiménez Rolland , Israel Morales , Saúl Quispe

We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…

Combinatorics · Mathematics 2015-12-29 Alexander Lubotzky , Zur Luria , Ron Rosenthal

If $X$ is a geodesic metric space and $x_1,x_2,x_3\in X$, a geodesic triangle $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-hyperbolic (in the Gromov sense)…

Metric Geometry · Mathematics 2020-01-23 Walter Carballosa , José M. Rodríguez , Omar Rosario , José M. Sigarreta

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

Data Structures and Algorithms · Computer Science 2021-03-17 Farzam Ebrahimnejad , Ansh Nagda , Shayan Oveis Gharan

The $r$-expansion of a $k$-uniform hypergraph $H$, denoted by $H^{(+r)}$, is an $r$-uniform hypergraph obtained by enlarging each $k$-edge of $H$ with a set of $r-k$ vertices of degree one. The random Tur\'an number…

Combinatorics · Mathematics 2024-05-21 Jiaxi Nie

The following selection theorem is established:\\ Let $X$ be a compactum possessing a binary normal subbase $\mathcal S$ for its closed subsets. Then every set-valued $\mathcal S$-continuous map $\Phi\colon Z\to X$ with closed $\mathcal…

General Topology · Mathematics 2013-11-05 Vesko Valov

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

The comparison map from bounded cohomology to singular cohomology plays an important role in the study of bounded cohomology theory and its applications. The vanishing and covering theorems of Gromov and Ivanov show interesting and useful…

Algebraic Topology · Mathematics 2022-10-25 George Raptis

Let $\mathcal{X}$ be a Riemann surface of genus $g>0$ defined over a number field $K$ which is a degree $d$-covering of $\mathbb{P}^1_K$. In this paper we show the existence of infinitely many linearly disjoint degree $d$-extensions $L/K$…

Number Theory · Mathematics 2016-12-12 Bo-Hae Im , Erik Wallace

Given a graph $H$, we denote by ${\cal M}(H)$ all graphs that can be contracted to $H$. The following extension of the Erd\H{o}s-P\'osa Theorem holds: for every $h$-vertex planar graph $H$, there exists a function $f_{H}$ such that every…

Discrete Mathematics · Computer Science 2013-06-11 Jean-Florent Raymond , Dimitrios M. Thilikos

Consider an infinite planar graph with uniform polynomial growth of degree d > 2. Many examples of such graphs exhibit similar geometric and spectral properties, and it has been conjectured that this is necessary. We present a family of…

Probability · Mathematics 2021-03-11 Farzam Ebrahimnejad , James R. Lee