Related papers: On the probability that two elements of a finite s…
In this paper we deal with the following problem: how does the structure of a finite semigroup $S$ depend on the probability that two elements selected at random from $S$, with replacement, define the same inner right translation of $S$. We…
In this paper we study the probability that the commutator of a randomly chosen pair of elements, one from a subring of a finite ring and other from the ring itself equals to a given element of the ring.
We study the probability that the product of two randomly chosen elements in a finite ring $R$ is equal to some fixed element $x \in R$. We calculate this probability for semisimple rings and some special classes of local rings, and find…
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with…
The aim of this paper is to study the probability that the commutator of an arbitrarily chosen pair of elements, each from two different subrings of a finite non-commutative ring equals a given element of that ring. We obtain several…
Let $R$ be a finite ring and $r \in R$. The aim of this paper is to study the probability that the commutator of a randomly chosen pair of elements of $R$ equals $r$.
We study the probability of a given element, in the commutator subgroup of a group, to be equal to a commutator of two randomly chosen group elements, and compute explicit formulas for calculating this probability for some interesting…
The binary products of right, left or double division in semigroups that are semilattices of groups give interesting groupoid structures that are in one to one correspondence with semigroups that are semilattices of groups. This work is…
In this paper, we consider the probability that a randomly chosen automorphism of a finite group fixes a randomly chosen element of a subgroup of that group. We obtain several new results as well as generalizations and improvements of some…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
For subsets X,Y of a finite group G, we write Pr(X,Y) for the probability that two random elements x in X and y in Y commute. This paper addresses the relation between the structure of an approximate subgroup A of G and the probabilities…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…
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…
A regular ordered semigroup $S$ is called right inverse if every principal left ideal of $S$ is generated by an $\mathcal{R}$-unique ordered idempotent. Here we explore the theory of right inverse ordered semigroups. We show that a regular…
We show that the set of all commuting probabilities in finite rings is a subset of the set of all commuting probabilities in finite nilpotent groups of class $\le2$. We believe that these two sets are equal; we prove they are equal, when…
Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.
The probability that a randomly chosen element of a finite group is an $r$--th root (for any integer $r\geq2$) has been studied largely in case $r=2$. Certain techniques may be generalized for $r>2$ and here we find the exact value of this…