Related papers: On the group of alternating colored permutations

We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…

In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic permutation group properties. Using Schur's classical…

In this short, elementary note we prove that if a faithful reflection representation of a Coxeter group preserves an orthant, then that Coxeter group is a product of symmetric groups acting on its natural permutation representation. We also…

Let $\gamma_n$ be the permutation on $n$ symbols defined by $\gamma_n = (1\ 2\...\ n)$. We are interested in an enumerative problem on colored permutations, that is permutations $\beta$ of $n$ in which the numbers from 1 to $n$ are colored…

We introduce the notion of "color rules" for computing class functions of $Z_k \wr S_n$, where $Z_k$ is the cyclic group of order $k$ and $S_n$ is the symmetric group on $n$ letters. Using a general sign-reversing involution and a map of…

We construct generalized regular representations of the wreath product of a compact group with the infinite symmetric group. The characters of these representations are determined by probability measures on families of partitions called the…

Wilf showed that the the alternating runs polynomial $R_n(t)$ counting the number of permutations in the Symmetric group is divisible by $(1+t)^m$ where $m = \lfloor (n-2)/2 \rfloor$. Recently, B\'{o}na gave a group action based proof. Type…

In a previous paper, we had proved that the permutation group generated by the round functions of an AES-like cipher is primitive. Here we apply the O'Nan Scott classification of primitive groups to prove that this group is the alternating…

The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…

There were defined by R. Shwartz OGS for non-abelian groups, as an interesting generalization of the basis of finite abelian groups. The definition of OGS states that that every element of a group has a unique presentation as a product of…

We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…

Let $p$ be a fixed prime. For a finite group generated by elements of order $p$, the $p$-width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ elements of order $p$. Let…

The alternating (zigzag) numbers $A_n$, counting the ascending alternating permutations of $\left\{1,\cdots,n\right\}$ and defined by the exponential generating function $\tan x+\sec x$, admit several classical combinatorial and analytic…

We study permutation polynomials through the device of the \emph{polypermutation group} of an associative ring $R$, denoted by ${\rm Pgr}(R)$. We derive some basic properties and compute the cardinality of ${\rm Pgr}(\mathbb{Z}/p^k)$ when…

Given a finite group $G$ acting on a set $X$ let $\delta_k(G,X)$ denote the proportion of elements in $G$ that have exactly $k$ fixed points in $X$. Let $\mathrm{S}_n$ denote the symmetric group acting on $[n]=\{1,2,\dots,n\}$. For…

We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…

Following Mansour, let $S_n^{(r)}$ be the set of all coloured permutations on the symbols $1,2,...,n$ with colours $1,2,...,r$, which is the analogous of the symmetric group when r=1, and the hyperoctahedral group when r=2. Let…

The degree of commutativity of a group $G$ measures the probability of choosing two elements in $G$ which commute. There are many results studying this for finite groups. In [AMV17], this was generalised to infinite groups. In this note, we…

Let $A_n\subseteq S_n$ denote the alternating and the symmetric groups on $1,...,n$. MacMahaon's theorem, about the equi-distribution of the length and the major indices in $S_n$, has received far reaching refinements and generalizations,…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…