相关论文: Square values of several polynomials over a finite…

Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…

We investigate the quantitative relationship between nonnegative polynomials and sums of squares of polynomials. We show that if the degree is fixed and the number of variables grows then there are significantly more nonnegative polynomials…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite programming formulations, or as more recently proposed by Papp and…

This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…

In this paper we study the distribution of the size of the value set for a random polynomial with degree at most $q-1$ over a finite field $\mathbb{F}_q$. We obtain the exact probability distribution and show that the number of missing…

We study the arithmetic of complete intersections in projective space over number fields. Our main results include arithmetic Torelli theorems and versions of the Shafarevich conjecture, as proved for curves and abelian varieties by…

Let $\mathbb{F}_{q}$ be the finite field with an odd prime power $q$. In this paper, we construct a new isometric invariant of combinatorial type on $(\mathbb{F}^{n}_{q},\text{dot}_{n})$, where…

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular cause. In this paper, we begin by…

Let $g>1$ be an integer and $f(X)\in{\mathbb Z}[X]$ a polynomial of positive degree with no multiple roots, and put $u(n)=f(g^n)$. In this note, we study the sequence of quadratic fields ${\mathbb Q}(\sqrt{u(n)}\,)$ as $n$ varies over the…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

Let f = 0 be a hypersurface in n-dimensional affine space over a field k. We consider the pencil of hypersurfaces f- c = 0 with c varying over k.

Consider systems of equations $q_i(x)=0$, where $q_i: {\Bbb R}^n \longrightarrow {\Bbb R}$, $i=1, \ldots, m$, are quadratic forms. Our goal is to tell efficiently systems with many non-trivial solutions or near-solutions $x \ne 0$ from…

In this paper, we prove two theorems concerning the sums of squared distances between points on a unit $n$-sphere that generalize two facts previously known about the case where the points are the vertices of a regular polygon. The first…

Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…

We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

We study the number of points in the family of plane curves defined by a trinomial \[ \mathcal{C}(\alpha,\beta)= \{(x,y)\in\mathbb{F}_q^2\,:\,\alpha x^{a_{11}}y^{a_{12}}+\beta x^{a_{21}}y^{a_{22}}=x^{a_{31}}y^{a_{32}}\} \] with fixed…