Related papers: Depth in classical Coexter groups

In [Journal of Pure and Applied Algebra {224} (2020), no 12, 106449], V. Mazorchuk and R. Mr{\dj}en (with some help by A. Hultman) prove that, given a Weyl group, the intersection of a Bruhat interval with a parabolic coset has a unique…

Chapuy and Stump have given a nice generating series for the number of factorisations of a Coxeter element as a product of reflections. Their method is to evaluate case by case a character-theoretic expression. The goal of this note is to…

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of a finite Coxeter group $W$ acting on the $p$th graded component of its Orlik-Solomon algebra as a sum of characters induced from linear…

In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly…

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…

We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…

Depth is a concept that measures the `centrality' of a point in a given data cloud or in a given probability distribution. Every depth defines a family of so-called trimmed regions. For statistical applications it is desirable that with…

Co-clustering is a specific type of clustering that addresses the problem of finding groups of objects without necessarily considering all attributes. This technique has shown to have more consistent results in high-dimensional sparse data…

Using the geometry of the associated Calogero-Moser space, R. Rouquier and the author have attached to any finite complex reflection group $W$ several notions (Calogero-Moser left, right or two-sided cells, Calogero-Moser cellular…

We prove the dichotomy that every Coxeter group either has a strongly solid group von Neumann algebra or contains the product of an infinite cyclic group and a free group of rank 2. This generalizes the same dichotomy for right-angled…

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…

The Green ring of the half quantum group $H=U_n(q)$ is computed in [Chen, Van Oystaeyen, Zhang]. The tensor product formulas between indecomposables may be used for a generalized subgroup depth computation in the setting of quantum groups…

During the past two decades there has been a lot of interest in developing statistical depth notions that generalize the univariate concept of ranking to multivariate data. The notion of depth has also been extended to regression models and…

Motivated by recently discovered connections between matroid depth measures and block-structured integer programming [ICALP 2020, 2022], we undertake a systematic study of recursive depth parameters for matrices and matroids, aiming to…

A depth two extension $A \| B$ is shown to be weak depth two over its double centralizer $V_A(V_A(B))$ if this is separable over $B$. We consider various examples and non-examples of depth one and two properties. Depth two and its…

We present an algorithm to estimate depth in dynamic video scenes. We propose to learn and infer depth in videos from appearance, motion, occlusion boundaries, and geometric context of the scene. Using our method, depth can be estimated…

This is the first of a series of papers which define and study structures called rootoids, which are groupoids equipped with a representation in the category of Boolean rings and with an associated 1-cocycle. The axioms for rootoids are…

Graph products of cyclic groups and Coxeter groups are two families of groups that are defined by labeled graphs. The family of Dyer groups contains these both families and gives us a framework to study these groups in a unified way. This…