English
Related papers

Related papers: Virtual Roots of Real Polynomials

200 papers

In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…

Rings and Algebras · Mathematics 2022-02-21 Johannes Siegele , Martin Pfurner , Hans-Peter Schröcker

Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…

Dynamical Systems · Mathematics 2022-12-13 B. V. Rajarama Bhat , Chaitanya Gopalakrishna

We generalize the index polynomial invariant to the case of virtual tangles. Three polynomial invariants result from this generalization; we give a brief overview of their definition and some basic properties.

Geometric Topology · Mathematics 2019-04-23 Nicolas Petit

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

Probability · Mathematics 2014-07-28 Igor E. Pritsker , Aaron M. Yeager

Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…

Rings and Algebras · Mathematics 2024-12-03 Zijia Li , Hans-Peter Schröcker , Mikhail Skopenkov , Daniel F. Scharler

A method is proposed with which the locations of the roots of the monic symbolic quintic polynomial $x^5 + a_4 x^4 + a_3 x^3 + a_2 x^2 + a_1 x + a_0$ can be determined using the roots of two resolvent quadratic polynomials: $q_1(x) = x^2 +…

General Mathematics · Mathematics 2022-06-15 Emil M. Prodanov

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

Number Theory · Mathematics 2012-10-31 Gary L. Mullen , Daqing Wan , Qiang Wang

The expected number of zeros of a random real polynomial of degree $N$ asymptotically equals $\frac{2}{\pi}\log N$. On the other hand, the average fraction of real zeros of a random trigonometric polynomial of increasing degree $N$…

Algebraic Geometry · Mathematics 2022-06-29 Boris Kazarnovskii

The aim of this paper is to prove that a large class of quaternionic slice regular functions result to be (ramified) covering maps. By means of the topological implications of this fact and by providing further topological structures, we…

Complex Variables · Mathematics 2022-06-07 Amedeo Altavilla , Samuele Mongodi

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

We show that a real homogeneous polynomial f(x,y) with distinct roots and degree d greater or equal than 3 has d real roots if and only if for any (a,b) not equal to (0,0) the polynomial af_x+bf_y has d-1 real roots. This answers to a…

Algebraic Geometry · Mathematics 2010-06-29 Antonio Causa , Riccardo Re

Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…

Computer Science and Game Theory · Computer Science 2024-03-01 Alexandros Hollender , Chester Lawrence , Erel Segal-Halevi

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

Numerical Analysis · Mathematics 2025-04-15 Yousra Gati , Vladimir Petrov Kostov , Mohamed Chaouki Tarchi

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of…

Geometric Topology · Mathematics 2013-12-31 Zhiyun Cheng , Hongzhu Gao

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

Probability · Mathematics 2007-05-23 Andrew McLennan

The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…

Algebraic Geometry · Mathematics 2019-11-19 Macarena Ansola , Antonio Díaz-Cano , M. Angeles Zurro

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

We prove two recent conjectures of Bourn and Erickson (2023) regarding the real-rootedness of a certain family of polynomials $N_n(t)$ as well as the sum of their coefficients. These polynomials arise as the numerators of generating…

Combinatorics · Mathematics 2024-07-09 Ming-Jian Ding , Jiang Zeng

We present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in $B_{\alpha} \in L[y]$, where $L=\QQ(\alpha)$ is a simple algebraic extension of the rational numbers. We…

Symbolic Computation · Computer Science 2011-05-10 Adam Strzebonski , Elias Tsigaridas