相关论文: Restricted version of the infinitesimal Hilbert 16…

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

This paper is devoted to study the limit cycle problem of a cubic reversible system with an isochronous center, when it is perturbed inside a class of polynomials. An upper bound of the number of limit cycles is obtained using the Abelian…

We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.

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…

For family $x'=(a_0+a_1\cos t+a_2 \sin t)|x|+b_0+b_1 \cos t+b_2 \sin t$, we solve three basic problems related with its dynamics. First, we characterize when it has a center (Poincar\'e center focus problem). Second, we show that each…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

In this article, we studied the inverse Erd\H{o}s-Heilbronn problem with the restricted sumset from two components $A$ and $B$ that are not necessarily the same. We give a completely elementary proof for the problem in $\mathbb{Z}$ and some…

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…

We investigate a variant of Wirsing's problem on approximation to a real number by real algebraic numbers of degree exactly $n$. This has been studied by Bugeaud and Teulie. We improve their bounds for degrees up to $n=7$. Moreover, we…

Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…

Starting from a Pfaffian equation in dimension $N$ and focusing on compact solutions for it, we place in perspective the variational method used in [29] to solve Hilbert's 16th problem. In addition to exploring how this viewpoint can help…

Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

By applying Fourier transformations to the natural orthogonal oscillator representations of special linear Lie algebras, Luo and the second author (2013) obtained a large family of infinite-dimensional irreducible representations of the…

Hilbert specialization is an important tool in Field Arithmetic and Arithmetic Geometry, which has usually been intended for polynomials, hence hypersurfaces, and at scalar values. In this article, first, we extend this tool to prime…

Given a subspace $U\subset\mathbb{C}[x_1,\dots,x_n]_d$ we consider the closure of the image of the rational map $\mathbb{P}^{n-1}\dashrightarrow\mathbb{P}^{\dim U-1}$ given by $U$. Its coordinate ring is isomorphic to $\bigoplus_{i\ge 0}…

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…