Related papers: Word maps and random words

For any positive integers m and n, the word map (x,y) -> x^m y^n is almost measure preserving on large finite simple groups G.

We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

Lettericity is a graph parameter introduced by Petkov\v{s}ek in 2002 in order to study well-quasi-orderability under the induced subgraph relation. In the world of permutations, geometric griddability was independently introduced in 2013 by…

Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…

This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following…

Contents: Rational functions with given monodromy on generic curves (I. Bouw & S. Wewers); Can deformation rings of group representations not be local complete intersections? (T. Chinburg); Lifting an automorphism group to finite…

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

Let $K$ be a finite extension of the $p$-adic numbers $\mathbb Q_p$ with ring of integers $\mathcal O_K$, $\mathcal X$ a regular scheme, proper, flat, and geometrically irreducible over $\mathcal O_K$ of dimension $d$, and $\mathcal X_K$…

We consider two variants of those Abelian groups with all proper characteristic subgroups isomorphic and give an in-depth study of their basic and specific properties in either parallel or contrast to the Abelian groups with all proper…

We study connections between the topology of generic character varieties of fundamental groups of punctured Riemann surfaces, Macdonald polynomials, quiver representations, Hilbert schemes on surfaces, modular forms and multiplicities in…

We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…

Continuous vector representations of words and objects appear to carry surprisingly rich semantic content. In this paper, we advance both the conceptual and theoretical understanding of word embeddings in three ways. First, we ground…

An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…

A finite set can be supplied with a group structure which can then be used to select (classes of) differential calculi on it via the notions of left-, right- and bicovariance. A corresponding framework has been developed by Woronowicz, more…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We characterize charmenability among arithmetic groups and deduce dichotomy statements pertaining normal subgroups, characters, dynamics, representations and associated operator algebras. We do this by studying the stationary dynamics on…