Related papers: Flag weak order on wreath products
In this paper, we introduce a weak group inverse (called the WG inverse in the present paper) for square matrices of an arbitrary index, and give some of its characterizations and properties. Furthermore, we introduce two orders: one is a…
Motivated by q-shuffle products determined by Singer from q-analogues of multiple zeta values, we build in this article a generalisation of the shuffle and stuffle products in terms of weak shuffle and stuffle products. Then, we…
The (partially) ordered set of the non-trivial zeros of the zeta function with positive imaginary parts is considered. The order is the coordinatewise order inherited from $\mathbb{C}$. Some interesting properties regarding the minimal…
For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…
We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…
We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…
In [BV12] we have proven that, for all hyperbolic groups and for all non-trivial free products $\Gamma$, the left-right wreath product group $G:=(Z/2Z)^{(\Gamma)} \rtimes (\Gamma \times \Gamma)$ is W$^*$-superrigid. In this paper, we extend…
We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of…
We propose an analogue of Solomon's descent theory for the case of a wreath product G ~ S_n, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht's theory for the…
This paper continues the study of the reduced ring order (rr-order) in reduced rings where $a< b$ if $a^2= ab$. A reduced ring is called rr-good if it is a lower semi-lattice in the order. Examples include weakly Baer rings (wB or PP-rings)…
In this article we investigate the primeness of generalized wreath product II$_1$ factors using deformation/rigidity theory techniques. We give general conditions relating tensor decompositions of generalized wreath products to stabilizers…
In 2015, Archdeacon proposed the notion of Heffter arrays in view of its connection to several other combinatorial objects. In the same paper he also presented the following variant. A weak Heffter array $\mathrm{W}\mathrm{H}(m,n;h,k)$ is…
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…
In this article nonassociative metagroups are studied. Different types of smashed products and smashed twisted wreath products are scrutinized. Extensions of central metagroups are studied.
We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n-by-n upper triangular matrices over a given field k, in terms of aperiodic…
It is known that the notion of a transitive subgroup of a permutation group $P$ extends naturally to the subsets of $P$. We study transitive subsets of the wreath product $G \wr S_n$, where $G$ is a finite abelian group. This includes the…
We prove necessary and sufficient conditions for when graph wreath products are residually finite, generalising known results for the permutational wreath product and free product cases.
Various statistics on wreath products are defined via canonical words, "colored" right to left minima and "colored" descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of…
We find some sufficient conditions under which the permutational wreath product of two groups has a minimal generating set. In particular we prove that for a regular rooted tree the group of all automorphisms and the group of all…
A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components…