Related papers: Verbal width in arithmetic Chevalley groups

We prove a common generalization of the fact that the weighted number of maximal chains in the strong Bruhat order on the symmetric group is ${n \choose 2}!$ for both the code weights and the Chevalley weights. We also define weights which…

By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…

The present paper is the [slightly expanded] text of our talk at the Conference "Advances in Group Theory and Applications" at Porto Cesareo in June 2011. Our main results assert that [elementary] Chevalley groups very rarely have finite…

Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

Word maps in a group, an analogue of polynomials in groups, are defined by substitution of formal words. Lubotzky gave a characterization of the images of word maps in finite simple groups, and a consequence of his characterization is the…

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…

We prove that every length on a simple group over a locally compact field, is either bounded or proper.

We present explicit upper bounds for the number and size of conjugacy classes in finite Chevalley groups and their variations. These results have been used by many authors to study zeta functions associated to representations of finite…

In this paper we prove that every automorphism of (elementary) adjoint Chevalley group with root system of rank $>1$ over a commutative ring (with 1/2 for the systems $A_2$, $F_4$, $B_l$, $C_l$; with 1/2 and 1/3 for the system $G_2$) is…

Chevalley's theorem and it's converse, the Sheppard-Todd theorem, assert that finite reflection groups are distinguished by the fact that the ring of invariant polynomials is freely generated. We show that in the Euclidean case, a weaker…

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

We show that there is an order-preserving embedding of the additive group of rational numbers $\mathbb{Q}$ into a 2-generator group $G$. The group $G$ can be chosen to be a solvable group $G$ of length 3, which is a minimal result in the…

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in…

Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

We prove a higher-dimensional Chevalley restriction theorem for orthogonal groups, which was conjectured by Chen and Ng\^{o} for reductive groups. In characteristic $p>2$, we also prove a weaker statement. In characteristic $0$, the theorem…

We introduce the notion of a braid group parametrized by a ring, which is defined by generators and relations and based on the geometric idea of painted braids. We show that the parametrized braid group is isomorphic to the semi-direct…

Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classes of graphs, by defining regular grammars for unordered…

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…