Recursive classification of DAGs with toric vanishing ideals by gluing operations

Let GG be a directed acyclic graph (DAG) with toric vanishing ideal IGI_G. The relevant constructions are safe gluing, gluing at sinks, and adding a sink. Recursive classification conjecture. At least one of the following holds: GG is a complete DAG; GG is obtained by safe gluing or gluing at sinks of two smaller DAGs with toric vanishing ideals; or GG is obtained by adding a sink to a smaller DAG with a toric vanishing ideal. This is the paper's second main conjecture and remains open; it gives the explicit recursive form of the broader constructive classification claim.

Sources & referencesView supporting material

Primary source

Pratik Misra and Seth Sullivant, “Directed Gaussian graphical models with toric vanishing ideals”, arXiv:2105.13357 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.