Related papers: On three approaches to conjugacy in semigroups

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

We study conjugacy relations on semigroups and monoids, focusing on the relation $a \cfn b$, defined by the existence of $g,h \in S^1$ such that $ag = gb$, $bh = ha$, $hag = b$, and $gbh = a$. This notion emerged as one that yields…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

There are different notions of homology and cohomology that can be defined for a group with an action of another group by group automorphisms. In this paper we address three natural questions that arise in this context. Namely, the relation…

We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.

In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…

We built some congruences on semigroups, from where a decomposition of quasi-separative semigroups was obtained.

The notion of mixed representations of quivers can be derived from ordinary quiver representations by considering the dual action of groups on "vertex" vector spaces together with the usual action. A generating system for the algebra of…

We discuss the relationship between tight and cover-to-join representations of semilattices and inverse semigroups, showing that a slight extension of the former, together with an appropriate selection of co-domains, makes the two notions…

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

This paper serves as an example to show the way we pass from semigroups to $\Gamma$-semigroups and to hypersemigroups.

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Structures of commuting semigroups of isometries under certain additional assumptions like double commutativity or dual double commutativity are found.

Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

The results on fuzzy ordered semigroups (or on fuzzy semigroups) can be transferred to fuzzy ordered gamma (or to fuzzy gamma) semigroups. We show the way we pass from fuzzy ordered semigroups to fuzzy ordered gamma semigroups.

We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…