Related papers: Extended Nullstellensatz proof systems

Hochster established the existence of a commutative noetherian ring $\Cal R$ and a universal resolution $\Bbb U$ of the form $0\to \Cal R^{e}\to \Cal R^{f}\to \Cal R^{g}\to 0$ such that for any commutative noetherian ring $S$ and any…

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…

In this work, we analyze the finite element method with arbitrary but fixed polynomial degree for the nonlinear Helmholtz equation with impedance boundary conditions. We show well-posedness and error estimates of the finite element solution…

An important theorem by Timofte states that nonnegativity of real $n$-variate symmetric polynomials of degree $d$ can be decided at test sets given by all points with at most $\lfloor\frac{d}{2}\rfloor$ distinct components. However, if the…

It is well-known that Resolution proofs can be efficiently simulated by Sherali-Adams (SA) proofs. We show, however, that any such simulation needs to exploit huge coefficients: Resolution cannot be efficiently simulated by SA when the…

We prove that in every variety of $G$-groups, every $G$-existentially closed element satisfies nullstellensatz for finite consistent systems of equations. This will generalize {\bf Theorem G} of \cite{BMR1}. As a result we see that every…

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

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^{\Omega(n)}$ and that there exist…

In this paper, we consider the relationship between the Mahler measure of a polynomial and its separation. In 1964, Mahler proved that if $f(x) \in \mathbb{Z}[x]$ is separable of degree $n$, then $\operatorname{sep}(f) \gg_n M(f)^{-(n-1)}$.…

We consider equation systems of the form X_1 = f_1(X_1, ..., X_n), ..., X_n = f_n(X_1, ..., X_n) where f_1, ..., f_n are polynomials with positive real coefficients. In vector form we denote such an equation system by X = f(X) and call f a…

Let $f_i$ be polynomials in $n$ variables without a common zero. Hilbert's Nullstellensatz says that there are polynomials $g_i$ such that $\sum g_if_i=1$. The effective versions of this result bound the degrees of the $g_i$ in terms of the…

Let $E$ be the infinite dimensional Grassmann algebra over a field $F$ of characteristic zero. In this paper we investigate the structures of $\mathbb{Z}$-gradings on $E$ of full support. Using methods of elementary number theory, we…

We give the first known bound for orders of differentiations in differential Nullstellensatz for both partial and ordinary algebraic differential equations. This problem was previously addressed by A. Seidenberg but no complete solution was…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…

A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…