Related papers: The complexity of computing the Hilbert polynomial…

The Hilbert scheme $X^{[3]}$ of length-$3$ subschemes of a smooth projective variety $X$ is known to be smooth and projective. We investigate whether the property of having a multiplicative Chow-Kuenneth decomposition is stable under taking…

We give two algorithms for computing the Hilbert depth of a \emph{graded ideal} in the polynomial ring. These algorithms work efficiently for (squarefree) lex ideals. As a consequence, we construct counterexamples to some conjectures made…

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…

We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

We describe a framework for estimating Hilbert-Samuel multiplicities $e_XY$ for pairs of projective varieties $X \subset Y$ from finite point samples rather than defining equations. The first step involves proving that this multiplicity…

We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…

The Poincar\'e polynomial of a Weyl group calculates the Betti numbers of the projective homogeneous space $G/B$, while the $h$-vector of a simple polytope calculates the Betti numbers of the corresponding rationally smooth toric variety.…

We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…

We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

In this article we prove an upper bound for a Hilbert polynomial on quaternionic Kaehler manifolds of positive scalar curvature. As corollaries we obtain bounds on the quaternionic volume and the degree of the associated twistor space.…

In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over…

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

We investigate projection constants for spaces of bihomogeneous harmonic and bihomogeneous polynomials on the unit sphere in finite-dimensional complex Hilbert spaces. Using averaging techniques, we demonstrate that the minimal norm…

We consider the problem of determining the maximum number of common zeros in a projective space over a finite field for a system of linearly independent multivariate homogeneous polynomials defined over that field. There is an elaborate…