4 papers
The regularity of almost all edge ideals
Alexander Engström, Milo Orlich
A fruitful contemporary paradigm in graph theory is that almost all graphs that do not contain a certain subgraph have common structural characteristics. The "almost" is crucial, w…
Triangulations of polygons and stacked simplicial complexes: separating their Stanley-Reisner ideals
Gunnar Fløystad, Milo Orlich
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated model…
Linearization of monomial ideals
Milo Orlich
We introduce a construction, called linearization, that associates to any monomial ideal an ideal in a larger polynomial ring. The main feature of this constr…
Explicit Boij-Soderberg theory of ideals from a graph isomorphism reduction
Alexander Engstrom, Laura Jakobsson, Milo Orlich
In the origins of complexity theory Booth and Lueker showed that the question of whether two graphs are isomorphic or not can be reduced to the special case of chordal graphs. To p…