Related papers: Enumerative Aspects of Nullstellensatz Certificate…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…
In [4] Sturmfels linked the Hilbert Nullstellensatz to Gr\"obner bases through final polynomials. In (loc. cit.) it was claimed that final polynomials always appear in a lexicographic Gr\"obner basis of a certain ideal. In this paper, we…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…
We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has a built-in function certify, which proves the correctness of an isolated nonsingular…
This paper establishes new Positivstellens\"atze for polynomials that are positive on sets defined by polynomial matrix inequalities (PMIs). We extend the classical Handelman and Krivine-Stengle theorems from the scalar inequality setting…
A noncommutative (nc) polynomial is called (globally) trace-positive if its evaluation at any tuple of operators in a tracial von Neumann algebra has nonnegative trace. Such polynomials emerge as trace inequalities in several matrix or…
Zilber's Exponential Algebraic Closedness conjecture (also known as Zilber's Nullstellensatz) gives conditions under which a complex algebraic variety should intersect the graph of the exponential map of a semiabelian variety. We prove the…
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
We investigate the question whether Subset Sum can be solved by a polynomial-time algorithm with access to a certificate of length poly(k) where k is the maximal number of bits in an input number. In other words, can it be solved using only…
This paper presents a nonnegative polynomial that cannot be represented with nonnegative coefficients in the simplicial Bernstein basis by subdividing the standard simplex. The example shows that Bernstein Theorem cannot be extended to…
In this note we give an extended version of Combinatorial Nullstellensatz, with weaker assumption on nonvanishing monomial. We also present an application of our result in a situation where the original theorem does not seem to work.
Automated theorem provers (ATPs) can disprove conjectures by saturating a set of clauses, but the resulting saturated sets are opaque certificates. In the unit equational fragment, a saturated set can in fact be read as a convergent rewrite…
Using the Rabinowitsch trick, we prove a version of Nullstellensatz over quaternions, which generalizes Hilbert's Nullstellensatz over complex numbers.
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
Smale's alpha-theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to a square polynomial system. The program alphaCertified implements…
We investigate replicable learning algorithms. Ideally, we would like to design algorithms that output the same canonical model over multiple runs, even when different runs observe a different set of samples from the unknown data…