Related papers: A parametric version of the Hilbert Nullstellensat…
This series of papers is devoted to an open-ended project aimed at the solution of Hilbert's sixth problem (concerning joint axiomatization of physics and probability theory) proposed to be constructed in the framework of an all-embracing…
We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…
Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…
For a 0-dimensional scheme $\mathbb{X}$ in $\mathbb{P}^n$ over a perfect field $K$, we first embed the homogeneous coordinate ring $R$ into its truncated integral closure $\widetilde{R}$. Then we use the corresponding map from the module of…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
Let $\mathscr{M}$ be a $II_1$ factor acting on the Hilbert space $\mathscr{H}$, and $\mathscr{M}_{\textrm{aff}}$ be the Murray-von Neumann algebra of closed densely-defined operators affiliated with $\mathscr{M}$. Let $\tau$ denote the…
Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…
We consider the minimal free resolution of a generic set of n+1 forms (not necessarily of the same degree) in a polynomial ring of n variables. The Hilbert function for such an ideal is known, thanks to a result of Stanley and of Watanabe.…
We compile a long list of equivalent formulations of Hilbert's Nullstellensatz in infinite dimensions, and prove a persistence result for the strong Nullstellensatz in large polynomial rings.
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…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…
We initiate a study of Hilbert modules over the polynomial algebra A=C[z_1,...,z_d] that are obtained by completing A with respect to an inner product having certain natural properties. A standard Hilbert module is a finite multiplicity…
This article extends the classical Real Nullstellensatz to matrices of polynomials in a free $\ast$-algebra $\RR\axs$ with $x=(x_1, \ldots, x_n)$. This result is a generalization of a result of Cimpri\vc, Helton, McCullough, and the author.…
We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the…
Let $K$ be a field and $D$ be a finite-dimensional central division algebra over $K$. We prove a variant of the Nullstellensatz for $2$-sided ideals in the ring of polynomial maps $D^n \to D$. In the case where $D = K$ is commutative, our…
The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert…
Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
We present sharp estimates for the degree and the height of the polynomials in the Nullstellensatz over $\Z$. The result improves previous work of Philippon, Berenstein-Yger and Krick-Pardo. We also present degree and height estimates of…
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…