Related papers: On Roots of Eigenpolynomials for Degenerate Exactl…

In this work we consider a given root of a family of n-degree polynomials as a one-variable function that depends only on the independent term. Then we prove that this function satisfies several ordinary differential equations (ODE). More…

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…

In this article, we set up the continuous maximal regularity theory for a class of linear differential operators on manifolds with singularities. These operators exhibit degenerate or singular behaviors while approaching the singular ends.…

In this paper, we are concerned with conditions under which $[p(T)]^*=\bar{p}(T^*)$, where $p(z)$ is a one-variable complex polynomial, and $T$ is an unbounded, densely defined, and linear operator. Then, we deal with the validity of the…

Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…

We start with a random polynomial $P^{N}(z)$ of degree $N$ with independent coefficients. We then consider a new polynomial $P_{t}^{N}$ obtained by $\lceil Nt\rceil$ applications of a fractional differential operator of the form $z^{a}…

In this article, we study and settle several structural questions concerning the exact solvability of the Olshanetsky-Perelomov quantum Hamiltonians corresponding to an arbitrary root system. We show that these operators can be written as…

We investigate Drinfeld modular polynomials parametrizing $T$-isogenies between Drinfeld $\mathbb{F}_q[T]$-modules of rank $r\geq 2$. By providing an explicit classification of such isogenies, we derive explicit bounds on the $T$-degrees of…

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

For polynomials in independent Wigner matrices, we prove convergence of the largest singular value to the operator norm of the corresponding polynomial in free semicircular variables, under fourth moment hypotheses. We actually prove a more…

The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…

After reconsidering the theorem of continuity of the roots of a polynomial in terms of its coefficients in the deformation framework, we study the stability of the greater common divisor of two polynomials compared to perturbations on their…

Given an integral domain $A$, a monic polynomial $P$ of degree $n$ with coefficients in $A$ and a divisor $p$ of $n$, invertible in $A$, there is a unique monic polynomial $Q$ such that the degree of $P-Q^{p}$ is minimal for varying $Q$.…

We establish a parameter-dependent pseudo-differential calculus on an infinite cylinder, regarded as a manifold with conical exits to infinity. The parameters are involved in edge-degenerate form, and we formulate the operators in terms of…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

We give a Schinzel-Zassenhaus-type lower bound for the maximum modulus of roots of a monic integer polynomial with all roots symmetric with respect to the unit circle. Our results extend a recent work of Dimitrov, who proved the general…

We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these…

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…

We study the computational complexity of singularity for multilinear maps. While the determinant characterizes singularity for matrices, its multilinear analogue -- the hyperdeterminant -- is defined only in boundary format and quickly…