English
Related papers

Related papers: Regular geometric cycles

200 papers

Let $M$ be a compact Riemannian manifold with boundary. We show that $M$ is Gromov-Hausdorff close to a convex Euclidean region $D$ of the same dimension if the boundary distance function of $M$ is $C^1$-close to that of $D$. More…

Differential Geometry · Mathematics 2014-11-11 Sergei Ivanov

Examples show that Riemannian manifolds with almost-Euclidean lower bounds on scalar curvature and Perelman entropy need not be close to Euclidean space in any metric space sense. Here we show that if one additionally assumes an…

Differential Geometry · Mathematics 2022-11-09 Robin Neumayer

The aim of this book is to show that the use of f-analytic families of finite type cycles (cycles having finitely many irreducible components, but not compact in general) in a given complex space may be useful in complex geometry, despite…

Algebraic Geometry · Mathematics 2023-05-23 Daniel Barlet , Jon Ingolfur Magnusson

A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by…

Combinatorics · Mathematics 2007-05-23 Jacques Verstraete

Let $\mathrm{Mod}(S_g)$ denote the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$. Given a finite subgroup $H$ of $\mathrm{Mod}(S_g)$, let $\mathrm{Fix}(H)$ denote the set of fixed points induced by the action…

Geometric Topology · Mathematics 2021-12-20 Atreyee Bhattacharya , Shiv Parsad , Kashyap Rajeevsarathy

In this paper a geometric approach toward stable homotopy groups of spheres, based on the Pontrjagin-Thom construction is proposed. From this approach a new proof of Hopf Invariant One Theorem by J.F.Adams for all dimensions except…

Geometric Topology · Mathematics 2008-01-10 Petr M. Akhmet'ev

We study the orthogonal projections of symplectic balls in $\mathbb{R}^{2n}$ on complex subspaces. In particular we show that these projections are themselves symplectic balls under a certain complexity assumption. Our main result is a…

Symplectic Geometry · Mathematics 2024-05-20 Nuno Costa Dias , Maurice A. de Gosson , Joao Nuno Prata

We prove a symplectic version of a conjecture of Lian and Pandharipande: in sufficiently high degree, the fixed-domain Gromov-Witten invariants of positive symplectic manifolds are signed counts of pseudo-holomorphic curves. The original…

Symplectic Geometry · Mathematics 2025-08-05 Alessio Cela , Aleksander Doan

A hyperbolic polygon is defined to be cyclic, horocyclic, or equidistant if its vertices lie on a metric circle, horocycle, or a component of the equidistant locus to a hyperbolic geodesic, respectively. Convex such $n$-gons are…

Geometric Topology · Mathematics 2015-07-01 Jason DeBlois

We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…

Dynamical Systems · Mathematics 2024-12-03 Samuel Everett

A graph $G$ on $n$ vertices is \textit{pancyclic} if it contains cycles of length $t$ for all $3 \leq t \leq n$. In this paper we prove that for any fixed $\epsilon>0$, the random graph $G(n,p)$ with $p(n)\gg n^{-1/2}$ asymptotically almost…

Combinatorics · Mathematics 2009-06-09 Michael Krivelevich , Choongbum Lee , Benny Sudakov

In this paper we give a proof of Enomoto's conjecture for graphs of sufficiently large order. Enomoto's conjecture states that, if $G$ is a graph of order $n$ with minimum degree $\delta(G)\geq \frac{n}{2}+1$, then for any pair of vertices…

Combinatorics · Mathematics 2021-01-14 Weihua He , Hao Li , Qiang Sun

A bicirculant is a regular graph that admits a semi-regular automorphism with two vertex-orbits of the same size. By $m$ we denote the size of vertex-orbits and by $d$ the valence of a bicirculant. Furthermore, we denote by $s$ the valence…

Combinatorics · Mathematics 2025-10-28 S. Bonvicini , T. Pisanski , A. Žitnik

We prove the existence of infinitely many periodic orbits of symplectomorphisms isotopic to the identity if they admit at least one hyperbolic periodic orbit and satisfy some condition on the flux. Our result is proved for a certain class…

Symplectic Geometry · Mathematics 2015-08-27 Marta Batoréo

Let G be a group admitting a non-elementary acylindrical action on a Gromov hyperbolic space (for example, a non-elementary relatively hyperbolic group, or the mapping class group of a closed hyperbolic surface, or Out(F_n) for n>1). We…

Group Theory · Mathematics 2015-06-12 R. Frigerio , M. B. Pozzetti , A. Sisto

Partial cubes are graphs that can be isometrically embedded into hypercubes. Convex cycles play an important role in the study of partial cubes. In this paper, we prove that a regular partial cube is a hypercube (resp., a Doubled Odd graph,…

Combinatorics · Mathematics 2024-10-15 Yan-Ting Xie , Yong-De Feng , Shou-Jun Xu

Let W be a compact manifold and let \rho be a representation of its fundamental group into PSL(2,C). The volume of \rho is defined by taking any \rho-equivariant map from the universal cover of W to H^3 and then by integrating the pull-back…

Geometric Topology · Mathematics 2007-05-23 Stefano Francaviglia

We survey some properties of Gromov--Hausdorff--Prokhorov convergent sequences $(\mathsf{X}_n, d_{\mathsf{X}_n}, \nu_{\mathsf{X}_n})_{n \ge 1}$ of random compact metric spaces equipped with Borel probability measures. We formalize that if…

Probability · Mathematics 2022-01-31 Benedikt Stufler

We prove topological regularity results for isoperimetric sets in PI spaces having a suitable deformation property, which prescribes a control on the increment of the perimeter of sets under perturbations with balls. More precisely, we…

Metric Geometry · Mathematics 2025-04-30 Gioacchino Antonelli , Enrico Pasqualetto , Marco Pozzetta , Ivan Yuri Violo

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…

Discrete Mathematics · Computer Science 2008-12-06 Jinshan Zhang