Related papers: Instability of nondiscrete free subgroups in Lie g…
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…
The question of open-loop control in the Gaussian regime may be cast by asking which Gaussian unitary transformations are reachable by turning on and off a given set of quadratic Hamiltonians. For compact groups, including finite…
Given a finitely generated, torsion-free nilpotent group, we find the maximum possible (critical) regularity for its faithful actions by diffeomorphisms of the closed or half-open interval and of the circle. Our result gives an expression…
We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $\sigma(H_1)$ of…
The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…
The Hanna Neumann conjecture gives a bound on the intersection of finitely generated subgroups of free groups. We explore a natural extension of this result, which turns out to be true only in the finite index case, and provide…
Many inference problems involving questions of optimality ask for the maximum or the minimum of a finite set of unknown quantities. This technical report derives the first two posterior moments of the maximum of two correlated Gaussian…
In this paper we bring together results about the density of subsemigroups of abelian Lie groups, the minimal number of topological generators of abelian Lie groups and a result about actions of algebraic groups. We find the minimal number…
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…
We study adequate subgroups of $GL_n$ over a finite field. This notion is useful in the study of automorphy lifting theorems. In particular, we give a sufficient condition for a subgroup to be adequate.
We study the relative growth of finitely generated subgroups in finitely generated groups, and the corresponding distortion function of the embeddings. We explore which functions are equivalent to the relative growth functions and…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…
Let $G$ be a connected algebraic semisimple real Lie group with finite center and no compact factors, and let $\Gamma$ be a Zariski dense discrete subgroup of $G$. We show that $\Gamma$ contains free, finitely generated subsemigroups whose…
The present paper is devoted to establishing an optimal approximation exponent for the action of an irreducible uniform lattice subgroup of a product group on its proper factors. Previously optimal approximation exponents for lattice…
Let $T$ be the generator of a $C_0$-semigroup $e^{-Tt}$ which is of finite trace for all $t>0$ (a Gibbs semigroup). Let $A$ be another closed operator, $T$-bounded with $T$-bound equal to zero. In general $T+A$ might not be the generator of…
We prove that any non-cocompact irreducible lattice in a higher rank semi-simple Lie group contains a subgroup of finite index, which has three generators.
A finitely generated group or monoid is said to be context-free if it has context-free word problem. In this note, we give an example of a context-free monoid, none of whose maximal subgroups are finitely generated. This answers a question…
Gray and Ruskuc have shown that any group G occurs as the maximal subgroup of some free idempotent generated semigroup IG(E) on a biordered set of idempotents E, thus resolving a long standing open question. Given the group G, they make a…