English
Related papers

Related papers: Extended Nullstellensatz proof systems

200 papers

We prove a noncommutative real Nullstellensatz for 2-step nilpotent Lie algebras that extends the classical, commutative real Nullstellensatz as follows: Instead of the real polynomial algebra $\mathbb R[x_1, \dots, x_d]$ we consider the…

Algebraic Geometry · Mathematics 2024-10-08 Philipp Schmitt , Matthias Schötz

The existence of sufficiently many finite order meromorphic solutions of a differential equation, or difference equation, or differential-difference equation, appears to be a good indicator of integrability. In this paper, we investigate…

Classical Analysis and ODEs · Mathematics 2018-08-14 Li-Hao Wu , Ran-Ran Zhang , Zhi-Bo Huang

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

Number Theory · Mathematics 2009-07-16 L. Bary-Soroker

We consider a system of integer polynomials of the same degree with non-singular local zeros and in many variables. Generalising the work of Birch (1962) we find quantitative asymptotics (in terms of the maximum of the absolute value of the…

Number Theory · Mathematics 2020-11-10 Jan-Willem M. van Ittersum

Does every Boolean tautology have a short propositional-calculus proof? Here, a propositional calculus (i.e. Frege) proof is a proof starting from a set of axioms and deriving new Boolean formulas using a set of fixed sound derivation…

Computational Complexity · Computer Science 2015-09-14 Fu Li , Iddo Tzameret , Zhengyu Wang

We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…

Computational Complexity · Computer Science 2014-04-16 Joshua A. Grochow , Toniann Pitassi

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion system over $S$. Then $\mathcal{F}$ is said to be supersolvable, if there exists a series of $S$, namely $1 = S_0 \leq S_1 \leq \cdots \leq S_n = S$, such that…

Group Theory · Mathematics 2024-02-11 Shengmin Zhang , Zhencai Shen

Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…

General Mathematics · Mathematics 2024-08-23 Petar P. Petrov

Let $S \subseteq \mathbb{R}^n$ be a compact semialgebraic set and let $f$ be a polynomial nonnegative on $S$. Schm\"udgen's Positivstellensatz then states that for any $\eta > 0$, the nonnegativity of $f + \eta$ on $S$ can be certified by…

Optimization and Control · Mathematics 2023-02-03 Monique Laurent , Lucas Slot

Let $V$ be a real algebraic variety with singularities and $f$ be a real polynomial non-negative on $V$. Assume that the regular locus of $V$ is dense in $V$ by the usual topology. Using Hironaka's resolution of singularities and…

Algebraic Geometry · Mathematics 2023-03-10 Ngoc Hoang Anh Mai

One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…

Logic · Mathematics 2011-07-01 David Monniaux , Pierre Corbineau

For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…

Computational Complexity · Computer Science 2022-05-13 Amol Aggarwal , Josh Alman

This article takes up the challenge of extending the classical Real Nullstellensatz of Dubois and Risler to left ideals in a *-algebra A. After introducing the notions of non-commutative zero sets and real ideals, we develop three themes…

Functional Analysis · Mathematics 2014-02-26 Jaka Cimpric , Bill Helton , Scott McCullough , Christopher Nelson

We give upper bounds for the solving degree and the last fall degree of the polynomial system associated to the HFE (Hidden Field Equations) cryptosystem. Our bounds improve the known bounds for this type of systems. We also present new…

Cryptography and Security · Computer Science 2020-11-03 Elisa Gorla , Daniela Mueller , Christophe Petit

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…

Data Structures and Algorithms · Computer Science 2022-04-13 Xin Sun , Chenchen Wu , Dachuan Xu , Yang Zhou

The Positivstellens\"atze of Putinar and Schm\"udgen show that any polynomial $f$ positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of…

Algebraic Geometry · Mathematics 2025-02-24 Lorenzo Baldi , Lucas Slot

Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…

Rings and Algebras · Mathematics 2018-04-27 Igor Klep , Victor Vinnikov , Jurij Volčič

Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…

Cryptography and Security · Computer Science 2026-02-02 Giulia Gaggero , Elisa Gorla