Results 1 to 10 of about 336 (177)
Discrete Mathematics & Theoretical Computer Science, 2004 Motivated by the Coxeter complex associated to a Coxeter system (W,S), we introduce a simplicial regular cell complex Δ(G,S) with a G-action associated to any pair (G,S) where G is a group and S is a finite set of generators for G which is ...
Eric Babson, Victor Reiner
doaj +2 more sources
On non-conjugate Coxeter elements in well-generated reflection groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Given an irreducible well-generated complex reflection group $W$ with Coxeter number $h$, we call a Coxeter element any regular element (in the sense of Springer) of order $h$ in $W$; this is a slight extension of the most common notion of Coxeter ...
Victor Reiner +2 more
doaj +1 more source
Interval groups related to finite Coxeter groups Part II
Transactions of the London Mathematical Society, 2023 We provide a complete description of the presentations of the interval groups related to quasi‐Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group associated with the ...
Barbara Baumeister +3 more
doaj +1 more source
Parabolic double cosets in Coxeter groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Parabolic subgroups WI of Coxeter systems (W,S) and their ordinary and double cosets W/WI and WI\W/WJ appear in many contexts in combinatorics and Lie theory, including the geometry and topology of generalized flag varieties and the symmetry groups of ...
Sara Billey +4 more
doaj +1 more source
A two-sided analogue of the Coxeter complex [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 For any Coxeter system (W, S) of rank n, we introduce an abstract boolean complex (simplicial poset) of dimension 2n − 1 which contains the Coxeter complex as a relative subcomplex.
T. Kyle Petersen
doaj +1 more source
Kazhdan-Lusztig polynomials of boolean elements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We give closed combinatorial product formulas for Kazhdan–Lusztig poynomials and their parabolic analogue of type $q$ in the case of boolean elements, introduced in [M. Marietti, Boolean elements in Kazhdan–Lusztig theory, J.
Pietro Mongelli
doaj +1 more source
Fully commutative elements and lattice walks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These elements were extensively studied by Stembridge in the finite case.
Riccardo Biagioli +2 more
doaj +1 more source
k-Parabolic Subspace Arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 In this paper, we study k-parabolic arrangements, a generalization of the k-equal arrangement for any finite real reflection group. When k=2, these arrangements correspond to the well-studied Coxeter arrangements.
Christopher Severs, Jacob White
doaj +1 more source
The Sorting Order on a Coxeter Group [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Let $(W,S)$ be an arbitrary Coxeter system. For each sequence $\omega =(\omega_1,\omega_2,\ldots) \in S^{\ast}$ in the generators we define a partial order― called the $\omega \mathsf{-sorting order}$ ―on the set of group elements $W_{\omega} \subseteq W$
Drew Armstrong
doaj +1 more source
Higher Braid Groups and Regular Semigroups from Polyadic-Binary Correspondence
Mathematics, 2021 In this note, we first consider a ternary matrix group related to the von Neumann regular semigroups and to the Artin braid group (in an algebraic way).
Steven Duplij
doaj +1 more source