Related papers: Word maps and random words

Consider the (formal/analytic/algebraic) map-germs Maps(X,(k^p,o)). Let G be the group of right/contact/left-right transformations. I extend the following (classical) results from the real/complex-analytic case to the case of arbitrary…

This paper is an overview of my recent work on abstract homomorphisms of algebraic groups. It is based on a talk given at the Conference on Group Actions and Applications in Geometry, Topology, and Analysis held in Kunming in July 2012.

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

We study word maps with constants on symmetric groups. Even though there are mixed identities of bounded length that are valid for all symmetric groups, we show that no such identities hold in a metric sense. Moreover, we prove that word…

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

A short survey about combinatorics on words and algorithmic methods in a ring. Special attention is given to Shirshov's results. Adopted for undegraduate students.

In this paper, we construct and study derived character maps of finite-dimensional representations of $\infty$-groups. As models for $\infty$-groups we take homotopy simplicial groups, i.e. homotopy simplicial algebras over the algebraic…

The Amit conjecture about word maps on finite nilpotent groups has been shown to hold for certain classes of groups. The generalised Amit conjecture says that the probability of an element occurring in the image of a word map on a finite…

There are many situations in geometry and group theory where it is natural, convenient or necessary to explore infinite groups via their actions on finite objects, i.e. via the finite quotients of the group. But how much understanding can…

This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…

We discuss special properties of the spaces of characters and positive definite functions, as well as their associated dynamics, for arithmetic groups of product type. Axiomatizing these properties, we define the notions of charmenability…

In this paper we look at the notion of cohomological triviality of fibrations of homogeneous spaces of affine algebraic groups defined over $\mathbb{C}$ and use topological methods, primarily the theory of covering spaces. This is made…

We study algebraicity and smoothness of fixed point stacks for flat group schemes which have a finite composition series whose factors are either reductive or proper, flat, finitely presented, acting on algebraic stacks with affine,…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

The work of Chatzidakis and Hrushovski on the model theory of difference fields in characteristic zero showed that groups defined by difference equations have a very restricted structure. Recent work of Chatzidakis, Hrushovski and Peterzil…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We survey both old and new developments in the theory of algorithms in real algebraic geometry -- starting from effective quantifier elimination in the first order theory of reals due to Tarski and Seidenberg, to more recent algorithms for…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

Indices of fixed point classes play a central role in Nielsen fixed point theory. Jiang-Wang-Zhang proved that for selfmaps of graphs and surfaces, the index of any fixed point class has an upper bound called its characteristic. In this…