Related papers: On the group of alternating colored permutations

Let $G \leq \mathrm{Sym} (X)$ for a countable set $X$. Call a colouring of $X$ asymmetric, if the identity is the only element of $G$ which preserves all colours. The motion (also called minimal degree) of $G$ is the minimal number of…

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…

In a recent paper, Bacher and de la Harpe study conjugacy growth series of infinite permutation groups and their relationships with $p(n)$, the partition function, and $p(n)_{\textbf{e}}$, a generalized partition function. They prove…

For a finite group $G,$ we define the concept of $G$-partial permutation and use it to show that the structure coefficients of the center of the wreath product $G\wr \mathcal{S}_n$ algebra are polynomials in $n$ with non-negative integer…

A ballot permutation is a permutation {\pi} such that in any prefix of {\pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)},…

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

Let $R(n,k)$ denote the number of permutations of ${1,2,...,n}$ with $k$ alternating runs. In this note we present an explicit formula for the numbers $R(n,k)$.

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…

Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler's exponential generating function formula for the Eulerian numbers. They are defined via the symmetric group, and applying the…

Let $\mathcal{S}$ be a sequence of finite perfect transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated wreath product in product action of the groups in $\mathcal{S}$ is…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

We prove an explicit formula for the tail of the colored Jones polynomial for a class of arborescent links in terms of a product of theta functions and/or false theta functions. We also provide numerical evidence towards a classification of…

Let A_n be the alternating group on n letters. For n>5, we describe the elements alpha, beta in A_n when alpha^{A_n} beta^{A_n} is the union of at most four distinct conjugacy classes.

We introduce a notion of a length function exponentially distorted on a (compactly generated) subgroup of a locally compact group. We prove that for a connected linear complex Lie group there is a maximum equivalence class of length…

A table of the families of alternating knots formed by conways is presented. The Conway's function is shown with the use of linear algebra in terms of natural numbers, called conways, that represent the number of crossings along a…

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

We introduce the notion of iterated group extensions, which, roughly speaking, is what one obtains by forming a group extension of a group extension. We interpret iterated extensions in terms of group cohomology, in the same way as…