Connectivity proven in large rank Gromov boundary of free factor complex.
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.
Trend · papers per month
We show that the complex of free factors of a free group of rank n > 1 is homotopy equivalent to a wedge of spheres of dimension n-2. We also prove that for n > 1, the complement of (unreduced) Outer space in the free splitting complex is homotopy equivalent to the complex of free factor systems and moreover is (n-2)-c…
Maps between automorphism groups are isomorphisms for free factor complexes.
The free factor complex of rank 4+ fails a combinatorial isoperimetric inequality.
We show how to derive hyperbolicity of the free factor complex of from the Handel-Mosher proof of hyperbolicity of the free splitting complex of , thus obtaining an alternative proof of a theorem of Bestvina-Feighn. We also show that under the natural map from the free splitting complex to free factor co…
Conditions for hyperbolic and relatively hyperbolic extensions of free groups using automorphisms with fixed points.
We develop the geometry of folding paths in Outer space and, as an application, prove that the complex of free factors of a free group of finite rank is hyperbolic.
The paper explores the geometry and dynamics of free splitting and free factor complexes for groups.
In this paper we prove that a fully irreducible outer automorphism relative to a non-exceptional free factor system acts loxodromically on the relative free factor complex as defined by Handel and Mosher. We also prove a north-south dynamic result for the action of such outer automorphisms on the closure of relative ou…
Corrects a 1998 proof about free factors of free groups.
Study shows top homology group isn't dualizing module for automorphism group of free groups.
For every finite graph , we define a simplicial complex associated to the outer automorphism group of the RAAG . These complexes are defined as coset complexes of parabolic subgroups of and interpolate between Tits buildings and free factor complexes. We show that each of these complexes is homotop…
New complex connects graph separability to group properties.
We give a description of the boundary of a complex of free factors that is analogous to E. Klarreich's description of the boundary of a curve complex. The argument uses the geometry of folding paths developed by Bestvina and Feighn as well as structural results about very small trees developed by Coulbois, Hilion, Lust…
Proves a connectivity conjecture for free groups, showing homotopy type of spheres.
Improved model-free RL algorithm with reduced sample complexity.
By using a notion of a geometric Dehn twist in , we prove that when projections of two -splittings to the free factor complex are far enough from each other in the free factor complex, Dehn twist automorphisms corresponding to the -splittings generate a free group of ra…
We show that strongly contracting geodesics in Outer space project to parameterized quasigeodesics in the free factor complex. This result provides a converse to a theorem of Bestvina--Feighn, and is used to give conditions for when a subgroup of has a quasi-isometric orbit map into the free …
We extend some results of [BF12] on subfactor projections to show that the projection of a free factor B to the free factor complex of the free factor A is well-defined with uniformly bound diameter, unless either A is contained in B or A and B are vertex stabilizers of a single splitting of F_n, i.e. they are disjoint…
When two free factors A and B of a free group F_n are in "general position" we define the projection of B to the splitting complex (alternatively, the complex of free factors) of A. We show that the projections satisfy properties analogous to subsurface projections introduced by Masur and Minsky. We use the subfactor p…
We study very small trees from the point of view of reducing systems of free factors, which are analogues of reducing systems of curves for a surface lamination; a non-trivial, proper free factor $F \leq \FN$ reduces if and only if acts on some subtree of with dense orbits. We characterize those trees, call…
The group $\Out$ of outer automorphisms of the free group has been an object of active study for many years, yet its geometry is not well understood. Recently, effort has been focused on finding a hyperbolic complex on which $\Out$ acts, in analogy with the curve complex for the mapping class group. Here, we focus on o…
We define a notion of free product for coarse spaces that generalizes the corresponding notion of a free product for groups. We show that free products preserve coarse properties such as coarse property C, finite coarse decomposition complexity, and coarse property A. We also give an upper bound estimate on the dimensi…
Handel and Mosher have proved that the free splitting complex FS for the free group is Gromov hyperbolic. This is a deep and much sought-after result, since it establishes FS as a good analogue of the curve complex for surfaces. We give a shorter alternative proof of this theorem, using surgery paths in Hatcher's spher…
Given a finitely generated subgroup of the outer automorphism group of the rank free group , there is a corresponding free group extension . We give sufficient conditions for when the extension is hyperbolic. In particular,…
We study the sample complexity of model-based reinforcement learning (henceforth RL) in general contextual decision processes that require strategic exploration to find a near-optimal policy. We design new algorithms for RL with a generic model class and analyze their statistical properties. Our algorithms have sample …
The inverse-free extreme learning machine (ELM) algorithm proposed in [4] was based on an inverse-free algorithm to compute the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of a Hermitian matrix. Before that recursive algorithm was applied in [4], its impr…
Gradient descent recovers principal components of overparametrized asymmetric matrices without explicit regularization.
The effectiveness of model-based versus model-free methods is a long-standing question in reinforcement learning (RL). Motivated by recent empirical success of RL on continuous control tasks, we study the sample complexity of popular model-based and model-free algorithms on the Linear Quadratic Regulator (LQR). We show…
The outer automorphism group Out(F_2g) of a free group on 2g generators naturally contains the mapping class group of a punctured surface as a subgroup. We define a subsurface projection of the sphere complex of the connected sum of n copies of S^1 x S^2 into the arc complex of the surface and use this to show that thi…
Tree-AMP simplifies inference in complex tree-structured models.
The free factor graph for Aut(F_N) is not hyperbolic.
Probabilistic approach to Boolean matrix factorization can provide solutions robustagainst noise and missing values with linear computational complexity. However,the assumption about latent factors can be problematic in real world applications.This study proposed a new probabilistic algorithm free of assumptions of lat…
New method achieves nearly horizon-free offline reinforcement learning for tabular and linear MDPs.
We generalise the Karrass-Pietrowski-Solitar and the Nielsen realisation theorems from the setting of free groups to that of free products. As a result, we obtain a fixed point theorem for finite groups of outer automorphisms acting on the relative free splitting complex of Handel--Mosher and on the outer space of a fr…
We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.
Hyperbolicity proven for a specific type of group extension.
New algorithm for RL with horizon-free reward-free exploration for linear MDPs.
Study connects group invariants through outer automorphisms and polynomial relations.
We prove that a Kähler group which is cubulable, i.e. which acts properly discontinuously and cocompactly on a CAT(0) cubical complex, has a finite index subgroup isomorphic to a direct product of surface groups, possibly with a free Abelian factor. Similarly, we prove that a closed aspherical Kähler manifold with a cu…
Effective rank rigidity proved for cubulated groups with factor systems.
New RL algorithm reduces sample complexity for optimal learning.
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 …
For each there is a one complex parameter family of homeomorphisms of the circle consisting of linear fractional transformations `conjugated by '. We show that these families are free of relations, which determines the structure of `the group of homeomorphisms of finite type'. We also discuss a numbe…
In this paper we define currents relative to a free factor system. We prove that a fully irreducible outer automorphism relative to a free factor system acts with uniform north-south dynamics on a subspace of the space of projective relative currents.
Random walks on free groups reveal asymmetric expansion factors.
We prove that a group obtained as a quotient of the free product of finitely many cubulable groups by a finite set of relators satisfying the classical --small cancellation condition is cubulable. This yields a new large class of relatively hyperbolic groups that can be cubulated, and constitutes the first ins…
The original de Rham cohomology due to Souriau and the singular cohomology in diffeology are not isomorphic to each other in general. This manuscript introduces a singular de Rham complex endowed with an integration map into the singular cochain complex which gives the de Rham theorem for every diffeological space. It …