10 problems
Collapsing conjecture. Suppose that
Let denote the size of the smallest set of uniqueness for the positive function class . In particular, consider the case . Minimum…
Asymptotic-bias dichotomy. The technical condition in the unbiasedness theorem should be replaceable by . Under this condition, the MLE is asymp…
Let be the sample configuration, let and let be the finite set and bimonotone subdivision produced by the paper's algorithm. Let…
Partial-decoupling conjecture. The kernels of the partial decouplings of are the only critical points of .
Let a superposition be a product of mutually compatible slices, and let a slice be a component obtained by a slicing algorithm from the initial syntax of a superposition. An order-…
Let denote the cone associated with a graph . A basic open semialgebraic set is an open semialgebraic set defined by finitely many strict p…
Let denote the model matrix for the directed random graph network model with reciprocation, and let be its cone. For a network on nodes, the facets conje…
Let and let satisfy . Let be the likelihood function defined in the source by equation (newLP). Alternative likelihood conjecture. The matrix … is a…
Let and let satisfy . For positive and positive integer block dimensions, write for the matrix all of whose entries e…