English
Related papers

Related papers: On finite-to-one maps

200 papers

Let $G_1, \dots, G_k$ and $H$ be vector spaces over a finite field $\mathbb{F}_p$ of prime order. Let $A \subset G_1 \times\dots\times G_k$ be a set of size $\delta |G_1| \cdots |G_k|$. Let a map $\phi \colon A \to H$ be a…

Combinatorics · Mathematics 2021-09-08 W. T. Gowers , L. Milićević

We prove upper bounds for the Morse index and number of intersections of min-max geodesics achieving the $p$-widths of a closed surface. A key tool in our analysis is a proof that for a generic set of metrics, the tangent cone at any vertex…

Differential Geometry · Mathematics 2024-10-04 Jared Marx-Kuo , Lorenzo Sarnataro , Douglas Stryker

A metric space $M$ us said to have the fibered approximation property in dimension $n$ (br., $M\in \mathrm{FAP}(n)$) if for any $\epsilon>0$, $m\geq 0$ and any map $g: I^m\times I^n\to M$ there exists a map $g':I^m\times I^n\to M$ such that…

Geometric Topology · Mathematics 2011-08-23 Taras Banakh , Vesko Valov

We investigate inverse thickness $1/\Delta$ and the integral Menger curvature energies $\mathcal{U}_{p}^{\alpha}$, $\mathcal{I}_{p}^{\alpha}$ and $\mathcal{M}_{p}^{\alpha}$, to find that finite $1/\Delta$ or $\mathcal{U}_{p}^{\alpha}$…

Classical Analysis and ODEs · Mathematics 2012-04-04 Sebastian Scholtes

Fix probability densities $f$ and $g$ on open sets $X \subset \mathbf{R}^m$ and $Y \subset \mathbf{R}^n$ with $m\ge n\ge1$. Consider transporting $f$ onto $g$ so as to minimize the cost $-s(x,y)$. We give a non-degeneracy condition (a) on…

Analysis of PDEs · Mathematics 2021-02-25 Pierre-André Chiappori , Robert J McCann , Brendan Pass

We prove that for every compactum X and every integer $n \geq 2$ there are a compactum Z of $\dim \leq n$ and a surjective $UV^{n-1}$-map $r: Z \lo X$ having the property that: for every finitely generated abelian group G and every integer…

General Topology · Mathematics 2007-05-23 Michael Levin

We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…

Combinatorics · Mathematics 2010-11-22 Andrew Treglown

Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…

Dynamical Systems · Mathematics 2009-04-29 David Färm

The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum…

Combinatorics · Mathematics 2025-09-23 Junying Lu , Yaojun Chen

We prove that for all $k \ge 3$ and any integers $\Delta, n$ with $n \ge 2^\Delta,$ there exists a $k$-graph on $n$ vertices with maximum degree at most $\Delta$ such that $r(H)\geq\tw_{k-1}(c_k \Delta) \cdot n$ for some constant $c_k > 0$,…

Combinatorics · Mathematics 2026-03-27 Chunchao Fan , Qizhong Lin

Adapting a homotopy reconstruction theorem for general metric compacta, we show that every countable metric or ultrametric compact space can be topologically reconstructed as the inverse limit of a sequence of finite $T_0$ spaces which are…

General Topology · Mathematics 2024-12-20 Diego Mondéjar

We show that every forward complete Finsler manifold of infinite fundamental group and not homotopy-equivalent to $S^1$ has infinitely many geometrically distinct geodesics joining any given pair of points $p$ and $q$. In the special case…

Differential Geometry · Mathematics 2022-01-21 Simon Allais

A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such…

Combinatorics · Mathematics 2016-02-02 David Conlon , Asaf Ferber , Rajko Nenadov , Nemanja Škorić

We prove that for every number k each countable infinite group $G$ admits a partition $G=A\cup B$ into two sets which are $k$-meager in the sense that for every $k$-element subset $K\subset G$ the sets $KA$ and $KB$ are not thick. The proof…

Group Theory · Mathematics 2014-12-04 Taras Banakh , Igor Protasov , Sergiy Slobodianiuk

Zariski dense collections of quadratic points on curves $X$ are well-understood by results of Harris--Silverman and Vojta, but when $\dim X \geq 2$ there is not an analogous geometric characterization, even conjecturally. In this note we…

Number Theory · Mathematics 2025-11-04 Nathan Chen , Ben Church , Hector Pasten , Isabel Vogt

Let $k$ be an algebraically closed field of characteristic $p > 0$. We show that if $X\subseteq\mathbb{P}^n_k$ is an equidimensional subscheme with Hilbert--Kunz multiplicity less than $\lambda$ at all points $x\in X$, then for a general…

Algebraic Geometry · Mathematics 2020-03-24 Rankeya Datta , Austyn Simpson

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

Combinatorics · Mathematics 2025-09-03 Michal Dvořák , Dušan Knop , Michal Opler , Jan Pokorný , Ondřej Suchý , Krisztina Szilágyi

The (3x+1)-Map, T, acts on the set, Pi, of positive integers not divisible by 2 or 3. It is defined by T(x) = (3x+1)/2^k, where k is the largest integer for which T(x) is an integer. The (3x+1)-Conjecture asks if for every x in Pi there…

Number Theory · Mathematics 2007-05-23 Alex V. Kontorovich , Yakov G. Sinai

Given a compact set K in the plane, which contains no triple of points forming a vertical and a horizontal segment, and a continuous real-valued map f on K, we give a construction of real-valued continuous maps of one variable g,h such that…

General Topology · Mathematics 2007-05-23 Eva Trenklerova

We prove that the edge-end space of an infinite graph is metrizable if and only if it is first-countable. This strengthens a recent result by Aurichi, Magalhaes Jr.\ and Real (2024). Our central graph-theoretic tool is the use of tree-cut…

Combinatorics · Mathematics 2025-07-23 Max Pitz
‹ Prev 1 8 9 10 Next ›