Related papers: Identifying Cartesian decompositions preserved by …
We investigate the notion of $k$-transitivity for the quantum permutation groups $G\subset S_N^+$, with a brief review of the known $k=1,2$ results, and with a study of what happens at $k\geq3$. We discuss then matrix modelling questions…
The finite sharply $2$-transitive groups were classified by Zassenhaus in the 1930's. They essentially all look like the group of affine linear transformations $x\mapsto ax+b$ for some field (or at least near-field) $K$. However, the…
The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…
We start with definitions of the general notions of the theory of $\Bbb Z_{2}$-graded algebras. Then we consider theory of inductive families of $\Bbb Z_{2}$-graded semisimple finite-dimensional algebras and its representations in the…
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
We show that the universal theory of torsion groups is strongly contained in the universal theory of finite groups. This answers a question of Dyson. We also prove that the universal theory of some natural classes of torsion groups is…
We describe a decomposition of the Lie group of unitary evolutions for a bipartite quantum system of arbitrary dimensions. The decomposition is based on a recursive procedure which systematically uses the Cartan classification of the…
In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…
In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.
In this paper, we showed how a group acting regularly and a diagonal group are embedded into the wreath products in there product action using the Cartesian Decomposition.
We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…
We give a brief overview of the current state of the study of the deformation theory of Kleinian groups. The topics covered include the definition of the deformation space of a Kleinian group and of several important subspaces; a discussion…
We present a novel, universal description of quantum entanglement using group theory and generalized characteristic functions. It leads to new reformulations of the separability problem, and the positivity of partial transpose (PPT)…
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
We investigate the proportion of fixed point free permutations (derangements) in finite transitive permutation groups. This article is the first in a series where we prove a conjecture of Shalev that the proportion of such elements is…
The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…
A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…
Gaussian quantum Markov semigroups (GQMSs) are of fundamental importance in modelling the evolution of several quantum systems. Moreover, they represent the noncommutative generalization of classical Orsntein-Uhlenbeck semigroups;…
We extend the so-called retract relation given in [6] for involutive set-theoretic solutions of the Pentagon Equation and we introduce the notion of associated permutation group to study the family of the commutative non-degenerate ones.…