English
Related papers

Related papers: Reducing the number of variables of a polynomial

200 papers

Let $F(\boldsymbol x)$ be a homogeneous polynomial in $n \ge 1$ variables of degree $1 \leq d \leq n$ with integer coefficients so that its degree in every variable is equal to $1$. We give some sufficient conditions on $F$ to ensure that…

Number Theory · Mathematics 2020-07-16 Albrecht Boettcher , Lenny Fukshansky

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

Data Structures and Algorithms · Computer Science 2017-04-25 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

Number Theory · Mathematics 2025-09-10 Kiseok Yeon

Let F be a homogeneous real polynomial of even degree in any number of variables. We consider the problem of giving explicit conditions on the coefficients so that F is positive definite or positive semi-definite. In this note we produce a…

Algebraic Geometry · Mathematics 2007-05-23 Fernando Cukierman

A nonlinear algebraic equation system of 5 variables is numerically solved, which is derived from the application of the Fourier transform to a differential equation system that allows modeling the behavior of the temperatures and the…

Numerical Analysis · Mathematics 2024-07-26 A. Torres-Hernandez , F. Brambila-Paz , P. M. Rodrigo

In this paper we explore inequalities between symmetric homogeneous polynomials of degree four of three real variables and three nonnegative real variables. The main theorems describe the cases in which the smallest possible coefficient is…

Classical Analysis and ODEs · Mathematics 2016-04-05 Mariyan Milev , Nedecho Milev

A fundamental result in linear algebra states that if a homogenous linear equation system has only the trivial solution, then there are at most as many variables as equations. We prove the following generalisation of this phenomenon. If a…

Combinatorics · Mathematics 2022-11-24 J. Pascal Gollin , Attila Joó

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behavior of an experiment? How many of the…

Optimization and Control · Mathematics 2025-10-20 Alexandre Sedoglavic

Let $F$ be a homogeneous polynomial of degree $d$ in $m+1$ variables defined over an algebraically closed field of characteristic zero and suppose that $F$ belongs to the $s$-th secant varieties of the standard Veronese variety…

Algebraic Geometry · Mathematics 2012-08-09 Edoardo Ballico , Alessandra Bernardi

We use the representation theory of Lie algebras and computational linear algebra to obtain an explicit formula for the hyperdeterminant of a $3 \times 3 \times 2$ array: a homogeneous polynomial of degree 12 in 18 variables with 16749…

Representation Theory · Mathematics 2011-11-29 Murray R. Bremner

A Waring decomposition of a (homogeneous) polynomial f is a minimal sum of powers of linear forms expressing f. Under certain conditions, such a decomposition is unique. We discuss some algorithms to compute the Waring decomposition, which…

Algebraic Geometry · Mathematics 2025-10-16 Luke Oeding , Giorgio Ottaviani

We consider systems $\vec{F}(\vec{x})$ of $R$ homogeneous forms of the same degree $d$ in $n$ variables with integral coefficients. If $n\geq d2^dR+R$ and the coefficients of $\vec{F}$ lie in an explicit Zariski open set, we give a…

Number Theory · Mathematics 2017-10-25 Simon L. Rydin Myerson

We consider sparse polynomials in $N$ variables over a finite field, and ask whether they vanish on a set $S^N$, where $S$ is a set of nonzero elements of the field. We see that if for a polynomial $f$, there is $\mathbf{c}\in S^N$ with $f…

Rings and Algebras · Mathematics 2024-06-12 Erhard Aichinger , Simon Grünbacher , Paul Hametner

Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected…

Algebraic Geometry · Mathematics 2007-05-23 B. Bank , M. Giusti , J. Heintz , G. M. Mbakop

Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…

Symbolic Computation · Computer Science 2024-01-01 Joris van der Hoeven , Grégoire Lecerf

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…

Symbolic Computation · Computer Science 2017-12-12 Mohab Safey El Din , Eric Schost

We give the stratification by the symmetric tensor rank of all degree $d \ge 9$ homogeneous polynomials with border rank $5$ and which depend essentially on at least 5 variables, extending previous works (A. Bernardi, A. Gimigliano, M.…

Algebraic Geometry · Mathematics 2017-02-08 Edoardo Ballico

Let $K:={x: g(x)\leq 1}$ be the compact sub-level set of some homogeneous polynomial $g$. Assume that the only knowledge about $K$ is the degree of $g$ as well as the moments of the Lebesgue measure on $K$ up to order 2d. Then the vector of…

Optimization and Control · Mathematics 2013-11-15 Jean Lasserre

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

Algebraic Geometry · Mathematics 2022-04-26 Stefan Barańczuk

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu
‹ Prev 1 2 3 10 Next ›