Combinatorics of Coxeter Groups
By Anders Björner, Francesco Brenti. 2005
1,884 citations recorded by the source corpus.
I.- The basics.- Bruhat order.- Weak order and reduced words.- Roots, games, and automata.- II.- Kazhdan-Lusztig and R-polynomials.- Kazhdan-Lusztig representations.- Enumeration.- Combinatorial Descriptions.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/1f3bd946e1ca17d97af96486e7c00f42b37623b7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Nathan Reading
- Christos A. Athanasiadis
- David E. Speyer
- Ben Steinberg
- Jorge Almeida
- Tom D. Brady
- June Huh
- Lauren K. Williams
In Discrete Mathematics and Combinatorics
- Hugh Thomas
- David E. Speyer
- Drew Armstrong
- Nathan Reading
- Alexander Yong
- I. Reiten
- Thomas Lam
- Leonardo Constantin Mihalcea
In Electrical and Electronic Engineering
- Drew Armstrong
- Colum Watt
- Thomas Lam
- David E. Speyer
- June Huh
- Mireille Bousquet-M'elou
- Lauren K. Williams
- Tom D. Brady
Citations in the corpus
- Auslander–Reiten theory revisited (2008, background): “The Coxeter group W [31] of Q is a group presented by generators s1, · · · , sn with relations (a) s(2)i = 1, for any i; (b) sisj = sjsi, if there is no arrow in Q between i and j; (c) sisjsi = sjsisj , if there is exactly one arrow in Q between i and j.”
- Some problems on Cayley graphs (2008, background): “These transpositions ti,i+1 are 2-cycles interchanging i and i + 1, and they also known as the set of the n − 1 Coxeter generators of Symn (for details see [15]).”
- On Regular Polytopes (2012, background): “In particular, we may refer here to some pertinent work by Coxeter ([1, 3]), [4] and the recent book [5]).”
- GOVERNING SINGULARITIES OF SCHUBERT VARIETIES (2006, background): “=Pu,v(q). Lusztig’s interval conjecture asserts that Pa,b(q)=Pv,w(q)whenever the Bruhat order intervals [a,b]and [v,w]are isomorphic as posets; this conjecture is discussed with further references in [6, 7]. Corollary 6.3 confirms a new (albeit, very special) case of the conjecture. Example 6.4. Ordi”
- Total positivity for cominuscule Grassmannians (2007, background): “It is well known [2] that Dn Weyl group elements can be identified as signed permutations on the 2n letters {±1,±2, .”
- Generalized Noncrossing Partitions and Combinatorics of Coxeter Groups (2006, methodology): “This material is classical and it may be found in Björner and Brenti [29].”
- Fomin-Zelevinsky mutation and tilting modules over Calabi-Yau algebras (2006, methodology): “So let us recall the Bruhat order ≤, right order ≤R and left order ≤L on W [BB] (≤R is called a weak order in [Hu]).”
- Gröbner–Shirshov bases and their calculation (2013, background): “ebras over k). Lie GS bases for these algebras are found in [49, 50, 51]. •The Coxeter group W = sgphS|s2 i = 1, mij(si,sj) = mji(sj,si)i for a given Coxeter matrix M = (mij). J. Tits [210] (see also [14]) algorithmically solved the word problem for Coxeter groups. Finite Coxeter groups are presente”