43 citations · 121 across the 14 of their papers we have counts for
5 papers · 1 filter
Simplex inequalities of order and chain polytopes of recursively defined posets
Ragnar Freij-Hollanti, Teemu Lundström
In this paper, we study the simplex faces of the order polytope and the chain polytope of a finite poset . We show that, if can be recursiv…
Two-Dimensional Faces of Order and Chain Polytopes
Ragnar Freij-Hollanti, Teemu Lundström, Aki Mori
We give an explicit combinatorial description of the two-dimensional faces of both the order polytope and the chain polytope of a partially ordere…
Matroidal Cycles and Hypergraph Families
Ragnar Freij-Hollanti, Patricija Šapokaitė
We propose a novel definition of hypergraphical matroids, defined for arbitrary hypergraphs, simultaneously generalizing previous definitions for regular hypergraphs (Main, 1978),…
-vector inequalities for order and chain polytopes
Ragnar Freij-Hollanti, Teemu Lundström
The order and chain polytopes are two 0/1-polytopes constructed from a finite poset. In this paper, we study the -vectors of these polytopes. We investigate how the order and ch…
Combinatorial Derived Matroids
Olga Kuznetsova, Ragnar Freij-Hollanti, Relinde Jurrius
Let be an arbitrary matroid with circuits . We propose a definition of a derived matroid that has as its ground set . Unlike previous attem…