English
Related papers

Related papers: Polynomial equations with one catalytic variable, …

200 papers

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…

Symbolic Computation · Computer Science 2016-02-19 Albert Heinle , Viktor Levandovskyy

We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomized algorithm for the following problem: If a homogeneous polynomial $f \in K[x_1 , . . . , x_n]$ (where $K \subseteq \mathbb{C}$) of…

Computational Complexity · Computer Science 2021-10-12 Pascal Koiran , Subhayan Saha

Given an element $P(X_1,...,X_d)$ of the finitely generated free Lie algebra, for any Lie algebra $g$ we can consider the induced polynomial map $P: g^d\to g$. Assuming that $K$ is an arbitrary field of characteristic $\ne 2$, we prove that…

Algebraic Geometry · Mathematics 2011-03-01 Tatiana Bandman , Nikolai Gordeev , Boris Kunyavskii , Eugene Plotkin

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…

Combinatorics · Mathematics 2007-07-06 Gus Wiseman

Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…

Algebraic Geometry · Mathematics 2008-09-02 Danko Adrovic , Jan Verschelde

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

Classical Analysis and ODEs · Mathematics 2024-09-30 Gergő Nemes

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Algebraic Geometry · Mathematics 2020-06-15 Miguel N. Walsh

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

Systems and Control · Computer Science 2014-08-13 Khier Benmahammed , Saeed Badran , Bassam Kourdi

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…

Number Theory · Mathematics 2022-12-08 Sai Teja Somu , Ting Hon Stanford Li , Andrzej Kukla

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

Optimization and Control · Mathematics 2013-07-05 Vaithilingam Jeyakumar , Jean-Bernard Lasserre , G. Li

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

Number Theory · Mathematics 2019-11-04 Patrick Letendre

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Symbolic Computation · Computer Science 2014-09-22 Wei Zhou , George Labahn

Let $(b,u)$ be a pair consisting of a symplectic form $b$ on a finite-dimensional vector space $V$ over a field $\mathbb{F}$, and of a $b$-alternating endomorphism $u$ of $V$ (i.e. $b(x,u(x))=0$ for all $x$ in $V$). Let $p$ and $q$ be…

Rings and Algebras · Mathematics 2023-06-01 Clément de Seguins Pazzis

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

Commutative Algebra · Mathematics 2019-09-04 Erhard Aichinger

We present a spectral method for one-sided linear fractional integral equations on a closed interval that achieves exponentially fast convergence for a variety of equations, including ones with irrational order, multiple fractional orders,…

Numerical Analysis · Mathematics 2024-04-10 Tianyi Pu , Marco Fasondini

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

Commutative Algebra · Mathematics 2019-02-04 Michel Hickel , Mickaël Matusinski

Let $d\nu$ be a measure in $\mathbb{R}^d$ obtained from adding a set of mass points to another measure $d\mu$. Orthogonal polynomials in several variables associated with $d\nu$ can be explicitly expressed in terms of orthogonal polynomials…

Classical Analysis and ODEs · Mathematics 2009-11-17 A. M. Delgado , L. Fernandez , T. E. Perez , M. A. Pinar , Y. Xu

We study one-parameter families of S-unit equations of the form f(t)u+g(t)v=h(t), where f, g, and h are univariate polynomials over a number field, t is an S-integer, and u and v are S-units. For many possible choices of f, g, and h, we are…

Number Theory · Mathematics 2007-05-23 Aaron Levin

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