Gröbner bases for staged trees

10/07/2019
by   Lamprini Ananiadi, et al.
0

In this article we consider the problem of finding generators of the toric ideal associated to a combinatorial object called a staged tree. Our main theorem states that toric ideals of staged trees that are balanced and stratified are generated by a quadratic Gröbner basis whose intial terms are squarefree. The proof of this result is based on Sullivant's toric fiber product construction.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/07/2020

Algebraic geometry of discrete interventional models

We investigate the algebra and geometry of general interventions in disc...
05/04/2021

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput...
04/08/2020

On recursively defined combinatorial classes and labelled trees

We define and prove isomorphisms between three combinatorial classes inv...
05/10/2021

Distinct Fringe Subtrees in Random Trees

A fringe subtree of a rooted tree is a subtree induced by one of the ver...
04/03/2020

Weakly displaying trees in temporal tree-child network

Recently there has been considerable interest in the problem of finding ...
03/15/2021

Combinatorial Resultants in the Algebraic Rigidity Matroid

Motivated by a rigidity-theoretic perspective on the Localization Proble...
04/29/2019

Ranking top-k trees in tree-based phylogenetic networks

'Tree-based' phylogenetic networks proposed by Francis and Steel have at...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.