Related papers: Hilbert's Nullstellensatz is in the Counting Hiera…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
We study the multiplicative Hilbert matrix, i.e. the infinite matrix with entries $(\sqrt{mn}\log(mn))^{-1}$ for $m,n\geq2$. This matrix was recently introduced within the context of the theory of Dirichlet series, and it was shown that the…
A numerical scheme is presented to solve the one source near field refractor problem to arbitrary precision and it is proved that the scheme terminates in a finite number of iterations. The convergence of the algorithm depends upon proving…
Numerical resolution of exterior Helmholtz problems requires some approach to domain truncation. As an alternative to approximate nonreflecting boundary conditions and invocation of the Dirichlet-to-Neumann map, we introduce a new, nonlocal…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
The theory of product systems both of Hilbert spaces (Arveson systems) and product systems of Hilbert modules has reached a status where it seems appropriate to rest a moment and to have a look at what is known so far and what are open…
Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…
In holography, two manifestations of the black hole information paradox are given by the non-isometric nature of the bulk-boundary map and by the factorisation puzzle. By considering time-shifted microstates of the eternal black hole, we…
This note presents the Hilbert series technique to a wider audience in the context of constructing group-invariant Lagrangians. This technique provides a fast way to calculate the number of operators of a specified mass dimension for a…
In this paper we consider the Hilbert scheme $Hilb_{p(t)}^n$ parameterizing subschemes of $P^n$ with Hilbert polynomial $p(t)$, and we investigate its locus containing points corresponding to schemes with regularity lower than or equal to a…
We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…
We consider second order elliptic divergence form systems with complex measurable coefficients $A$ that are independent of the transversal coordinate, and prove that the set of $A$ for which the boundary value problem with $L_2$ Dirichlet…
By using variational methods, the existence of infinitely many solutions for a nonlinear algebraic system with a parameter is established in presence of a perturbed Lipschitz term. Our goal was achieved requiring an appropriate behavior of…
We prove the extended Hilbert's Nullstellensatz in the context of Hu-Liu polynomial trirings.
Finding solution values for unknowns in Boolean equations was a principal reasoning mode in the Algebra of Logic of the 19th century. Schr\"oder investigated it as Aufl\"osungsproblem (solution problem). It is closely related to the modern…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…