Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Orlich, Milo"'
Autor:
Engström, Alexander, Orlich, Milo
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, without it there is no structure. In this paper we transfer this paradi
Externí odkaz:
http://arxiv.org/abs/2108.07304
Triangulations of polygons and stacked simplicial complexes: separating their Stanley-Reisner ideals
Autor:
Fløystad, Gunnar, Orlich, Milo
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 models. More generally we do this for stacked simplicial complexes, in part
Externí odkaz:
http://arxiv.org/abs/2108.06520
Autor:
Orlich, Milo
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear quotients. I
Externí odkaz:
http://arxiv.org/abs/2006.11591
Autor:
Engström, Alexander, Orlich, Milo
Publikováno v:
In Advances in Mathematics 15 December 2023 435 Part A
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 prove that, they defined a transformation from graphs G to chordal grap
Externí odkaz:
http://arxiv.org/abs/1810.10055
Publikováno v:
In Journal of Pure and Applied Algebra November 2020 224(11)
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Fløystad, Gunnar, Orlich, Milo
Publikováno v:
Journal of Algebraic Combinatorics; May2023, Vol. 57 Issue 3, p659-686, 28p
Autor:
Engstr��m, Alexander, Orlich, Milo
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, without it there is no structure. In this paper we transfer this paradi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40c2f32c54693eb35ee64634ac384b9a
http://arxiv.org/abs/2108.07304
http://arxiv.org/abs/2108.07304