9 citations · 10 across the 11 of their papers we have counts for
4 papers · 1 filter
The graph of implicit edge dependencies for indecomposability and beyond
Arnau Padrol, Germain Poullot
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly st…
Many rays of the submodular cone
Georg Loho, Arnau Padrol, Germain Poullot
The study of the cone of submodular functions goes back to Jack Edmonds' seminal 1970 paper, which already highlighted the difficulty of characterizing its extreme rays. Since then…
Ehrhart non-positivity and unimodular triangulations for classes of s-lecture hall simplices
Jhon B. Caicedo, Martina Juhnke, Germain Poullot
Counting lattice points and triangulating polytopes is a prominent subject in discrete geometry, yet proving Ehrhart positivity or existence of unimodular triangulations remain of…
Unimodality of the number of paths per length on polytopes: Examples, counterexamples, and a central limit theorem
Martina Juhnke, Germain Poullot
Because of its importance in combinatorics and optimization we study the full distribution of the lengths of monotone paths of a convex polytope. De Loera had conjectured that the…