English
Related papers

Related papers: Repr\'esentations d\'eterminantales effectives des…

200 papers

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

Commutative Algebra · Mathematics 2025-02-11 Piotr Maćkowiak , Motaz Mokatren

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Number Theory · Mathematics 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu

In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…

Numerical Analysis · Mathematics 2019-03-21 Massimo Salvi

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Functional Analysis · Mathematics 2012-08-14 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Hugo J. Woerdeman

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm

The paper proves sum-of-square-of-rational-function based representations (shortly, sosrf-based representations) of polynomial matrices that are positive semidefinite on some special sets: $\mathbb{R}^n;$ $\mathbb{R}$ and its intervals…

Optimization and Control · Mathematics 2019-03-29 Thanh-Hieu Le , Nhat-Thien Pham

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

Algebraic Geometry · Mathematics 2014-11-24 O. G. Styrt

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…

Rings and Algebras · Mathematics 2014-10-10 Osnel Broche , Ángel del Río

For every bivariate polynomial $p(z_1, z_2)$ of bidegree $(n_1, n_2)$, with $p(0,0)=1$, which has no zeros in the open unit bidisk, we construct a determinantal representation of the form $$p(z_1,z_2)=\det (I - K Z),$$ where $Z$ is an…

Functional Analysis · Mathematics 2013-07-01 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Victor Vinnikov , Hugo J. Woerdeman

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

Classical Analysis and ODEs · Mathematics 2015-04-08 Vladimir Petrov Kostov

We study the problem of representing multivariate polynomials with rational coefficients, which are nonnegative and strictly positive on finite semialgebraic sets, using rational sums of squares. We focus on the case of finite semialgebraic…

Algebraic Geometry · Mathematics 2025-12-16 Lorenzo Baldi , Teresa Krick , Bernard Mourrain

We give the first exact determinantal formula for the resultant of an unmixed sparse system of four Laurent polynomials in three variables with arbitrary support. This follows earlier work by the author on exact formulas for bivariate…

Algebraic Geometry · Mathematics 2009-09-29 Amit Khetan

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

Probability · Mathematics 2023-02-09 Paweł J. Szabłowski

The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…

Classical Analysis and ODEs · Mathematics 2022-07-08 David A. Ross

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

Logic in Computer Science · Computer Science 2015-07-01 Friedrich Neurauter , Aart Middeldorp

We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and $(1-o_n(1))\cdot 2^{n^2}$ monomials with non-zero coefficients. In contrast, we show…

Discrete Mathematics · Computer Science 2020-02-25 Gal Beniamini , Noam Nisan

In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate…

Symbolic Computation · Computer Science 2011-02-24 Jin-San Cheng , Xiao-Shan Gao , Leilei Guo

We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…

Functional Analysis · Mathematics 2025-06-06 Michael T. Jury , George Roman

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

Symbolic Computation · Computer Science 2019-11-18 Rémi Imbach , Victor Y. Pan