Related papers: On Roots of Eigenpolynomials for Degenerate Exactl…

We define and discuss properties of the class of unbounded operators which attain minimum modulus. We establish a relationship between this class and the class of norm attaining bounded operators and compare the properties of both. Also we…

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

In this paper we obtain new results concerning maximum modulus of the polar derivative of a polynomial with restricted zeros. Our results generalize and refine upon the results of Aziz and Shah [An integral mean estimate for polynomial,…

We study the spectral problems associated with the finite-difference operators $H_N = 2 \cosh(p) + V_N(x)$, where $V_N(x)$ is an arbitrary polynomial potential of degree $N$. These systems can be regarded as a solvable deformation of the…

A general classification of linear differential and finite-difference operators possessing a finite-dimensional invariant subspace with a polynomial basis is given. The main result is that any operator with the above property must have a…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

In this paper, we consider the degenerate Frobenius-Euler polynomials and investigate some identities of these polynomials.

We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…

We characterize the validity of the Maximum Principle in bounded domains for fully nonlinear degenerate elliptic operators in terms of the sign of a suitably defined generalized principal eigenvalue. Here, maximum principle refers to the…

This work investigates the fundamental properties of the degenerate preconditioned resolvent under restricted monotonicity. We extend key notions of non-expansiveness and demiclosedness to the degenerate case. By deriving an explicit…

If a linear differential operator with rational function coefficients is reducible, its factors may have coefficients with numerators and denominatorsof very high degree. When the base field is $\mathbb C$, we give a completely explicit…

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

For certain one-dimensional Schroedinger-type difference operators with a complex potential, a "complete" set of exponentially decaying eigenvectors is shown to exist. "Completeness" entails that the parameters involved are obtained through…

Recently, Bruinier and Ono found an algebraic formula for the partition function in terms of traces of singular moduli of a certain non-holomorphic modular function. In this paper we prove that the rational polynomial having these singuar…

We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…

Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…