Descriptive complexity of linear equation systems and applications to propositional proof complexity

We prove that the solvability of systems of linear equations and related linear algebraic properties are definable in a fragment of fixed-point logic with counting that only allows polylogarithmically many iterations of the fixed-point operators. This enables us to separate the descriptive complexity of solving linear equations from full fixed-point logic with counting by logical means. As an application of these results, we separate an extension of first-order logic with a rank operator from fixed-point logic with counting, solving an open problem due to Holm [21]. We then draw a connection from this work in descriptive complexity theory to graph isomorphism testing and propositional proof complexity. Answering an open question from [7], we separate the strength of certain algebraic graph-isomorphism tests. This result can also be phrased as a separation of the algebraic propositional proof systems “Nullstellensatz” and “monomial PC”.

[1]  Jan Krajícek,et al.  Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[2]  Eric Allender,et al.  Relationships Among PL, #L, and the Determinant , 1996, RAIRO Theor. Informatics Appl..

[3]  Anuj Dawar,et al.  Logics with Rank Operators , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[4]  Ryan O'Donnell,et al.  Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs , 2014, SODA.

[5]  Anuj Dawar,et al.  Pebble Games with Algebraic Rules , 2012, Fundam. Informaticae.

[6]  W. S. Anglin,et al.  Linear Diophantine Equations , 2020, Universitext.

[7]  Peter N. Malkin.  Sherali-Adams relaxations of graph isomorphism polytopes , 2014, Discret. Optim..

[8]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[9]  Russell Impagliazzo,et al.  Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.

[10]  Y. Gurevich.  On Finite Model Theory , 1990 .

[11]  N. Wiegmann,et al.  Necessary and sufficient conditions for unitary similarity , 1961 .

[12]  Christoph Berkholz,et al.  Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[13]  Anuj Dawar,et al.  On the Descriptive Complexity of Linear Algebra , 2008, WoLLIC.

[14]  Gottfried Tinhofer,et al.  A note on compact graphs , 1991, Discret. Appl. Math..

[15]  Neil Immerman,et al.  Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..

[16]  Christoph Berkholz,et al.  Limitations of Algebraic Approaches to Graph Isomorphism Testing , 2015, ICALP.

[17]  Anuj Dawar,et al.  Solving Linear Programs without Breaking Abstractions , 2015, J. ACM.

[18]  Martin Grohe,et al.  Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[19]  Maarten Marx,et al.  Finite Model Theory and Its Applications , 2007, Texts in Theoretical Computer Science. An EATCS Series.

[20]  Bastian Laubner,et al.  Capturing Polynomial Time on Interval Graphs , 2009, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[21]  Anuj Dawar,et al.  Affine Systems of Equations and Counting Infinitary Logic , 2007, ICALP.

[22]  Helene Shapiro,et al.  A survey of canonical forms and invariants for unitary similarity , 1991 .

[23]  Samuel R. Buss.  Lower bounds on Nullstellensatz proofs via designs , 1996, Proof Complexity and Feasible Arithmetics.

[24]  Martin Otto,et al.  Bounded Variable Logics and Counting , 1997 .

[25]  Albert Atserias,et al.  Sherali-Adams relaxations and indistinguishability in counting logics , 2012, ITCS '12.

[26]  Bastian Laubner,et al.  The structure of graphs and new logics for the characterization of Polynomial Time , 2011 .

[27]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[28]  P. Lancaster,et al.  Zur Theorie der ?-Matrizen , 1975 .

[29]  Neil Immerman,et al.  Expressibility as a complexity measure: results and directions , 1987, SCT.

[30]  Eric Allender,et al.  Relationships among PL, #L, and the determinant , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[31]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[32]  Christoph Berkholz,et al.  Linear Diophantine Equations, Group CSPs, and Graph Isomorphism , 2016, SODA.

[33]  Berit Grußien,et al.  Capturing Polynomial Time and Logarithmic Space using Modular Decompositions and Limited Recursion , 2017 .

[34]  Anuj Dawar,et al.  On Symmetric Circuits and Fixed-Point Logics , 2014, Theory of Computing Systems.

[35]  Jeffrey D. Smith,et al.  Design and Analysis of Algorithms , 2009, Lecture Notes in Computer Science.

[36]  Martin Grohe,et al.  PEBBLE GAMES AND LINEAR EQUATIONS , 2012, The Journal of Symbolic Logic.

[37]  Carl Pearcy.  A COMPLETE SET OF UNITARY INVARIANTS FOR OPERATORS GENERATING FINITE W -ALGEBRAS OF TYPE I , 1962 .