English
Related papers

Related papers: Regular geometric cycles

200 papers

We produce explicit geometric representatives of nontrivial homology classes in the space of long knots in R^d, when d is even. We generalize results of Cattaneo, Cotta-Ramusino and Longoni to define cycles which live off of the vanishing…

Algebraic Topology · Mathematics 2011-11-17 Kristine E. Pelatt

We prove a non-squeezing result for infinite-dimensional Hamiltonian flows using non-standard model theory. For this we prove the existence of a corresponding family of pseudoholomorphic spheres and characterize the maximal time in terms of…

Symplectic Geometry · Mathematics 2018-06-19 Oliver Fabert

Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving…

Commutative Algebra · Mathematics 2017-11-10 Pierre-Louis Giscard , Paul Rochet , Richard Wilson

We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…

Probability · Mathematics 2015-05-25 Tobias Johnson , Elliot Paquette

The existence of black holes is one of the key predictions of general relativity (GR) and therefore a basic consistency test for modified theories of gravity. In the case of spherical symmetry in GR the existence of an apparent horizon and…

General Relativity and Quantum Cosmology · Physics 2021-09-22 Sebastian Murk , Daniel R. Terno

The purpose of the present paper is to prove existence of super-exponentially many compact orientable hyperbolic arithmetic $n$-manifolds that are geometric boundaries of compact orientable hyperbolic $(n+1)$-manifolds, for any $n \geq 2$,…

Geometric Topology · Mathematics 2020-06-25 Michelle Chu , Alexander Kolpakov

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

Computational Geometry · Computer Science 2014-04-01 Glencora Borradaile , Erin Wolf Chambers

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

We investigate conformal dimension for the class of infinite hyperbolic groups in the Gromov density model $\mathcal{G}^d_{m,l}$ of random groups with $m \geq 2$ fixed generators, density $0 < d < 1/2$ and relator length $l \to \infty$. Our…

Group Theory · Mathematics 2022-04-12 Jordan Frost

In this paper we introduce a notion of the Gromov-Hausdorff distance with boundary, denoted by $d_{GHB}$, to construct a framework of convergence of noncomplete metric spaces. We show that a class of bounded $A$-uniform spaces with diameter…

Metric Geometry · Mathematics 2021-08-10 Hyogo Shibahara

We show that a sequence of graphs with geometric property (T) has many small cycles. We also show that when a small part of a sequence of graphs with geometric property (T) is changed, it still has geometric property (T), provided that it…

Functional Analysis · Mathematics 2022-03-14 Jeroen Winkel

We develop the theory of $J$-holomorphic discs in Hilbert spaces with almost complex structures. As an aplication, we prove a version of Gromov's symplectic non-squeezing theorem for Hilbert spaces. It can be applied to short-time…

Complex Variables · Mathematics 2015-03-03 Alexandre Sukhov , Alexander Tumanov

We prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. This implies that there exist cubic graphs of arbitrarily high girth with no homomorphisms to the cycle of size 7.

Combinatorics · Mathematics 2007-05-23 Hamed Hatami

We consider a particle moving towards a rotating black hole. We are interested in the number of its revolution $n$ around a black hole. In our previous work (Pavlov and Zaslavskii in Gen Relativ Gravit 50: 14, 2018. arXiv:1707.02860) we…

General Relativity and Quantum Cosmology · Physics 2019-05-16 Yu. V. Pavlov , O. B. Zaslavskii

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

General Topology · Mathematics 2011-10-28 Agelos Georgakopoulos

We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n)…

Group Theory · Mathematics 2013-07-09 Danny Calegari , Alden Walker

We investigate the local structure of the space $\mathcal{M}$ consisting of isometry classes of compact metric spaces, endowed with the Gromov-Hausdorff metric. We consider finite metric spaces of the same cardinality and suppose that these…

Metric Geometry · Mathematics 2016-11-15 Alexander O. Ivanov , Alexey A. Tuzhilin

We give an explicit formula for the Gromov width for a class of symplectic toric manifolds constructed from simple graphs. As a corollary, we show a version of non-squeezing theorem with respect to the inclusion of connected graphs.

Symplectic Geometry · Mathematics 2020-11-20 Suyoung Choi , Taekgyu Hwang

Let $D$ be a closed disk centered at the origin in the horizontal hyperplane $\{t=0\}$ of the sub-Riemannian Heisenberg group $\hh^n$, and $C$ the vertical cylinder over $D$. We prove that any finite perimeter set $E$ such that $D\subset…

Differential Geometry · Mathematics 2011-04-28 Manuel Ritoré

Let $H$ be a fixed graph and $\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\mathcal{G}$ follows a normal limiting…

Combinatorics · Mathematics 2018-08-06 Michael Drmota , Lander Ramos , Juanjo Rué