3 papers
math.CO2026
Comparability of random permutations in the strong Bruhat order
Nicholas Christo, Marcus Michelen
The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of ad…
math.CO2024
Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals
Nicholas Christo, Marcus Michelen
A result of Deza, Levin, Meesum, and Onn shows that the problem of deciding if a given sequence is the degree sequence of a 3-uniform hypergraph is NP complete. We tackle this prob…
math.CO2021
The set of ratios of derangements to permutations in digraphs is dense in
Bethany Austhof, Patrick Bennett, Nick Christo
A permutation in a digraph is a bijection such that for all we either have that fixes or . A derangement in is…