Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

113227340453 · Jun 202019922001200920172026
48 results for Gromov's random monster group

The study proves super-rigidity of Gromov's random monster group for various types of groups.

problem Super-rigidity of Gromov's random monster group in various group types.
method Proof of morphisms having finite image and introduction of hereditary super-rigidity.
result Gromov's random monster group has super-rigidity and hereditary super-rigidity with respect to certain groups.

In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum-Connes assembly map is an isomorphism for the associated metric space XX. As discussed in the first paper in this s…

2010-12-19abs ↗pdf ↗

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes assembly map is injective, but not surjective, for the associated metric space XX. Exp…

2010-12-19abs ↗pdf ↗

We classify Veech groups of tame non-compact flat surfaces. In particular we prove that all countable subgroups of GL+(2,R)\mathbf{GL}_+(2,\R) avoiding the set of mappings of norm less than 1 appear as Veech groups of tame non-compact flat surfaces which are Loch Ness monsters. Conversely, a Veech group of any tame flat surf…

2009-06-29abs ↗pdf ↗

The Loch Ness Monster admits many regular dessins d'enfants and different holomorphic structures.

problem Classical theory of dessins d'enfants on compact surfaces extended to non-compact surfaces.
method Study of infinite genus surfaces and their connections to Riemann surfaces.
result The Loch Ness monster admits infinitely many regular dessins d'enfants.

Study flute surfaces and Loch Ness monster, proving their parabolicity and uniformization.

problem Characterizing parabolicity and uniformization of flute surfaces and the Loch Ness monster.
method Associate sequences to Fuchsian groups and analyze their properties.
result Zero-twist flute surfaces are parabolic if and only if the series diverges.

We consider here the problem of classifying orbits of an action of the dif- feomorphism group of 3-space on a tower of fibrations with P2-fibers that generalize the Monster Tower due to Montgomery and Zhitomirskii. As a corollary we give the first steps towards the problem of classifying Goursat 2-flags of small length…

2011-07-21abs ↗pdf ↗

We further study the incidence relations that arise from the various subtowers, known as Baby Monster, which exist within the R3\mathbb{R}^{3}-Monster Tower. This allows us to complete the RVTRVT class spelling rules. We also present a method of calculating the various Baby Monster that appear within the Monster Tower.

2014-07-07abs ↗pdf ↗

