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

The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$ of degree $n$, where $a_1, \ldots, a_n$ are independent variables. The resolvent…

The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…

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…

The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…

This paper is concerned with the numerical solution for a class of nonlinear weakly singular Volterra integral equation of the first kind. The existence and uniqueness issue of the nonlinear Abel integral equations is studied completely. An…

Let $f_i$ be polynomials in $n$ variables without a common zero. Hilbert's Nullstellensatz says that there are polynomials $g_i$ such that $\sum g_if_i=1$. The effective versions of this result bound the degrees of the $g_i$ in terms of the…

We consider the following open questions. Fix a Hilbert function, $h$, that occurs for a reduced zero-dimensional subscheme of $\mathbb P^2$. Among all subschemes, $X$, with Hilbert function $h$, what are the possible Hilbert functions and…

It is studied the Hilbert boundary value problem for the nondegenerate Beltrami equations in domains $D$ of the complex plane $\mathbb C$ with the so--called quasihyperbolic boundary condition. It is proved the existence of solutions of…

This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…

We prove upper and lower bounds for all the coefficients in the Hilbert Polynomial of a graded Gorenstein algebra $S=R/I$ with a quasi-pure resolution over $R$. The bounds are in terms of the minimal and the maximal shifts in the resolution…

We observe that for a large class of non-amenable groups $G$, one can find bounded representations of $A(G)$ on Hilbert space which are not completely bounded. We also consider restriction algebras obtained from $A(G)$, equipped with the…

We present sharp lower bounds for the A-numerical radius of semi-Hilbertian space operators. We also present an upper bound. Further we compute new upper bounds for the $B$-numerical radius of $2 \times 2$ operator matrices where $B =…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

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…

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

For $a,b \ge 1$, Hilbert found in 1886 a collection of polynomial equations that cut out set-theoretically the variety X parametrizing a-th powers of binary forms of degree b. We determine the ideal of all polynomials vanishing on X,…

This paper is a systematic study of the Hilbert polynomial of a bigraded algebra R which are generated by elements of bidegrees (1,0), (d_1,1),...,(d_r,1), where d_1,...,d_r are non-negative integers. The obtained results can be applied to…