Related papers: Statistics on Wreath Products

A new characterization for power function distributions is obtained which is based on products of order statistics. This result may be considered as a generalization of some recent results for contractions. We note that in this new result…

We study the full counting statistics of current of large open systems through the application of random matrix theory to transition-rate matrices. We develop a method for calculating the ensemble-averaged current-cumulant generating…

We show that there are hereditarily just infinite groups of any subgroup growth type between $n$ and $n^{\log n}$. This is obtained calculating the subgroup growth type of a family of hereditarily just infinite profinite groups obtained via…

The concept of exchange braid statistics is generalized. The cross statistics is studied as a result of interaction. An algebraic model of a system of particles equipped with such statistics is described. The corresponding Fock space…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

We prove conjectures of the third author [L. Tevlin, Proc. FPSAC'07, Tianjin] on two new bases of noncommutative symmetric functions: the transition matrices from the ribbon basis have nonnegative integral coefficients. This is done by…

Working in the setting of Deligne categories, we generalize a result of Marin that hooks generate the representation ring of symmetric groups to wreath products of symmetric groups with a fixed finite group or Hopf algebra. In particular,…

These are introductory notes on word growth of groups, and include a gentle presentation of wreath products as well as recent results on construction of groups of with given growth function. They are are an expanded version of a mini-course…

Let G1, G2, ... be a sequence of almost simple groups and construct a sequence (Wi) of wreath products via W1 = G1 and, for each i > 1, Wi+1 = Gi+1 wr Wi via the regular action of each Gi. We determine the minimum number d(Wi) of generators…

Correctly capturing the symmetry transformations of data can lead to efficient models with strong generalization capabilities, though methods incorporating symmetries often require prior knowledge. While recent advancements have been made…

Both the higher energy and the initial state colored partons contribute to making exact calculations in QCD color space more important at the LHC than at its predecessors. This is applicable whether the method of assessing QCD is fixed…

We present generating functions for extensions of multiplicative invariants of wreath symmetric products of orbifolds presented as the quotient by the locally free action of a compact, connected Lie group in terms of orbifold sector…

The action of a finite reflection group (type A) on its set of roots is understood as a permutation representation or group action. We show that this representation is an induced representation from a certain kind of parabolic subgroup.…

We define wreath products of cocommutative Hopf algebras, and show that they enjoy a universal property of classifying cleft extensions, analogous to the Kaloujnine-Krasner theorem for groups. We show that the group ring of a wreath product…

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…

The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions…

We investigate a semigroup construction generalising the two-sided wreath product. We develop the foundations of this construction and show that for groups it is isomorphic to the usual wreath product. We also show that it gives a slightly…

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by…

Let $K$ be a number field and $k\geq 2$ be an integer. Let $(n_1,n_2, \dots, n_k)$ be a vector with entries $n_i\in \mathbb{Z}_{\geq 2}$. Given a number field extension $L/K$, we denote by $\widetilde{L}$ the Galois closure of $L$ over $K$.…