In earlier work, we introduced the `Monster tower', a tower of fibrations associated to planar curves. We constructed an algorithm for classifying its points with respect to the equivalence relation generated by the action of the contact pseudogroup on the tower. Here, we construct the analogous tower for curves in nn

2009-12-15abs ↗pdf ↗

The Monster tower, also known as the Semple tower, is a sequence of manifolds with distributions of interest to both differential and algebraic geometers. Each manifold is a projective bundle over the previous. Moreover, each level is a fiber compactified jet bundle equipped with an action of finite jets of the diffeom…

2015-12-01abs ↗pdf ↗

Stable subgroups and the Morse boundary are two systematic approaches to collect and study the hyperbolic aspects of finitely generated groups. In this paper we unify and generalize these strategies by viewing any geodesic metric space as a countable union of stable subspaces: we show that every stable subgroup is a qu…

2016-06-01abs ↗pdf ↗

This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme properties (monsters).

2006-02-10abs ↗pdf ↗

The paper studies the geometry and topology of a specific foliation on a complex surface.

problem Characterizing the geometry and topology of a specific foliation on a complex surface.
method Analyzes the isoperiodic foliation of the stratum ΩM1(1,1,2)Ω\mathcal{M}_1(1,1,-2), proving each leaf is a surface of infinite genus.
result Each leaf is a surface of infinite genus homeomorphic to the Loch Ness monster surface.

Random walks on hyperbolic spaces show linear growth in translation lengths.

problem Investigate the growth of translation lengths in random walks on hyperbolic spaces.
method Prove linear growth without moment conditions and apply to Teichmüller spaces.
result Linear growth of translation lengths in random walks on hyperbolic spaces.

Random branched covers of groups are homotopy equivalent to geometrically small cancellation complexes.

problem Understanding the topological properties of random branched covers of groups.
method Constructing a random model for branched covers and showing asymptotic homotopy equivalence to geometrically small cancellation complexes.
result The fundamental group of a random branched cover is Gromov hyperbolic and has small cohomological dimension.

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a random walk on such G converges to the Gromov boundary almost surely. We apply the co…

2014-10-15abs ↗pdf ↗

This paper finds minimal sets of generators for mapping class groups of specific surfaces.

problem Finding minimal sets of generators for mapping class groups of infinite-type surfaces.
method Analyzing specific surfaces S(n)S(n) to determine minimal sets of generators.
result Minimal sets of generators for Map(S(n))\mathrm{Map}(S(n)) are identified for n8n \ge 8 (3 elements), n3n \ge 3 (4 elements), and S(1)S(1) (2 elements).

The paper examines random walks on metric spaces and finds commensurable subgroups.

problem Determining commensurable subgroups via stationary measures in metric spaces.
method Analyzing random walks on isometry groups of metric spaces with non-singular stationary measures.
result Subgroups generated by random walks are commensurable under mild conditions.

Study examines large deviations in random walks on hyperbolic spaces.

problem Large deviations in random walks on Gromov-hyperbolic spaces.
method Established large deviations results for distance and translation length of random walks.
result Deduced a special case of a conjecture regarding spectral radii of random matrix products.

The monster tower is a tower of spaces over a specified base; each space in the tower is a parameter space for curvilinear data up to a specified order. We describe and analyze a natural stratification of these spaces.

2016-06-25abs ↗pdf ↗

In this paper, for a non compact and orientable surface SS been either: the Infinite Loch Ness monster, the Cantor tree and the Blooming Cantor tree, we construct explicitly an infinitely generated Fuchsian group Γ<PSL(2,R)Γ<PSL(2,\mathbb{R}), such that the quotient H/Γ\mathbb{H}/Γ is a hyperbolic surface homeomorphic to SS.

2018-06-12abs ↗pdf ↗

Let XX be a proper geodesic Gromov hyperbolic metric space and let GG be a cocompact group of isometries of XX admitting a uniform lattice. Let dd be the Hausdorff dimension of the Gromov boundary X\partial X. We define the critical exponent δ(μ)δ(μ) of any discrete invariant random subgroup μμ of the locally compa…

2018-04-09abs ↗pdf ↗

In this paper we present in a topological way the construction of the orientable surface with only one end and infinite genus, called \emph{The Infinite Loch Ness Monster}. In fact, we introduce a flat and hyperbolic construction of this surface. We discuss how the name of this surface has evolved and how it has been h…

2017-01-25abs ↗pdf ↗

We give generators for a certain complex hyperbolic braid group. That is, we remove a hyperplane arrangement from complex hyperbolic 1313-space, take the quotient of the remaining space by a discrete group, and find generators for the orbifold fundamental group of the quotient. These generators have the most natural fo…

2017-02-19abs ↗pdf ↗

In this note we summarize our results from earlier work with the Monster Tower (A Monster Tower Approach to Goursat Multi-Flags). In particular, we give an overview of the problem of classifying the orbits within a tower of fibrations with fibers diffeomorphic to projective planes. Included in this note is one new resu…

2013-02-21abs ↗pdf ↗

Gromov showed that for fixed, arbitrarily large C, any uniformly C-Lipschitz affine action of a random group in his graph model on a Hilbert space has a fixed point. We announce a theorem stating that more general affine actions of the same random group on a Hilbert space have a fixed point. We discuss some aspects of …

2017-05-07abs ↗pdf ↗

We show that simple random walks on (non-trivial) relatively hyperbolic groups stay O(log(n))O(\log(n))-close to geodesics, where nn is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class groups stay O(nlog(n))O(\sqrt{n\log(n)})-close to geodesics and hierarchy paths. Along the…

2013-05-23abs ↗pdf ↗

Let S=Γ\HS=Γ\backslash \mathbb{H} be a hyperbolic surface of finite topological type, such that the Fuchsian group ΓPSL2(R)Γ\le \operatorname{PSL}_2(\mathbb{R}) is non-elementary, and consider any generating set S\mathfrak S of ΓΓ. When sampling by an nn-step random walk in π1(S)Γπ_1(S) \cong Γ with each step given by an element…

2018-07-10abs ↗pdf ↗

We introduce a new random group model called the square model: we quotient a free group on nn generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for densities >12> \frac{1}{2} a random group in the square model is trivial with overwhel…

2014-05-09abs ↗pdf ↗

Random groups prove length constraints on product of conjugates.

problem Quantify products of conjugates in random groups.
method Sharp van Kampen diagram argument and boundary block-counting.
result Prove a sharp inequality for products of conjugates in random groups.

To every Gromov hyperbolic space X one can associate a space at infinity called the Gromov boundary of X. Gromov showed that quasi-isometries of hyperbolic metric spaces induce homeomorphisms on their boundaries, thus giving rise to a well-defined notion of the boundary of a hyperbolic group. Croke and Kleiner showed t…

2019-09-04abs ↗pdf ↗

For finitely supported random walks on finitely generated groups GG we prove that the identity map on GG extends to a continuous equivariant surjection from the Martin boundary to the Floyd boundary, with preimages of conical points being singletons. This yields new results for relatively hyperbolic groups. Our key e…

2017-08-07abs ↗pdf ↗

We prove that a random group of the graph model associated with a sequence of expanders has fixed-point property for a certain class of CAT(0) spaces. We use Gromov's criterion for fixed-point property in terms of the growth of n-step energy of equivariant maps from a finitely generated group into a CAT(0) space, to wh…

2012-10-22abs ↗pdf ↗

New universal automorphic functions capture monstrous moonshine.

problem Developing a universal framework for automorphic functions.
method Reformulating old results, constructing new coordinates, and defining central extensions.
result New invariant 1-forms and representations for universal Teichmüller space.

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erdős-Rényi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the first homology group, which was shown earlier by Linial and Meshulam to be p = 2 log(…

2010-10-28abs ↗pdf ↗

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erdős-Rényi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the first homology group, which was shown earlier by Linial and Meshulam to be p = 2 log(…

2007-11-16abs ↗pdf ↗