Related papers: Statistics on Wreath Products
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…
An original regular approach to constructing special type symmetries for boundary value problems, namely renormgroup symmetries, is presented. Different methods of calculating these symmetries, based on modern group analysis are described.…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
In this note we define a generalization of Hall-Littlewood symmetric functions using formal group law and give an elementary proof of the generating function formula for the generalized Hall-Littlewood symmetric functions. We also give some…
The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…
The degree of commutativity of a finite group is the probability that two uniformly and randomly chosen elements commute. This notion extends naturally to finitely generated groups $G$: the degree of commutativity $\text{dc}_S(G)$, with…
In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…
We examine the distribution and popularity of different parameters (such as the number of descents, runs, valleys, peaks, right-to-left minima, and more) on the sets of increasing and flattened permutations. For each parameter, we provide…
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…
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…
In 2013, Beck and Braun proved and generalized multiple identities involving permutation statistics via discrete geometry. Namely, they recognized the identities as specializations of integer point transform identities for certain…
We introduce a new construction of matrix wreath products of algebras that is similar to wreath products of groups. We then use it to prove embedding theorems for Jacobson radical, nil, and primitive algebras. In \S\ref{Section6}, we…
Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…
Mark Haiman has reduced Macdonald positivity conjecture to a statement about geometry of the Hilbert scheme of points on the plane, and formulated a generalization of the conjectures where the symmetric group is replaced by the wreath…
We give a modular branching rule for certain wreath products as a generalization of Kleshchev's modular branching rule for the symmetric groups. Our result contains a modular branching rule for the complex reflection groups $G(m,1,n)$…
A generalized Catalan matrix $(a_{n,k})_{n,k\ge 0}$ is generated by two seed sequences $\mathbf{s}=(s_0,s_1,\ldots)$ and $\mathbf{t}=(t_1,t_2,\ldots)$ together with a recurrence relation. By taking $s_\ell=2\ell+1$ and $t_\ell=\ell^2$ we…
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…
We introduce a general class of generating functionals for the calculation of quantum-mechanical expectation values of arbitrary functionals of fluctuating paths with fixed end points in configuration or momentum space. The generating…
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…