Related papers: Primitivity rank for random elements in free group…

Let $X(\RR)$ be a geometrically connected variety defined over $\RR$ and such that the set of all its (also complex) points $X(\CC)$ is non-degenerate. We introduce the notion of \emph{admissible rank} of a point $P$ with respect to $X$ to…

We investigate whether an arbitrary non-zero $\mathbb{E}_\infty$-ring $A$ admits a reduced point, meaning an $\mathbb{E}_\infty$-map $A\to T$ such that $\pi_{\ast}T$ is a graded field. We show that if $2\in \pi_0A$ is not invertible, then…

A group has normal rank (or weight) greater than one if no single element normally generates the group. The Wiegold problem from 1976 asks about the existence of a finitely generated perfect group of normal rank greater than one. We show…

Every word $w$ in a free group naturally induces a probability measure on every compact group $G$. For example, if $w=\left[x,y\right]$ is the commutator word, a random element sampled by the $w$-measure is given by the commutator…

An element $\alpha \in \mathbb F_{q^n}$ is \emph{normal} if $\mathcal{B} = \{\alpha, \alpha^q, \ldots, \alpha^{q^{n-1}}\}$ forms a basis of $\mathbb F_{q^n}$ as a vector space over $\mathbb F_{q}$; in this case, $\mathcal{B}$ is a normal…

Let $\Omega$ be a set of cardinality $n$, $G$ a permutation group on $\Omega$, and $f:\Omega\to\Omega$ a map which is not a permutation. We say that $G$ synchronizes $f$ if the semigroup $\langle G,f\rangle$ contains a constant map. The…

The Andrews-Curtis conjecture remains one of the outstanding open problems in combinatorial group theory. It claims that every normally generating $r$-tuple of a free group $F_r$ of rank $r\geq 2$ can be reduced to a basis by means of…

In the algebraic theory of codes and formal languages, the set $Q$ of all primitive words over some alphabet $\zi $ has received special interest. With this survey article we give an overview about relevant research to this topic during the…

We give an elementary classification and presentation of the finite quaternionic reflection groups of rank two, based on the notion of a``reflection system''. This simplifies the existing classification, which is shown to be incomplete,…

The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem turned out to be hard, and so far it has been settled only…

Given a Kaehler group $G$ and a primitive class $\phi \in H^1(G;Z)$, we show that the rank gradient of $(G;\phi)$ is zero if and only if Ker $\phi$ is finitely generated. Using this approach, we give a quick proof of the fact (originally…

Let G be an infinite group and let h and g be elements. We say that h is a root of g if some integer power of h is equal to g. We define K(G) to be the subgroup of all elements of G for which the number of elements which are not roots is of…

In this note we give a new proof of the fact that an elementary subgroup (in the sense of first-order theory) of a non abelian free group $\mathbb{F}$ must be a free factor. The proof is based on definability of orbits of elements of under…

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial…

Let $\mathfrak{H}$ be a Fitting class and $\mathfrak{F}$ a formation. We call a subgroup $\mathcal{N}_{\mathfrak{H},\mathfrak{F}}(G)$ of a finite group $G$ the $\mathfrak{H}$-$\mathfrak{F}$-norm of $G$ if…

Let $F$ be either a free nilpotent group of a given class and of finite rank or a free solvable group of a certain derived length and of finite rank. We show precisely which ones have the $R_{\infty}$ property. Finally, we also show that…

In \cite{KSS06} it was shown that with respect to the simple non-backtracking random walk on the free group $F_N=F(a_1,\dots,a_N)$ the Whitehead algorithm has strongly linear time generic-case complexity and that "generic" elements of $F_N$…

We give a brief survey of primitivity in ring theory and in particular look at characterizations of primitive ideals in the prime spectrum for various classes of rings.