English
Related papers

Related papers: Quadratic polynomials represented by norm forms

200 papers

A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…

Optimization and Control · Mathematics 2026-04-03 Wenqi Zhu , Coralia Cartis

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

Let $P_1,\dots, P_n$ and $Q_1,\dots, Q_n$ be convex polytopes in $\mathbb{R}^n$ such that $P_i\subset Q_i$. It is well-known that the mixed volume has the monotonicity property: $V(P_1,\dots,P_n)\leq V(Q_1,\dots,Q_n)$. We give two criteria…

Metric Geometry · Mathematics 2020-12-22 Frédéric Bihan , Ivan Soprunov

We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak…

Numerical Analysis · Mathematics 2020-01-14 Vladimir S. Chelyshkov

A generalisation of Waring's problem, considered first by Arkhipov and Karatsuba, is the question of representing not an integer, but a given polynomial, as a sum of powers of linear polynomials. We investigate a related problem and prove a…

Number Theory · Mathematics 2014-02-26 Julia Brandes

The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…

Commutative Algebra · Mathematics 2024-03-04 Eszter Gselmann , Mehak Iqbal

We show that subsets of $\mathbb{R}^n$ of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form \begin{align*} ( x ,\, x + A_1 y ,\, \dots,\, x + A_{k-1} y ,\, x + A_k y + Q(y) e_n ), \quad x \in…

Classical Analysis and ODEs · Mathematics 2016-08-03 Kevin Henriot , Izabella Laba , Malabika Pramanik

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

Functional Analysis · Mathematics 2007-05-23 D. P. L. Castrigiano , W. Klopfer

We give necessary and sufficient conditions for an integral polynomial without linear factors to be the characteristic polynomial of an isometry of some even, unimodular lattice of given signature. This gives rise to Hasse principle…

Number Theory · Mathematics 2021-05-11 Eva Bayer-Fluckiger

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

The definition of principal nest is supplemented with a system of frames that make possible the classification of combinatorial types for every level of the nest. As a consequence, we give necessary and sufficient conditions for the…

Dynamical Systems · Mathematics 2007-05-23 Rodrigo A. Pérez

In this paper, we propose and study neural network based methods for solutions of high-dimensional quadratic porous medium equation (QPME). Three variational formulations of this nonlinear PDE are presented: a strong formulation and two…

Numerical Analysis · Mathematics 2022-05-09 Jianfeng Lu , Min Wang

We prove a local-global principle for primitive representations of binary quadratic forms by quaternary quadratic forms. Our method is a variant of Linnik's ergodic method showing density for certain homogenous toral sets. The central…

Number Theory · Mathematics 2026-04-22 Wooyeon Kim , Andreas Wieser , Pengyu Yang

Let $V$ be a vector space over a finite field $k=\mathbb{F} _q$ of dimension $n$. For a polynomial $P:V\to k$ we define the bias of $P$ to be $$b_1(P)=\frac {|\sum _{v\in V}\psi (P(V))|}{q^n}$$ where $\psi :k\to \mathbb{C} ^\star$ is a…

Number Theory · Mathematics 2017-01-10 David Kazhdan , Tamar Ziegler

Polynomial processes are defined by the property that conditional expectations of polynomial functions of the process are again polynomials of the same or lower degree. Many fundamental stochastic processes, including affine processes, are…

Probability · Mathematics 2016-07-04 Martin Larsson , Sergio Pulido

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

Classical Analysis and ODEs · Mathematics 2014-06-17 D. Babusci , G. Dattoli , K. Górska , K. A. Penson

A polynomial $p(x,y)$ on a region $S$ in the plane is called a packing polynomial if the restriction of $p(x,y)$ to $S\cap \mathbb{Z}^2$ yields a bijection to $\mathbb{N}$. In this paper, we determine all quadratic packing polynomials on…

Combinatorics · Mathematics 2014-09-02 Madeline Brandt

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…

Rings and Algebras · Mathematics 2018-09-11 Gábor Ivanyos , Péter Kutas , Lajos Rónyai