English
Related papers

Related papers: Constructions of k-regular maps using finite local…

200 papers

Many mathematicians encounter k-to-1 maps only in the study of covering maps. But, of course, k-to-1 maps do not have to be open. This paper touches on covering maps, and simple maps, but concentrates on ordinary k-to-1 functions (both…

General Topology · Mathematics 2007-05-23 Jo Heath

We show that for a strongly convergent sequence of geometrically finite Kleinian groups with geometrically finite limit, the Cannon-Thurston maps of limit sets converge uniformly. If however the algebraic and geometric limits differ, as in…

Metric Geometry · Mathematics 2013-11-20 Mahan Mj , Caroline Series

Given a graph $G=(V,E)$ and a set $S_0\subseteq V$, an irreversible $k$-threshold conversion process on $G$ is an iterative process wherein, for each $t=1,2,\dots$, $S_t$ is obtained from $S_{t-1}$ by adjoining all vertices that have at…

Discrete Mathematics · Computer Science 2018-12-11 C. M. Mynhardt , J. L. Wodlinger

We construct K3 surfaces over number fields that have good reduction everywhere. These do not exists over the rational numbers, by results of Abrashkin and Fontaine. Our surfaces exist for three quadratic number fields, and an infinite…

Algebraic Geometry · Mathematics 2025-06-18 Stefan Schröer

In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…

Geometric Topology · Mathematics 2019-10-30 Meru Alagalingam

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…

Combinatorics · Mathematics 2024-09-18 Weilun Xu , Guorong Gao , An Chang

Let $G=(V,E)$ be a simple graph with maximum degree $d$. For an integer $k\in\mathbb{N}$, the $k$-disc of a vertex $v\in V$ is defined as the rooted subgraph of $G$ that is induced by all vertices whose distance to $v$ is at most $k$. The…

Combinatorics · Mathematics 2020-12-09 Yossi Rozantsev

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Combinatorics · Mathematics 2015-01-30 Jan Kynčl , János Pach , Radoš Radoičić , Géza Tóth

We establish isomorphism ranges for the comparison maps between algebraic and topological K-groups, extending classical Quillen-Lichtenbaum conjecture to separated complex schemes of finite type after refinement. Additionally, we…

Algebraic Geometry · Mathematics 2026-05-01 Chunhui Wei

Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling…

Data Structures and Algorithms · Computer Science 2018-05-16 Merav Parter , Eylon Yogev

We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…

Combinatorics · Mathematics 2020-06-30 Nati Linial , Michael Simkin

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

Combinatorics · Mathematics 2021-01-05 Ken-ichi Kawarabayashi , Robin Thomas , Paul Wollan

The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor the $(k \times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST)…

Combinatorics · Mathematics 2026-05-27 Dimitrios M. Thilikos , Sebastian Wiederrecht

We consider a closed convex set $C$ in a separable, infinite-dimensional Hilbert space and endow the set $\mathcal{N}(C)$ of nonexpansive self-mappings on $C$ with the topology of pointwise convergence. We introduce the notion of a somewhat…

Functional Analysis · Mathematics 2025-08-18 Davide Ravasini , Daylen K. Thimm

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

Combinatorics · Mathematics 2018-11-08 Yu-pei Huang , Chia-an Liu , Chih-wen Weng

In this paper I show that pointwise bounded asymptotic morphisms between separable metrisable locally convex *-algebras induce continuous maps between the quasi-unitary groups of the algebras, provided that the algebras support a certain…

Operator Algebras · Mathematics 2007-05-23 Edwin J. Beggs

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

Combinatorics · Mathematics 2024-03-12 Andres Mejia , Steven Simon , Jialin Zhang

In this article we study fine regularity properties for mappings of finite distortion. Our main theorems yield strongly localized regularity results in the borderline case in the class of maps of exponentially integrable distortion.…

Complex Variables · Mathematics 2021-09-28 Olli Hirviniemi , István Prause , Eero Saksman

A $k$-orbit map is a map with its automorphism group partitioning the set of flags into $k$ orbits. Recently $k$-orbit maps were studied by Orbani\' c, Pellicer and Weiss, for $k \leq 4$. In this paper we use symmetry type graphs to extend…

Combinatorics · Mathematics 2013-02-01 Isabel Hubard , Alen Orbanić , Tomaž Pisanski , María del Río Francos