19 problems

Vertex-disjoint path conjecture. In the full measurement case, a DAG is generically identifiable in the class $\mathcal{F}_A$ if and only if there are vertex-disjoint paths from ex…

Majority 2-coloring conjecture for countable DAGs. Every countable DAG is majority 2-colorable.

SSCS dimension conjecture. The principles used to determine the dimension of the SSCS for HDAGs should also hold for general directed acyclic graphs.

Common-descendant asymptotic conjecture. There exists a constant $\upsilon>0$ such that

Let $G$ be a directed acyclic $2$-tree, and let $\operatorname{sn}(G)$ denote its stack number. Bekos et al.'s conjecture. The stack number of all directed acyclic $2$-trees is bou…

Let $G$ be a directed acyclic outerplanar graph, and let $\operatorname{sn}(G)$ 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 $2$, the vanishing ideal is not toric. Let $G$ be a chordal di…

Let $G$ be a directed acyclic graph (DAG), and let $i,j$ be vertices of $G$. A d-separating set for $i$ and $j$ is a set of vertices that d-separates them; consider the minimum car…

Let $G$ be a directed acyclic graph (DAG) with toric vanishing ideal $I_G$. The relevant constructions are safe gluing, gluing at sinks, and adding a sink. Recursive classification…

Let $G_1$ and $G_2$ be directed acyclic graphs (DAGs), and let $I_{G_i}$ be their vanishing ideals and $ST_{G_i}$ their shortest trek ideals. Suppose that $I_{G_1}=ST_{G_1}$ and…

Let $G$ be a directed acyclic graph (DAG), and let $I_G$ denote its vanishing ideal. The operations considered are safe gluing, gluing at sinks, and adding a new sink; a complete D…

Let $G_1$ and $G_2$ be directed acyclic graphs (DAGs) with toric vanishing ideals. A safe gluing combines them along a common clique, subject to the safe-gluing conditions describe…

Consider broadcasting from a root through a regular grid in dimension $d$, where each node applies the same processing function and each transmitted bit is independently corrupted…

Let $\Gamma$ be a finite directed acyclic graph. Its universal dynamics monoid $D(\Gamma)$ is the smallest quotient of $\operatorname{\mathbf{HK}}_\Gamma$ through which all evaluat…

Let $G=(V,A)$ 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 $G=(V,A)$ 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…

Let $G=(V,A)$ be a directed acyclic graph, and let $\Sigma$ denote the covariance matrix of its arc-indicator variables. Covariance-matrix sparsity conjecture. The covariance matri…

Let $G=(V,A)$ be a directed acyclic graph, with arcs represented by indicator random variables $A_{ij}$ and covariance matrix $\Sigma$. Two arcs are incident when they share a comm…

Let $D_1$ and $D_2$ be DAGs, let ${\mathcal{I}}$ be a conservative family of intervention targets, and let the associated observational and interventional densities be allowed to v…