We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex ∆mn−1. The motivation for studying this... Show moreWe investigate the problem of completing partial matrices to rank-one matrices in the standard simplex ∆mn−1. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for partial observations to come from the independence model. For each pattern of specified entries, we give equations and inequalities which are satisfied if and only if an eligible completion exists. We also describe the set of valid completions, and we optimize over this set. Show less
In [2] Buczyn ́ska and Wi ́sniewski showed that the Hilbert polynomial of the algebraic variety associated to the Jukes-Cantor binary model on... Show moreIn [2] Buczyn ́ska and Wi ́sniewski showed that the Hilbert polynomial of the algebraic variety associated to the Jukes-Cantor binary model on a trivalent tree depends only on the number of leaves of the tree and not on its shape. We ask if this can be generalized to other group-based models. The Jukes-Cantor binary model has Z2 as the underlying group. We consider the Kimura 3-parameter model with Z2 × Z2 as the underlying group. We show that the generalization of the statement about the Hilbert polynomials to the Kimura 3-parameter model is not possible as the Hilbert polynomial depends on the shape of a trivalent tree. Show less