12 problems
Let be a directed acyclic graph, and let denote the covariance matrix of its arc-indicator variables. Covariance-matrix sparsity conjecture. The covariance matri…
Let be a directed acyclic graph, with arcs represented by indicator random variables and covariance matrix . Two arcs are incident when they share a comm…
Feasible indexing conjecture. There exists an indexing satisfying this successor-set ordering and, whenever two consecutive nodes have equal successor-set order,
Sullivant's saturation conjecture. The vanishing ideal satisfies
Let be a directed acyclic outerplanar graph, and let denote its stack number. Heath, Pemmaraju and Trenk's conjecture. The stack number of the class of d…
Assume the higher d-separation conjecture: whenever two vertices of a DAG have minimum d-separating-set size at least , the vanishing ideal is not toric. Let be a chordal di…
Let be a directed acyclic graph (DAG), and let be vertices of . A d-separating set for and is a set of vertices that d-separates them; consider the minimum car…
Let be a directed acyclic graph (DAG) with toric vanishing ideal . The relevant constructions are safe gluing, gluing at sinks, and adding a sink. Recursive classification…
Let and be directed acyclic graphs (DAGs), and let be their vanishing ideals and their shortest trek ideals. Suppose that and…
Let be a finite directed acyclic graph. Its universal dynamics monoid is the smallest quotient of through which all evaluat…
Let be a directed acyclic graph, and consider two arcs incident on a common node. Incident-arc range conjecture. The covariance between the two arcs takes values in the i…
Let be a directed acyclic graph, and consider two arcs that are incident on a common node. Let covariance and correlation refer to the corresponding arc-indicator random…