Related papers: Conciseness on normal subgroups and new concise wo…

This paper (cmp-lg/yymmnnn) has been accepted for publication in the student session of EACL-95. It outlines ongoing work using statistical and unsupervised neural network methods for clustering words in untagged corpora. Such approaches…

We investigate the problem of the maximum number of cubic subwords (of the form $www$) in a given word. We also consider square subwords (of the form $ww$). The problem of the maximum number of squares in a word is not well understood.…

Let $G$ be a finite group. A coprime commutator in $G$ is any element that can be written as a commutator $[x,y]$ for suitable $x,y\in G$ such that $\pi(x)\cap\pi(y)=\emptyset$. Here $\pi(g)$ denotes the set of prime divisors of the order…

A uniform space $X$ is said to be proximally fine if every proximally continuous map on $X$ into a uniform is uniformly continuous. We supply a proof that every topological group which is functionnaly generated by its precompact subsets is…

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients:…

Let $G$ be a group. Write $G^{*}=G\setminus \{1\}$. An element $x$ of $G^{*}$ will be called deficient if $ \langle x\rangle < C_G(x)$ and it will be called non-deficient if $\langle x\rangle = C_G(x).$ If $x\in G$ is deficient…

Let $F$ be a non-Abelian free group with basis $A$, $M$ and $N$ be the normal closures of sets $R_M$ and $R_N$ of words in the alphabet $A^{\pm 1}$. As is known, the group $F/[N, N]$ is torsion-free, but, in general, torsion in $F/[M, N]$…

It is well known that the set of values of a lower central word in a group $G$ need not be a subgroup. For a fixed lower central word $\gamma_r$ and for $p\ge 5$, Guralnick showed that if $G$ is a finite $p$-group such that the verbal…

We show that if $G$ is a non-elementary torsion-free word hyperbolic group then there exists another word hyperbolic group $G^*$, such that $G$ is a subgroup of $G^*$ but $G$ is not quasiconvex in $G^*$.

We show that an element w of a free group F on n generators defines a surjective word map of PSL(2,C)^n onto PSL(2,C) unless w belongs to the second derived subgroup of F. We also describe certain words maps that are surjective on SL(2,C) x…

A word equation with one variable in a free group is given as $U = V$, where both $U$ and $V$ are words over the alphabet of generators of the free group and $X, X^{-1}$, for a fixed variable $X$. An element of the free group is a solution…

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…

Among compact Hausdorff groups G whose maximal profinite quotient is finitely generated, we characterize those that possess a proper dense normal subgroup. We also prove that the abstract commutator subgroup [H,G] is closed for every closed…

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

We prove that every word is strongly concise in the class of compact $R$-analytic groups.

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$. In the case of infinite words, the value of a run is…

A finite word $w$ with $\vert w\vert=n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called \emph{rich}. Let $\Factor(w)$ be the set of factors of the word $w$. It is known that there…

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…