Related papers: Flag weak order on wreath products

This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to…

In this paper, we find weak generating sets for a classical W-algebra $\mathcal{W}^k(\mathfrak{g},f)$ when $\mathfrak{g}=\mathfrak{sl}_N$ or $\mathfrak{sl}_{N_1|N_2}$. Furthermore, observing the relation between quantum and classical…

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

Given a weak distributive law between algebras underlying two weak bialgebras, we present sufficient conditions under which the corresponding weak wreath product algebra becomes a weak bialgebra with respect to the tensor product coalgebra…

We prove that groups of the form $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$, where $m,n \in \mathbb N$, are regularly bi-interpretable with $\mathbb Z$ and therefore are first-order rigid: every finitely generated group elementarily equivalent…

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

The article is concerned with the Foulkes characters of wreath products, which are block characters of wreath products, i.e., the positive-definite class functions depending only on the length of its elements. Inspired by the works of…

We apply the method of iterated inflations to show that the wreath product of a cellular algebra with a symmetric group is cellular, and obtain descriptions of the cell and simple modules together with a semisimplicity condition for such…

For a finitely generated regular wreath product, the metric is known, but its computation can be an NP-complete problem. Also, it is not known for the nonregular case. In this article, a metric estimate is defined for regular wreath…

For a restricted wreath product $G\wr \mathbb{Z}^k$, where $G$ is a finite abelian group, we determine (almost in all cases) whether this product has the $R_\infty$ property (i.e., each its automorphism has infinite Reidemeister number).

In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.

Let G be a group which has for all n a finite number r_n(G) of irreducible complex linear representations of dimension n. Let $\zeta(G,s) = \sum_{n=1}^{\infty} r_n(G) n^{-s}$ be its representation zeta function. First, in case G is a…

This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…

Let R be a complete discrete valuation ring with quotient field K, L a finite Galois extension of K with Galois group G and S the integral closure of R in L. In this article, using elements of the monoid Sl(G), the set of semilinear maps of…

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.

The cross section for producing $WZ$ pairs at hadron colliders is calculated to order $\alpha_s$ for general $C$ and $P$ conserving $WWZ$ couplings. The effects of the next-to-leading-order corrections on the derived sensitivity limits for…

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…

Given a quasi-monomial, respectively an almost monomial, group $A$ and a cyclic group $C$ of prime order $p>0$, we show that the wreath product $W=A\wr C$ is quasi-monomial (respectively almost monomial), if certain technical conditions…

The "necklace process", a procedure constructing necklaces of black and white beads by randomly choosing positions to insert new beads (whose color is uniquely determined based on the chosen location), is revisited. This article illustrates…

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…