Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle and the Ordering Principle

05/07/2022
by   Aaron Potechin, et al.
0

In this paper, we investigate the total coefficient size of Nullstellensatz proofs. We show that Nullstellensatz proofs of the pigeonhole principle on n pigeons require total coefficient size 2^Ω(n) and that there exist Nullstellensatz proofs of the ordering principle on n elements with total coefficient size 2^n - n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2018

Sum of squares bounds for the total ordering principle

In this paper, we analyze the sum of squares hierarchy (SOS) on the tota...
research
09/08/2018

Resolution and the binary encoding of combinatorial principles

We investigate the size complexity of proofs in Res(s) -- an extension o...
research
04/26/2021

Bijective proofs for Eulerian numbers in types B and D

Let ⟨n k⟩, ⟨B_n k⟩, and ⟨D_n k⟩ be the Eulerian numbers in the types A, ...
research
07/22/2022

Towards the shortest DRAT proof of the Pigeonhole Principle

The Pigeonhole Principle (PHP) has been heavily studied in automated rea...
research
06/06/2021

Learning proofs for the classification of nilpotent semigroups

Machine learning is applied to find proofs, with smaller or smallest num...
research
12/05/2017

Determinism in the Certification of UNSAT Proofs

The search for increased trustworthiness of SAT solvers is very active a...
research
11/07/2017

First Results from Using Game Refinement Measure and Learning Coefficient in Scrabble

This paper explores the entertainment experience and learning experience...

Please sign up or login with your details

Forgot password? Click here to reset