English
Related papers

Related papers: Regular geometric cycles

200 papers

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…

Metric Geometry · Mathematics 2018-07-05 J. Jerónimo-Castro , E. Makai,

Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in…

Combinatorics · Mathematics 2020-04-07 R. Reyes , J. M. Rodriguez , J. M. Sigarreta , M. Villeta

The symmetry of polygons can be characterized by the number of symmetry axes they have. For $n$-polygons with $p$ or $p^2$ vertices $p\geq3$ there exist few symmetry categories, depending from the number of symmetry-axes the have. Further…

Combinatorics · Mathematics 2026-05-28 Rolf Haag

We construct two sequences of closed $4$-dimensional manifolds with non-negative Ricci curvature, diameter bounded from above by $1$, and volume bounded from below by $v>0$, with different fundamental groups but with the same…

Differential Geometry · Mathematics 2025-05-26 Camillo Brena

We prove that, for $C^1$-generic diffeomorphisms, if the periodic orbits contained in a homoclinic class $H(p)$ have all their Lyapunov exponents bounded away from 0, then $H(p)$ must be (uniformly) hyperbolic. This is in sprit of the works…

Dynamical Systems · Mathematics 2017-09-27 Xiaodong Wang

In part I of this work we studied the spaces of real algebraic cycles on a complex projective space P(V), where V carries a real structure, and completely determined their homotopy type. We also extended some functors in K-theory to…

Algebraic Topology · Mathematics 2014-11-11 H Blaine Lawson , Paulo Lima-Filho , Marie-Louise Michelsohn

In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…

Combinatorics · Mathematics 2022-10-21 Olga Bodroža-Pantić , Harris Kwong , Jelena Djokić , Rade Doroslovački , Milan Pantić

We describe a natural isomorphism between the set of equivalence classes of pseudocycles and the integral homology groups of a smooth manifold. Our arguments generalize to settings well-suited for applications in enumerative algebraic…

Algebraic Topology · Mathematics 2007-05-23 Aleksey Zinger

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

Group Theory · Mathematics 2024-03-19 Romain Tessera , Matthew Tointon

A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every…

Combinatorics · Mathematics 2016-10-03 Asaf Ferber , Eoin Long , Benny Sudakov

We present the Tetrahedral Compactness Theorem which states that sequences of Riemannian manifolds with a uniform upper bound on volume and diameter that satisfy a uniform tetrahedral property have a subsequence which converges in the…

Differential Geometry · Mathematics 2017-03-06 Christina Sormani

The article treats some questions around Gromov's filling area conjecture. It intended to show that any filling with volume $< 2 \pi$ would not be attained and to show a local systolic inequality, implying an a priori lower estimate on the…

Differential Geometry · Mathematics 2020-10-06 Olaf Müller

We show for an arbitrary $\ell_p$ norm that the property that a random geometric graph $\mathcal G(n,r)$ contains a Hamiltonian cycle exhibits a sharp threshold at $r=r(n)=\sqrt{\frac{\log n}{\alpha_p n}}$, where $\alpha_p$ is the area of…

Discrete Mathematics · Computer Science 2007-05-23 J. Diaz , D. Mitsche , X. Perez

The original proof of the Gromov's non-squeezing theorem [Gro85] is based on pseudo-holomorphic curves. The central ingredient is the compactness of the moduli space of pseudo-holomorphic spheres in the symplectic manifold…

Symplectic Geometry · Mathematics 2024-12-25 Shah Faisal

We prove that a pair of heterodimensional cycles can be born at the bifurcations of a pair of Shilnikov loops (homoclinic loops to a saddle-focus equilibrium) having a one-dimensional unstable manifold in a volume-hyperbolic flow with a…

Dynamical Systems · Mathematics 2019-02-11 Dongchen Li , Dmitry V. Turaev

In generic dynamical systems heteroclinic cycles are invariant sets of codimension at least one, but they can be structurally stable in systems which are equivariant under the action of a symmetry group, due to the existence of…

Chaotic Dynamics · Physics 2015-01-23 Olga Podvigina , Pascal Chossat

We prove a systolic inequality for the phi-relative 1-systole of a phi-essential 2-complex, where phi is a homomorphism from the fundamental group of the complex, to a finitely presented group G. Indeed we show that universally for any…

Differential Geometry · Mathematics 2010-10-22 Karin U. Katz , Mikhail G. Katz , Stephane Sabourau , Steven Shnider , Shmuel Weinberger

In this paper we prove that, for any arithmetic hyperbolic $n$-manifold $M$ of the first type, the systole of most of the principal congruence coverings $M_{I}$ satisfy $$sys_{1}(M_{I})\geq \frac{8}{n(n+1)}\log(vol(M_{I}))-c,$$ where $c$ is…

Differential Geometry · Mathematics 2017-10-04 Plinio G. P. Murillo

We prove that if G is an (n,d,lambda)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most lambda) and the following conditions are satisfied: 1. d/lambda >= (log n)^{1+epsilon} for some constant…

Combinatorics · Mathematics 2012-01-10 Michael Krivelevich

Let $H_r(n,p)$ denote the maximum number of Hamiltonian cycles in an $n$-vertex $r$-graph with density $p \in (0,1)$. The expected number of Hamiltonian cycles in the random $r$-graph model $G_r(n,p)$ is $E(n,p)=p^n(n-1)!/2$ and in the…

Combinatorics · Mathematics 2022-01-04 Raphael Yuster