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

page 1

page 2

page 3

page 4

research
12/07/2020

Algebraic geometry of discrete interventional models

We investigate the algebra and geometry of general interventions in disc...
research
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...
research
04/08/2020

On recursively defined combinatorial classes and labelled trees

We define and prove isomorphisms between three combinatorial classes inv...
research
04/24/2023

Computing Circuit Polynomials in the Algebraic Rigidity Matroid

We present an algorithm for computing circuit polynomials in the algebra...
research
04/03/2020

Weakly displaying trees in temporal tree-child network

Recently there has been considerable interest in the problem of finding ...
research
07/09/2021

Staged tree models with toric structure

A staged tree model is a discrete statistical model encoding relationshi...
research
09/05/2022

Toric Ideals of Characteristic Imsets via Quasi-Independence Gluing

Characteristic imsets are 0-1 vectors which correspond to Markov equival...

Please sign up or login with your details

Forgot password? Click here to reset