5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2015★ 5 cited
On comparability of bigrassmannian permutations
John Engbers, Adam Hammett
Let and denote the respective sets of ordinary and bigrassmannian (BG) permutations of order , and let denote the Bruha…
math.CO2014
Trivial Meet and Join within the Lattice of Monotone Triangles
John Engbers, Adam Hammett
The lattice of monotone triangles ordered by entry-wise comparisons is studied. Let denote the unique minimal element in this lattice, and $τ_{\ma…
math.PR2006
On the Likelihood of Comparability in Bruhat Order
Adam Hammett, Boris Pittel
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and…