Related papers: On Primitive Words I: A New Algorithm

This article provides a reminder of some properties of primitive words and the morphisms that preserve them. Their proofs, which I have more or less revised, are included. This makes the article almost self-contained. I also contribute by…

The so called $k$-normal elements appear in the literature as a generalization of normal elements over finite fields. Recently, questions concerning the construction of $k$-normal elements and the existence of $k$-normal elements that are…

Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist…

Let $H$ be a subgroup of a group $G$. We say that $H$ satisfies the power condition with respect to $G$, or $H$ is a power subgroup of $G$, if there exists a non-negative integer $m$ such that $H=G^{m}=<g^{m} | g \in G >$. In this note, the…

Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

Let $F$ be a free non-abelian group. We show that for any group word $w$ the set $w[F]$ of all values of $w$ in $F$ is rational in $F$ if and only if $w[F] = 1$ or $w[F] = F.$ We generalize this to a wide class of free products of groups.

Consider a diagram $\cdots \to F_3 \to F_2\to F_1$ of algebraic systems, where $F_n$ denotes the free object on $n$ generators and the connecting maps send the extra generator to some distinguished trivial element. We prove that (a) if the…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \mathscr L $-$ \Pi $-property in $ G $ if $ H\unlhd G $, or if $ | G / K : \mathrm{N} _{G / K} (HK/K)| $ is a $ \pi (HK/K) $-number for any $ G…

We study primitive elements in the Ringel-Hall algebra H(A) of an algebra A over a finite field associated with a quiver with automorphism. When A is a tame hereditary algebra, we give a description of primitive elements in H(A) which…

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G|…

Given a group-word w and a group G, the verbal subgroup w(G) is the one generated by all w-values in G. The word w is called concise if w(G) is finite whenever the set of w-values in G is finite. It is an open question whether every word is…

The depth of a subgroup $H$ of a finite group $G$ is a positive integer defined with respect to the inclusion of the corresponding complex group algebras $\mathbb{C}H \subseteq \mathbb{C}G$. This notion was originally introduced by Boltje,…

For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…

We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…

We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a…

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

Motivated by the orthogonality relations for irreducible characters of a finite group, we evaluate the sum of a finite group of linear characters of a Hopf algebra, at all grouplike and skew-primitive elements. We then discuss results for…