Pith. sign in

REVIEW 1 cited by

Extending higher Bruhat orders to non-longest words in $S_n$

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.15181 v1 pith:PJQQBQ7I submitted 2021-05-31 math.CO

classification math.CO
keywords bruhatordershighermaximalnon-longestorderwordsmanin
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with unique minimal and maximal elements. As in Manin and Schechtman's original paper, the $k$-th Bruhat order for $w$ is created out of equivalence classes of maximal chains in its $(k-1)$-st Bruhat order. We also define the second and third Bruhat orders for arbitrary realizable k-sets, and prove that the second Bruhat order has a unique minimal and maximal element. Lastly, we also outline how this extension may guide future research into developing higher Bruhat orders for affine type A Weyl groups.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences

    math.CO 2025-06 conditional novelty 8.0 of 10

    Edge-labelled polygonal lattices carry preorders on square-equivalence classes of maximal chains that descend to contractions under lattice quotients, yielding new structural results for Cambrian lattices and the Kapr...

Pith tools