Related papers: Restricted version of the infinitesimal Hilbert 16…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…

In his seminal 1961 paper, Wirsing studied how well a given transcendental real number $\xi$ can be approximated by algebraic numbers $\alpha$ of degree at most $n$ for a given positive integer $n$, in terms of the so-called naive height…

In this sequence, we first prove an abstract Morse index theorem in a Hilbert space modeling a variational problem with constraints. Then, our abstract formulation is applied to study several optimization setups including closed CMC…

Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

Hilbert volume is an invariant of real projective geometry. Polygons inscribed in polygons are considered for the real projective plane. The correspondence between Fock-Goncharov and Cartesian coordinates is examined. Degeneration and…

This is a full study of the dynamics of polynomial planar vector fields whose linear part is a multiple of the identity and whose nonlinear part is a homogeneous polynomial of arbitrary degree $n>1$. It extends previous work by other…

Let A be a finite subset of an abelian group (G, +). Let h $\ge$ 2 be an integer. If |A| $\ge$ 2 and the cardinality |hA| of the h-fold iterated sumset hA = A + $\times$ $\times$ $\times$ + A is known, what can one say about |(h -- 1)A| and…

In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…

We describe an algorithm for finding sharp upper bounds for the total Betti numbers of a saturated ideal given certain constraints on its Hilbert function. This algorithm is implemented in the Macaulay2 package, MaxBettiNumbers, along with…

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…

We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing ball (pSEB) problems. Our main objective and motivation is…

Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…

In this paper we study admissible polynomials. We establish an estimate for the number of admissible polynomials of degree $n$ with coeffients $a_i$ satisfying $0\leq a_i\leq H$ for a fixed $H$, for $i=0,1,2, \ldots, n-1$. In particular,…

The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der algebraischen Formen [Hil90]. In particular, the coefficients…

We propose a general study of standard bases of polynomial ideals with parameters in the case where the monomial order is arbitrary. We give an application to the computation of the stratification by the local Hilbert-Samuel function.…

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…