Incidence geometry in the projective plane via almost-principal minors of symmetric matrices

03/03/2021 ∙ by Tobias Boege, et al. ∙ 0

We present an encoding of a polynomial system into vanishing and non-vanishing constraints on almost-principal minors of a symmetric, principally regular matrix, such that the solvability of the system over some field is equivalent to the satisfiability of the constraints over that field. This implies two complexity results about Gaussian conditional independence structures. First, all real algebraic numbers are necessary to construct inhabitants of non-empty Gaussian statistical models defined by conditional independence and dependence constraints. This gives a negative answer to a question of Petr Šimeček. Second, we prove that the implication problem for Gaussian CI is polynomial-time equivalent to the existential theory of the reals.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.