Related papers: Statistics on the multi-colored permutation groups
The $k$-arrangements are permutations whose fixed points are $k$-colored. We prove enumerative results related to statistics and patterns on $k$-arrangements, confirming several conjectures by Blitvi\'c and Steingr\'imsson. In particular,…
We prove that the pair of statistics (des,maj) on multiset permutations is equidistributed with the pair (stc,inv) on certain quotients of the symmetric group. We define the analogue of the statistic stc on multiset permutations, whose…
The group classification of a class of variable coefficient reaction-diffusion equations with exponential nonlinearities is carried out up to both the equivalence generated by the corresponding generalized equivalence group and the general…
A method is presented that allows exact calculations of fragment multiplicity distributions for a canonical ensemble of non-interacting clusters. Fragmentation properties are shown to depend on only a few parameters. Fragments are shown to…
The elements in the hyperoctahedral group $\mathfrak{B}_n$ can be treated as signed permutations with the natural order $\cdots<-2<-1<0<1<2<\cdots$, or as colored permutations with the $r$-order $-1<_r-2<_r\cdots<_r0<_r1<_r2<_r\cdots$. For…
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…
We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…
Consider the regular representation of the sum over all permutations weighted by the sum of their descent, inversion, and fixed point multinomials. We compute the spectrum and the multiplicities of its elements of that matrix. Note that…
An $(X,Y)$-descent in a permutation is a pair of adjacent elements such that the first element is from $X$, the second element is from $Y$, and the first element is greater than the second one. An $(X,Y)$-adjacency in a permutation is a…
In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…
We compute the bi-free max-convolution which is the operation on bi-variate distribution functions corresponding to the max-operation with respect to the spectral order on bi-free bi-partite two-faced pairs of hermitian non-commutative…
Given a permutation statistic $\operatorname{st}$, define its inverse statistic $\operatorname{ist}$ by $\operatorname{ist}(\pi):=\operatorname{st}(\pi^{-1})$. We give a general approach, based on the theory of symmetric functions, for…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
In this paper, for a finite group, we discuss a method for calculating equivariant homology with constant coefficients. We apply it to completely calculate the geometric fixed points of the equivariant spectrum representing equivariant…
The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…
The Ewens sampling formula with parameter $\alpha$ is the distribution on $S_n$ which gives each $\pi\in S_n$ weight proportional to $\alpha^{C(\pi)}$, where $C(\pi)$ is the number of cycles of $\pi$. We show that, for any fixed $\alpha$,…
We discuss the classical statement of group classification problem and some its extensions in the general case. After that, we carry out the complete extended group classification for a class of (1+1)-dimensional nonlinear…
We prove the exponential growth of product replacement graphs for a large class of groups. Much of our effort is dedicated to the study of product replacement graphs of Grigorchuk groups, where the problem is most difficult.
We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…