English
Related papers

Related papers: Algebraic degrees of stretch factors in mapping cl…

200 papers

We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…

Group Theory · Mathematics 2014-10-01 Honglin Min

For a finite, simple, and undirected graph $G$ with $n$ vertices and average degree $d$, Nikiforov introduced the degree deviation of $G$ as $s=\sum_{u\in V(G)}\left|d_G(u)-d\right|$. Provided that $G$ has largest eigenvalue $\lambda$,…

Combinatorics · Mathematics 2024-12-20 Dieter Rautenbach , Florian Werner

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

Combinatorics · Mathematics 2008-09-09 Paz Carmi , Vida Dujmović , Pat Morin , David R. Wood

The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…

Geometric Topology · Mathematics 2026-03-24 Biplab Basak , Raju Kumar Gupta , Ayushi Trivedi

The splitting field of a graph $\Gamma$ with respect to a square matrix $M$ associated with $\Gamma$, is the smallest field extension over the field of rationals $\mathbb{Q}$ that contains all the eigenvalues of $M$. The degree of the…

Combinatorics · Mathematics 2026-02-10 Sauvik Poddar

We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor $C_{del\approx 2.42$; however,…

Data Structures and Algorithms · Computer Science 2008-02-21 Iyad A. Kanj , Ljubomir Perkovic

One approach to study the pseudorandomness properties of walks on expander graphs is to label the vertices of an expander with elements from an alphabet $\Sigma$, and study the mean of functions over $\Sigma^n$. We say expander walks…

Computational Complexity · Computer Science 2025-07-22 Fernando Granha Jeronimo , Tushant Mittal , Sourya Roy

We consider classes of partially hyperbolic diffeomorphism $f:M\to M$ with splitting $TM=E^s\oplus E^c\oplus E^u$ and $\dim E^c=2$. These classes include for instance (perturbations of) the product of Anosov and conservative surface…

Dynamical Systems · Mathematics 2016-03-02 Vanderlei Horita , Martin Sambarino

Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…

Combinatorics · Mathematics 2022-05-04 Richard Montgomery , Alp Müyesser , Yanitsa Pehova

We prove that in genus bigger than $2$, the mapping class group action on $\mathrm{Aff}(\mathbb{C})$-characters is ergodic. This implies that almost every representation $\pi_1 S \longrightarrow \mathrm{Aff}(\mathbb{C})$ is the holonomy of…

Geometric Topology · Mathematics 2015-06-10 Selim Ghazouani

The construction of bounded-degree plane geometric spanners has been a focus of interest since 2002 when Bose, Gudmundsson, and Smid proposed the first algorithm to construct such spanners. To date, eleven algorithms have been designed with…

Computational Geometry · Computer Science 2022-05-09 Frederick Anderson , Anirban Ghosh , Matthew Graham , Lucas Mougeot , David Wisnosky

We settle a problem of Dujmovi\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using…

Combinatorics · Mathematics 2010-11-13 Balázs Keszegh , János Pach , Dömötör Pálvölgyi

The classification of all real and rational Anosov Lie algebras up to dimension 8 is given by Lauret and Will. In this paper we study 9-dimensional Anosov Lie algebras by using the properties of very special algebraic numbers and Lie…

Dynamical Systems · Mathematics 2015-01-08 Meera Mainkar , Cynthia E. Will

We classify linearly normal surfaces $S \subset \mathbf{P}^{r+1}$ of degree $d$ such that $4g-4 \leq d \leq 4g+4$, where $g>1$ is the sectional genus (it is a classical result that for larger $d$ there are only cones). We apply this to the…

Algebraic Geometry · Mathematics 2026-05-27 Ciro Ciliberto , Thomas Dedieu

Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of…

Rings and Algebras · Mathematics 2012-04-17 Eli Aljadeff , Antonio Giambruno

In this paper, we give sufficient conditions for a Perron number, given as the leading eigenvalue of an aperiodic matrix, to be a pseudo-Anosov dilatation of a compact surface. We give an explicit construction of the surface and the map…

Geometric Topology · Mathematics 2018-03-14 Hyungryul Baik , Ahmad Rafiqi , Chenxi Wu

Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of…

Combinatorics · Mathematics 2011-08-24 Daniel Johannsen , Michael Krivelevich , Wojciech Samotij

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…

Combinatorics · Mathematics 2007-06-29 Noga Alon , Michael Krivelevich , Benny Sudakov

A complete description of resonances for rational toral Anosov diffeomorphisms preserving certain Reinhardt domains is presented. As a consequence it is shown that every homotopy class of two-dimensional Anosov diffeomorphisms contains maps…

Dynamical Systems · Mathematics 2022-11-14 Julia Slipantschuk , Oscar F. Bandtlow , Wolfram Just

A graph class $\mathcal{C}$ has polynomial expansion if there is a polynomial function $f$ such that for every graph $G\in \mathcal{C}$, each of the depth-$r$ minors of $G$ has average degree at most $f(r)$. In this note, we study…

Combinatorics · Mathematics 2025-10-01 Nicolas Bousquet , Wouter Cames van Batenburg , Louis Esperet , Gwenaël Joret , Piotr Micek