Related papers: A note on words having the same image on finite gr…

We explore residually finite and profinite quandles. We prove that the endomorphism monoid and the automorphism group of finitely generated residually finite quandles are residually finite. In fact, we establish the similar result for a…

Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite…

We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

In this paper we derive necessary and sufficient homological and cohomological conditions for profinite groups and modules to be of type $\operatorname{FP}_n$ over a profinite ring $R$, analogous to the Bieri-Eckmann criteria for abstract…

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

We prove that every finite direct product of crystallographic groups arising from an irreducible root system (in the sense of Lie theory) is profinitely rigid (equiv. first-order rigid). This is a generalization of recent proofs of…

In this article, we address Amit--Ashurst conjecture on lower bounds of a probability distribution associated to a word on a finite nilpotent group. We obtain an extension of a result of Camina, Iniguez, and Thillaisundaram by providing…

The structure of finite and locally finite groups in which every element has prime power order (CP-groups) is well known. In this paper we note that the combination of our earlier results with the available information on the structure of…

Let $\Gamma$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $\Gamma$ is abstractly…

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…

We study pairs of non-constant maps between two integral schemes of finite type over two (possibly different) fields of positive characteristic. When the target is quasi-affine, Tamagawa showed that the two maps are equal up to a power of…

The goal of this article is to prove a rigidity result for unicritical polynomials with parabolic cycles. More precisely, we show that if two unicritical polynomials have conformally conjugate parabolic germs, then the polynomials are…

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…

We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…

We prove:(1) the existence, for every integer n > 3, of a noncompact smooth n-dimensional topological manifold whose diffeomorphism group contains an isomorphic copy of every finitely presented group; (2) a finiteness theorem on finite…

Profinite congruences on profinite algebras determining profinite quotients are difficult to describe. In particular, no constructive description is known of the least profinite congruence containing a given binary relation on the algebra.…