56 citations · 87 across the 29 of their papers we have counts for
Showing 2016 · math.COShow all
2 papers · 2 filters
math.CO2016★ 5 cited
Counting Markov Equivalence Classes by Number of Immoralities
Adityanarayanan Radhakrishnan, Liam Solus, Caroline Uhler
Two directed acyclic graphs (DAGs) are called Markov equivalent if and only if they have the same underlying undirected graph (i.e. skeleton) and the same set of immoralities. Usin…
math.CO2016
Detecting the Integer Decomposition Property and Ehrhart Unimodality in Reflexive Simplices
Benjamin Braun, Robert Davis, Liam Solus
A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) -polynomi…