Related papers: Wreath Products of Permutation Classes

In this paper we review various strikingly parallel algebraic structures behind Hilbert schemes of points on surfaces and certain finite groups called the wreath products. We explain connections among Hilbert schemes, wreath products,…

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

The irreducible character values of the spin wreath products of the symmetric group and an arbitrary finite group are completely determined.

We present examples of closed subsets of a free group such that their product is not closed in the profinite topology. We discuss how to characterize a subset of a free group which is closed in the profinite topology and its product with…

We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.

Wreath products involving symmetric inverse monoids/semigroups/categories arise in many areas of algebra and science, and presentations by generators and relations are crucial tools in such studies. The current paper finds such…

We recover a 4-dimensional wreath product X as a transversal slice to a nilpotent orbit in sp_6. By using deformations of Springer resolutions, we construct a symplectic deformation of symplectic resolutions of X.

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

This paper is concentrated on the classification of permutation matrix with the permutation similarity relation, mainly about the canonical form of a permutational similar equivalence class, the cycle matrix decomposition of a permutation…

We study the base sizes of finite quasiprimitive permutation groups of twisted wreath type, which are precisely the finite permutation groups with a unique minimal normal subgroup that is also non-abelian, non-simple and regular. Every…

Let $A$ be a nilpotent $p$-group of finite exponent, and $B$ be an abelian $p$-groups of finite exponent. Then the wreath product $A {\rm Wr} B$ generates the variety ${\rm var}(A) {\rm var}(B)$ if and only if the group $B$ contains a…

We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations…

We present methods of calculating statistics generating functions over the colored permutation groups, and generalizing known theorems from the symmetric groups to general colored permutations groups.

A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…

This paper describes an issue that arises when inverting elements of the homotopy groups of an equivariant commutative ring. Equivariant commutative rings possess an enhanced multiplicative structure arising from the presence of "indexed…

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if…

The irreducible spin character values of the wreath products of the hyperoctahedral groups with an arbitrary finite group are determined.

We introduce ring theoretic constructions that are similar to the construction of wreath product of groups. In particular, for a given graph $\Gamma=(V,E)$ and an associate algebra $A,$ we construct an algebra $B=A\, wr\, L(\Gamma)$ with…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.