Related papers: Word length versus lower central series depth for …
We study the diameter of the graph $G(w)$ of reduced words of an element $w$ in a Coxeter group $W$ whose edges correspond to applications of the Coxeter relations. We resolve conjectures of Reiner--Roichman and Dahlberg--Kim by proving a…
We find surface subgroups in certain one-relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
The theme of this paper is that algebraic complexity implies dynamical complexity for pseudo-Anosov homeomorphisms of a closed surface S_g of genus g. Penner proved that the logarithm of the minimal dilatation for a pseudo-Anosov…
We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in the…
The best known method to give a lower bound for the Noether number of a given finite group is to use the fact that it is greater than or equal to the Noether number of any of the subgroups or factor groups. The results of the present paper…
We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.
We study braid diagrams with a minimal number of crossings. Such braid diagrams correspond to geodesic words for the braid groups with standard Artin generators. We prove that a diagram of a homogeneous braid is minimal if and only if it is…
We investigate criteria ensuring that a one-relator group $G$ contains a right-angled Artin subgroup $A(\Gamma)$, corresponding to a finite graph $\Gamma$. In particular, we prove that if $\Gamma$ is a forest with at least one edge and the…
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…
A one-relator group with lower central series of length \omega^2 is constructed. This answers a problem of G. Baumslag.
We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…
In this paper we give an algorithm for computing the conjugacy growth series for a right-angled Artin group, based on a natural language of minimal length conjugacy representatives. In addition, we provide a further language of unique…
We study the lower central series of a right-angled Coxeter group $RC_K$ and the associated Lie algebra $L(RC_K)$. The latter is related to the graph Lie algebra $L_K$. We give an explicit combinatorial description of the first three…
We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also…
Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…
We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…
In this paper, we sharpen a theorem of Artin to show that for a finite group, the dimension of the subspace of class functions spanned by the rational valued characters equals the number of conjugacy classes of cyclic subgroups.
We consider exact sequences and lower central series of surface braid groups and we explain how they can prove to be useful for obtaining representations for surface braid groups. In particular, using a completely algebraic framework, we…
In the present note, we complete the correspondence between stratum components of translation surfaces in low genus and finite-type Artin groups with defining Dynkin diagram containing $E_6$. In an earlier work, we showed that in genus $3$…
We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.