Related papers: Depth in classical Coexter groups

An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chv\'atal and Hammer, as well as by Henderson and Zalcstein in 1977. A threshold graph is obtained from a…

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

Let X be a building of uniform thickness q+1. L^2-Betti numbers of X are reinterpreted as von-Neumann dimensions of weighted L^2-cohomology of the underlying Coxeter group. The dimension is measured with the help of the Hecke algebra. The…

We construct a categorification of the braid groups associated with Coxeter groups inside the homotopy category of Soergel's bimodules. Classical actions of braid groups on triangulated categories should come from an action of this monoidal…

Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the…

We develop a combinatorial theory of vector bundles with connection on locally ordered simplicial complexes. This is a first step towards a discrete exterior calculus for bundle-valued forms. The basic building block is the discrete…

In this paper, we show that any Coxeter graph which defines a higher rank Coxeter group must have disjoint induced subgraphs each of which defines a hyperbolic or higher rank Coxeter group. We then use this result to demonstrate several…

We derive presentations of the interval groups related to all quasi-Coxeter elements in the Coxeter group of type $D_n$. Type $D_n$ is the only infinite family of finite Coxeter groups that admits proper quasi-Coxeter elements. The…

We give a geometric proof that minimal length elements in a (twisted) conjugacy class of a finite Coxeter group $W$ have remarkable properties with respect to conjugation, taking powers in the associated Braid group and taking centralizer…

Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid $R\rightrightarrows X$ with finite stabilizer to be the length of…

The descent algebra of a finite Coxeter group W is a subalgebra of the group algebra defined by Solomon. Descent algebras of symmetric groups have properties that are not shared by other Coxeter groups. For instance, the natural map from…

Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…

We refine Brink's theorem, that the non-reflection part of a reflection centralizer in a Coxeter group W is a free group. We give an explicit set of generators for centralizer, which is finitely generated when W is. And we give a method for…

We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

In this article, we study the relationship between notions of depth for sequences, namely, Bennett's notions of strong and weak depth, and deep $\Pi^0_1$ classes, introduced by the authors and motivated by previous work of Levin. For the…

Hecke-Hopf algebras were defined by A. Berenstein and D. Kazhdan. We give an explicit presentation of an Hecke-Hopf algebra when the parameter $m_{ij},$ associated to any two distinct vertices $i$ and $j$ in the presentation of a Coxeter…

In this paper we provide an account of the Todd-Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd-Coxeter…

In this paper we give a characterization of both Boolean and arithmetic circuit classes of logarithmic depth in the vein of descriptive complexity theory, i.e., the Boolean classes $\textrm{NC}^1$, $\textrm{SAC}^1$ and $\textrm{AC}^1$ as…

We present new efficient data structures for elements of Coxeter groups of type $A_m$ and their associated Iwahori--Hecke algebras $H(A_m)$. Usually, elements of $H(A_m)$ are represented as simple coefficient list of length $M = (m+1)!$…