Related papers: Computing centralizers in [f.g. free]-by-cyclic gr…

Let G be a finite group. An element x in G is a real element if x is conjugate to its inverse in G. For x in G, the conjugacy class x^G is said to be a real conjugacy class if every element of x^G is real. We show that if 4 divides no real…

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

The notion of commutation of operations in universal algebra leads to the concept of centralizer clone and gives rise to a well-known class of problems that we call centralizer problems, in which one seeks to determine whether a given set…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

A conjecture for the dimension and the character of the homogenous components of the free Jordan algebras is proposed. As a support of the conjecture, some numerical evidences are generated by a computer and some new theoretical results are…

We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…

This work investigates the combinatorial structures underlying cyclic conditional freeness and introduces cumulants that serve to linearize the cyclic conditional additive convolution. In the process, we establish the notion of "cyclic…

We obtain a homological characterisation of virtually free-by-cyclic groups among groups that are hyperbolic and virtually compact special. As a consequence, we show that many groups known to be coherent actually possess the stronger…

In this paper, we construct countably many isolated circular orders on the free products $G = F_{2n} \ast \mathbb{Z}_{m_1} \ast \cdots \ast \mathbb{Z}_{m_k}$ of cyclic groups. Moreover, we prove that these isolated circular orders are not…

In this article we study the centralizer of a minimal aperiodic action of a countable group on the Cantor set (an aperiodic minimal Cantor system). We show that any countable residually finite group is the subgroup of the centralizer of…

We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.

A classification of the ways in which an element of a free group can be expressed as a product of commutators or as a product of squares is given. This is then applied to some particular classes of elements. Finally, a question about…

We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…

In this paper we consider centralizers of single elements in Ore extensions of the ring of polynomials in one variable over a field. We show that they are commutative and finitely generated as an algebra. We also show that for certain…

In Chapter 1 we give the basic background and notations. We also give a new characterization of the Conrad property for orderings. In Chapter 2, we use the new characterization of the Conradian property to give a classification of groups…

The subgroup generated by all solvable normal subgroups in a pseudo-finite group with the descending chain condition on centralizers up to finite index is solvable. Additionally, there is no finitely generated pseudo-finite group whose…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

In this paper, we compute the number of distinct centralizers of some classes of finite rings. We then characterize all finite rings with $n$ distinct centralizers for any positive integer $n \leq 5$. Further we give some connections…

This paper proves a number of flatness results for centralizers of sections of a reductive group scheme over a general base scheme. To this end, we establish relative versions of the Jordan decomposition. Using our results, we obtain a…

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…