✦ LIBER ✦

A Weighted Enumeration of Maximal Chains in the Bruhat Order

✍ Scribed by John R. Stembridge

Book ID: 110333393
Publisher: Springer
Year: 2002
Tongue: English
Weight: 95 KB
Volume: 15
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1015068609503

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On maximum chains in the Bruhat order of

✍ Ghebleh, M. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 271 KB

The maximal length of a chain in the Bru

The maximal length of a chain in the Bruhat order for a class of binary matrices

✍ Alessandro Conflitti; C.M. Da Fonseca; Ricardo Mamede 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Enumeration of Bigrassmannian Permutatio

Enumeration of Bigrassmannian Permutations Below a Permutation in Bruhat Order

✍ Masato Kobayashi 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 223 KB

A Finite Coxeter Group the Weak Bruhat O

A Finite Coxeter Group the Weak Bruhat Order of which is not Symmetric Chain

✍ Bruno Leclerc 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 143 KB

About the automorphisms of the bruhat-or

About the automorphisms of the bruhat-ordering in a coxeter group

✍ A van den Hombergh 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 445 KB

Let (W, S) be a Coxeter system, where W is a Coxeter group and S a special set of involutary generators. See [l] for a definition.

Maximal cliques in the Paley graph of sq

Maximal cliques in the Paley graph of square order

✍ R.D. Baker; G.L. Ebert; J. Hemmeter; A. Woldar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Determining the clique number of the Paley graph of order q, 4 E I (mod 4) a prime power, is a difficult problem. However, the work of Blokhuis implies that in the Paley graph of order q2, where q is any odd prime power, the clique number is in fact q. In this paper we construct maximal cliques of s