Related papers: On generalisations of conciseness

Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Let $F$ be a free group of rank $r$ and fix some $w\in F$. For any compact group $G$ we can define a measure $\mu_{w,G}$ on $G$ by (Haar-)uniformly sampling $g_1,...,g_r\in G$ and evaluating $w(g_1,...,g_r)$. In [arXiv:1802.04862], Magee…

Gowers has elegantly characterized the finite groups $G$ in which $A_1A_2A_3 = G$ for any positive density subsets $A_1,A_2,A_3$. This property, quasi-randomness, holds if and only if G does not admit a nontrivial irreducible representation…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

We introduce a new framework linking group theory and formal language theory which generalizes a number of ways these topics have been linked in the past. For a language class C in the Chomsky hierarchy, we say a group is epiC if it admits…

We prove that a random group, in Gromov's density model with $d < 1/16$ satisfies with overwhelming probability a universal-existential first-order sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

We show that any one-relator group $G=F/\langle\langle w\rangle\rangle$ with torsion is coherent -- i.e., that every finitely generated subgroup of $G$ is finitely presented -- answering a 1974 question of Baumslag in this case.

We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…

In 2005, Rampersad and the second author proved a number of theorems about infinite words x with the property that if w is any sufficiently long finite factor of x, then its reversal w^R is not a factor of x. In this note we revisit these…

A finitely generated group $\G$ equipped with a word-length is said to satisfy property RD if there are $C, s\geq 0$ such that, for all non-negative integers $n$, we have $\|a\|\leq C (1+n)^s \|a\|_2$ whenever $a\in\C\G$ is supported on…

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

The coprime commutators $\gamma_j^*$ and $\delta_j^*$ were recently introduced as a tool to study properties of finite groups that can be expressed in terms of commutators of elements of coprime orders. They are defined as follows. Let $G$…

Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =<x_1,...,x_n>$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{w (g_1,...,g_n)^{\pm 1} | g_i \in…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

We prove two results. (1) There is an absolute constant $D$ such that for any finite quasisimple group $S$, given 2D arbitrary automorphisms of $S$, every element of $S$ is equal to a product of $D$ `twisted commutators' defined by the…

This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…