SearcharxivSearch

arXiv subjects

Eliyahu Rips

Publications and source records attributed to Eliyahu Rips.

8 recordsLinked to original sources

The Burnside problem for odd exponents

We show that the free Burnside groups $B(m,n)$ are infinite for $m\geq 2$ and odd $n\geq 557$, the best currently known lower bound for the exponent. The proof uses iterated small cancellation theory where the induction is based on the nesting depth of relators. The main instrument at every step is a new concept of a certification sequence.

math.GR

On Growth of Double Cosets in Hyperbolic Groups

Let $H$ be a hyperbolic group, $A$ and $B$ be subgroups of $H$, and $gr(H,A,B)$ be the growth function of the double cosets $AhB, h \in H$. We prove that the behavior of $gr(H,A,B)$ splits into two different cases. If $A$ and $B$ are not quasiconvex, we obtain that every growth function of a finitely presented group can appear as $gr(H,A,B)$. We can even take $A=B$. In contrast, for quasiconvex subgroups A and B of infinite index, $gr(H,A,B)$ is exponential. Moreover, there exists a constant $λ> 0$, such that $gr(H,A,B)(r) >λf_H(r)$ for all big enough $r$, where $f_H(r)$ is the growth function of the group $H$. So, we have a clear dychotomy between the quasiconvex and non-quasiconvex case.

math.GR

On Products of Closed Subsets in Free Groups

We present examples of closed subsets of a free group such that their product is not closed in the profinite topology. We discuss how to characterize a subset of a free group which is closed in the profinite topology and its product with any finitely generated subgroup of a free group is also closed in the profinite topology.

math.GR

On Closed Subsets of Free Groups

We give two examples of a finitely generated subgroup of a free group and a subset, closed in the profinite topology of a free group, such that their product is not closed in the profinite topology of a free group.

math.GR

Sharply 2-transitive groups in characteristic 0

We construct sharply 2-transitive groups of characteristic 0 without non-trivial abelian normal subgroup. These groups act sharply 2-trnaisitvely by conjugation on their involutions. This answers a longstanding open question.

math.GR

On double cosets in free groups

It is shown that for any finitely generated subgroups H and K of a free group F, and for any element g in F the double coset HgK is closed in the profinite topology of F.

math.GR

Isoperimetric and isodiametric functions of groups

This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $α\ge 4$ are computable in time $\le C2^{2^{Cm}}$ for some constant $C>0$ then $n^α$ is equivalent (``big O'') to the Dehn function of a finitely presented group. The smallest isodiametric function of this group is $n^{3/4α}$. On the other hand if $n^α$ is equivalent to the Dehn function of a finitely presented group then the first $m$ digits of $α$ are computable in time $\le C2^{2^{2^{Cm}}}$ for some constant $C$. This implies that, say, functions $n^{π+1}$, $n^{e^2}$ and $n^α$ for all rational numbers $α\ge 4$ are equivalent to the Dehn functions of some finitely presented group and that $n^π$ and $n^α$ for all rational numbers $α\ge 3$ are equivalent to the smallest isodiametric functions of finitely presented groups. Moreover we describe all Dehn functions of finitely presented groups $\succ n^4$ as time functions of Turing machines modulo two conjectures: \begin{enumerate} \item Every Dehn function is equivalent to a superadditive function. \item The square root of the time function of a Turing machine is equivalent to the time function of a Turing machine. \end{enumerate}

math.GR