English
Related papers

Related papers: Comparing Teichm\"uller and curve graph translatio…

200 papers

This paper develops a family of Hofer-like metrics ($\dAnV{V}$) on the space of Anosov vector fields $\An(M)$, providing dynamically relevant distances based on the cost of deformation paths using $\Ck{k}$ or Sobolev $\SobolevHk{k}$ norms.…

Dynamical Systems · Mathematics 2025-04-22 Stéphane Tchuiaga

The most useful and interesting line bundles over algebraic curves of a very high genus have the ratio \delta of the degree to the genus close to half-integer values, usually \delta \approx 0, \delta \approx 1/2, or \delta \approx 1; the…

Algebraic Geometry · Mathematics 2007-05-23 Ilya Zakharevich

A stable or locally-optimal cut of a graph is a cut whose weight cannot be increased by changing the side of a single vertex. In this paper we study Minimum Stable Cut, the problem of finding a stable cut of minimum weight. Since this…

Computational Complexity · Computer Science 2026-04-08 Michael Lampis

We consider the class of semi-transitively orientable graphs, which is a much larger class of graphs compared to transitively orientable graphs, in other words, comparability graphs. Ever since the concept of a semi-transitive orientation…

Combinatorics · Mathematics 2019-07-04 Ilkyoo Choi , Jinha Kim , Minki Kim

We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…

Data Structures and Algorithms · Computer Science 2021-08-17 Greg Bodwin , Virginia Vassilevska Williams

In recent work by Dani and Mainkar, a family of finite simple graphs was used to construct nilmanifolds admitting Anosov diffeomorphisms. Our main object of study is this particular set of graphs, which we call Anosov graphs. Moreover, Dani…

Combinatorics · Mathematics 2020-08-26 Meera Mainkar , Matthew Plante , Ben Salisbury

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

Probability · Mathematics 2022-10-06 Paul-Marie Samson

We develop a geometrical micro-local analysis of contact Anosov flow, such as geodesic flow on negatively curved manifold. This micro-local analysis is based on wave-packet transform discussed in arXiv:1706.09307. The main result is that…

Dynamical Systems · Mathematics 2025-03-11 Frédéric Faure , Masato Tsujii

We provide a simple criterion for an element of the mapping class group of a closed surface to have normal closure equal to the whole mapping class group. We apply this to show that every nontrivial periodic mapping class that is not a…

Geometric Topology · Mathematics 2020-06-03 Justin Lanier , Dan Margalit

In this paper we study the boundary at infinity of the curve complex $\mathcal{C}(S)$ of a surface $S$ of finite type and the relative Teichm\"{u}ller space $\mathcal{T}_{el}(S)$ obtained from the Teichm\"{u}ller space by collapsing each…

Geometric Topology · Mathematics 2018-03-29 Erica Klarreich

In this paper, we extend and refine previous Tur\'an-type results on graphs with a given circumference. Let $W_{n,k,c}$ be the graph obtained from a clique $K_{c-k+1}$ by adding $n-(c-k+1)$ isolated vertices each joined to the same $k$…

Combinatorics · Mathematics 2020-03-24 Jie Ma , Bo Ning

In this paper we prove a general theorem concerning the number of translation classes of curves of genus $g$ belonging to a fixed cohomology class in a polarized abelian variety of dimension $g$. For $g = 2$ we recover results of G\"ottsche…

Algebraic Geometry · Mathematics 2007-05-23 Herbert Lange , Edoardo Sernesi

A network topology with low average shortest path length (ASPL) provides efficient data transmission while the number of nodes and the number of links incident to each node are often limited due to physical constraints. In this paper, we…

Discrete Mathematics · Computer Science 2016-06-17 Nobutaka Shimizu , Ryuhei Mori

A virtual link may be defined as an equivalence class of diagrams, or alternatively as a stable equivalence class of links in thickened surfaces. We prove that a minimal crossing virtual link diagram has minimal genus across representatives…

Geometric Topology · Mathematics 2023-01-12 Hans U. Boden , William Rushworth

The stability number of a graph, defined as the cardinality of the largest set of pairwise non-adjacent vertices, is NP-hard to compute. The exact subgraph hierarchy (ESH) provides a sequence of increasingly tighter upper bounds on the…

Optimization and Control · Mathematics 2025-11-17 Elisabeth Gaar , Dunja Pucher

Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging.…

Machine Learning · Computer Science 2026-05-08 Katharina Limbeck , Nadja Häusermann , Martin Carrasco , Guy Wolf , Bastian Rieck

We prove a quantitative version of the non-uniform hyperbolicity of the Teichm\"uller geodesic flow. Namely, at each point of any Teichm\"uller flow line, we bound the infinitesimal spectral gap for variations of the Hodge norm along the…

Geometric Topology · Mathematics 2020-05-29 Ian Frankel

In this paper we develop a bridge between model theory, geometric topology, and geometric group theory. In particular, we investigate the Ivanov Metaconjecture from the point of view of model theory, and more broadly we seek to answer the…

Geometric Topology · Mathematics 2023-06-12 Valentina Disarlo , Thomas Koberda , J. de la Nuez González

The $\Delta$-edge stability number ${\rm es}_{\Delta}(G)$ of a graph $G$ is the minimum number of edges of $G$ whose removal results in a subgraph $H$ with $\Delta(H) = \Delta(G)-1$. Sets whose removal results in a subgraph with smaller…

A directed graph $G=(V,E)$ is {\it strongly pseudo transitive} if there is a partition $\{A,E-A\}$ of $E$ so that graphs $G_1=(V,A)$ and $G_2=(V,E-A)$ are transitive, and additionally, if $ab\in A$ and $bc\in E $ implies that $ac\in E$. A…

Combinatorics · Mathematics 2018-06-06 Farhad Shahrokhi
‹ Prev 1 4 5 6 7 8 10 Next ›