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,657 papers · 148 categories

Trend · papers per month

6491,2981,9472,596 · Jun 202019922001200920172026
48 results for graph of free groups

The study proves conjecture for specific Artin groups.

problem Proving conjecture about Artin groups' properties.
method Analyzing Artin groups associated to triangle-free graphs and cones over square-free bipartite graphs.
result Proves conjecture for specific Artin groups.

The study shows that certain groups can be uniquely identified by their finite abelian summands.

problem Identifying groups based on their finite abelian summands.
method Analyzing hyperbolic groups as graphs of free groups with cyclic edge groups.
result Free products of free and surface groups are profinitely rigid.

New findings on algebraic structure of hyperbolic graph braid groups.

problem Classifying and understanding the algebraic structure of hyperbolic graph braid groups.
method Analyzing specific graph types (sun and pulsar graphs) and proving theorems about their braid groups.
result 3-strand braid groups of sun graphs are free, while most pulsar graphs contain surface subgroups.

The study finds a subgroup of graph braid groups that is a direct product of non-abelian free groups.

problem Finding subgroups of graph braid groups with specific properties.
method Observing the structure of graph braid groups and their subgroups.
result A subgroup of the same cohomological dimension is a direct product of non-abelian free groups.

The study embeds infinite-dimensional geometric structures in Cayley graphs.

problem Embedding infinite-dimensional structures in finite Cayley graphs.
method Examples of groups and generating sets, quasi-isometric embeddings, subsurface projections.
result Cayley graphs contain quasi-isometric copies of Zm\mathbb{Z}^m for all m1m\geq 1.

The paper studies algebraic integer relations and sequences converging to 4.

problem Investigating algebraic integer relations and convergence of sequences.
method Constructing a generalized Farey graph for the subgroup GαG_α and analyzing its properties.
result A sequence of algebraic integers converges to 4, each corresponding to a non-free group of rank 2.

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of infinite index. As a corollary, the same holds for limit groups. We also obtain a ch…

2011-02-14abs ↗pdf ↗

Non-normal subgroups of certain groups grow homologically exponentially.

problem Homological torsion growth in non-normal subgroups of specific groups.
method Proving exponential growth of homological torsion in a sequence of non-normal subgroups.
result Exponential homological torsion growth in a sequence of non-normal subgroups.

New hyperbolic graph constructed from projections of free splitting graph.

problem Constructing a new hyperbolic graph from projections of free splitting graph.
method Using submanifold projections and geometric realization of free splitting graph.
result A new hyperbolic graph constructed for n3n\geq 3.

Let ΓΓ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph ΓΓ is CFS\mathcal{CFS}, we prove that the right-angled Coxeter group GΓG_Γ is virtually a Seifert manifold group or virtually a graph manifold group and we give a complete quasi-isometr…

2017-12-04abs ↗pdf ↗

We prove that any isometry of the graph of cyclic splittings of a finitely generated free group FNF_N of rank N3N\ge 3 is induced by an outer automorphism of FNF_N. The same statement also applies to the graphs of maximally-cyclic splittings, and of very small splittings.

2014-06-25abs ↗pdf ↗

The paper explores linearly free graphs and their embeddings into 3D space.

problem Understanding the conditions under which a graph's embedding into 3D space is free.
method Developed a sufficient condition for a linear embedding to be free and applied it to specific graph cases.
result Established sufficient conditions for a graph to be linearly free and provided examples and counterexamples.

Free groups can be end homogeneity groups of 3-manifolds.

problem Tackling the possibility of free groups as end homogeneity groups of 3-manifolds.
method Constructing specific 3-manifolds with end homogeneity groups isomorphic to free groups.
result For every finitely generated free group, there exists an irreducible open 3-manifold with that group as its end homogeneity group.

The paper proves an ascending chain condition for subgroups in hyperbolic and graph 3-manifolds.

problem Proving an ascending chain condition for subgroups in specific types of 3-manifolds.
method Uses profinite techniques and geometric proofs for hyperbolic and graph manifolds.
result Established the ascending chain condition for free subgroups of constant rank in closed hyperbolic and graph 3-manifolds.

A well known question of Gromov asks whether every one-ended hyperbolic group ΓΓ has a surface subgroup. We give a positive answer when ΓΓ is the fundamental group of a graph of free groups with cyclic edge groups. As a result, Gromov's question is reduced (modulo a technical assumption on 2-torsion) to the case when…

2017-01-10abs ↗pdf ↗

The paper finds a short graph incompressible in a complex with specific properties.

problem Finding a short graph in a complex with specific properties.
method Analyzing a finite connected 2-complex with a piecewise Riemannian metric and showing the existence of a 2-incompressible graph.
result The existence of a 2-incompressible graph with a length satisfying a curvature-free inequality.

The Cartesian subgroup in graph products of groups is studied with bounds and algorithms.

problem Understanding the structure of Cartesian subgroups in graph products of groups.
method Theory of polyhedral products, lower and upper bounds, algorithm for small presentations.
result Bounds on the number of relations and deficiency in presentations of Cartesian groups.

Study graph products of groups, classifying them up to measure equivalence and rigidity.

problem Classifying graph products of groups up to measure equivalence and rigidity.
method Measure-theoretic and structural properties of von Neumann algebras, rigidity theorems.
result Quantified measure equivalence classification and rigidity theorems for graph products.

A finite simple graph ΓΓ determines a quotient PΓP_Γ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior joint work with R. Randell. We show that, for a K4K_4-free graph ΓΓ, a product of deletio…

2019-08-21abs ↗pdf ↗

We show that the Gromov boundary of the free factor graph for the free group Fn with n>2 generators is the space of equivalence classes of minimal very small indecomposable projective Fn-trees without point stabilizer containing a free factor equipped with a quotient topology. Here two such trees are equivalent if the …

2012-11-07abs ↗pdf ↗

We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group is not one-ended, then we can blow up vertex groups to graphs of groups with simp…

2014-03-25abs ↗pdf ↗

The ellipticity graph of a free group FF was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of FF, which acts on this graph. The graph was constructed to be analogous to the curve complex of a surface. It is a bipartite graph, whose vertices are conjugacy classes of nontrivial ele…

2010-06-24abs ↗pdf ↗

New Lehmer constants computed for free groups, improving bounds.

problem Tackles Lehmer's problem on Mahler measures and Fuglede-Kadison determinants.
method Uses relations between Fuglede-Kadison determinants and random walks on Cayley graphs, and gluing formula for L2L^2-torsions.
result Computes new upper bound of 23\frac{2}{\sqrt{3}} for Lehmer's constants of torsion-free groups with non-cyclic free subgroups.

We show that the arc graph of Sg1S_g^1 is a coarse Lipschitz retract of the free splitting complex of F2gF_{2g}. We also show that the arc and curve graph of Sg1S_g^1 is a coarse Lipschitz retract of both the cyclic splitting graph of F2gF_{2g} and the maximally cyclic splitting graph of F2gF_{2g}.

2015-11-30abs ↗pdf ↗

We consider (smooth) solutions of the mean curvature flow of graphs over bounded domains in a Lie group free up to step two (and not necessarily nilpotent), endowed with a one parameter family of Riemannian metrics $σ_\e$ collapsing to a subRiemannian metric σ0σ_0 as $\e\to 0$. We establish Ck,αC^{k,α} estimates for this…

2015-02-03abs ↗pdf ↗