Related papers: Permutation of elements in double semigroups
The second author introduced notions of weak permutability and commutativity between groups and proved the finiteness of a group generated by two weakly permutable finite groups. Two groups H,K weakly commute provided there exists a…
We show that indecomposable weak Kac algebras are free over their Cartan subalgebras and prove a duality theorem for their actions. Using this result, for any biconnected weak Kac algebra we construct a minimal action on the hyperfinite…
The factorization number $F_2(G)$ of a finite group $G$ is the number of all possible factorizations of $G=HK$ as product of its subgroups $H$ and $K$, while the subgroup commutativity degree $\mathrm{sd}(G)$ of $G$ is the probability of…
An interchange ring,(R,+,*)is an abelian group with a second binary operation defined so that the interchange law (x+y)*(u+v)=(x*u)+(y*v)holds. An interchange near ring is the same structure based on a group which may not be abelian. It is…
By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group…
The aim of this paper is to see how commuting graphs interact with two semigroup constructions: the zero-union and the direct product. For both semigroup constructions, we investigate the diameter, clique number, girth, chromatic number and…
The relative commutativity degree of a subgroup $H$ of a finite group $G$, denoted by $\Pr(H, G)$, is the probability that an element of $G$ commutes with an element of $H$. In this article we obtain some lower and upper bounds for $\Pr(H,…
In a quaternion order of class number one, an element can be factored in multiple ways depending on the order of the factorization of its reduced norm. The fact that multiplication is not commutative causes an element to induce a…
We introduce two partially overlapping classes of pathwise dualities between interacting particle systems that are based on commutative monoids (semigroups with a neutral element) and semirings, respectively. For interacting particle…
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…
According to a result of Wigner and von Neumann [1], real symmetric matrices with a doubly degenerate lowest eigenvalue form a submanifold of codimension 2 within the space of all real symmetric matrices. This mathematical result has…
The structure of nilpotent symplectic algebras of maximal class has been studied in [8, 5]. In this paper, we study the dual subclass of algebras of minimal class. In particular, we show that symplectic alternating algebras of dimension up…
This paper enriches the list of known properties of congruence sequences starting from the universal relation and successively performing the operators lower $k$ and lower $t$. Two series of inverse semigroups, namely…
The Clifford hierarchy is a fundamental structure in quantum computation, classifying unitary operators based on their commutation relations with the Pauli group. Despite its significance, the mathematical structure of the hierarchy is not…
In this note we give some new results concerning the subgroup commutativity degree of a finite group $G$. These are obtained by considering the minimum of subgroup commutativity degrees of all sections of $G$.
Let ${\mathfrak p}\subset {\mathfrak g}$ be a parabolic subalgebra of s simple finite dimensional Lie algebra over ${\mathbb C}$. To each pair $w^{\mathfrak a}\leq w^{\mathfrak c}$ of minimal left coset representatives in the quotient space…
This paper introduces two operations in quiver gauge theories. The first operation takes a quiver with a permutation symmetry $S_n$ and gives a quiver with adjoint loops. The corresponding 3d $\mathcal{N}=4$ Coulomb branches are related by…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
In this work, we introduce the \emph{interval permutation segment (IP-SEG)} model that naturally generalizes the geometric intersection models of interval and permutation graphs. We study properties of two graph classes that arise from the…