Bruhat Graph for \(S_n\)

\(n =\)

Display

Node Size: 1.0

Edge Width: 1.5

Show Edge Labels

Label Type:

Search

Permutation (one-line):

Filter by Rank

Min: 0

Max: 0

Actions

Ready. Select n and build graph.

Not Comparable

⚠️

The selected permutations are not comparable in Bruhat order.

Neither \(u \le v\) nor \(v \le u\) holds.

Interval Hasse Diagram

Interval:

Kazhdan–Lusztig Polynomial