English
Related papers

Related papers: Trinomials with given roots

200 papers

We detail an algorithm that -- for all but a $\frac{1}{\Omega(\log(dH))}$ fraction of $f\in\mathbb{Z}[x]$ with exactly $3$ monomial terms, degree $d$, and all coefficients in $\{-H,\ldots, H\}$ -- produces an approximate root (in the sense…

Algebraic Geometry · Mathematics 2025-05-07 Emma Boniface , Weixun Deng , J. Maurice Rojas

We consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary…

Algebraic Geometry · Mathematics 2026-02-25 Daniel Bath , Willem Veys

For an odd positive integer $n\ge 5$, assuming the truth of the $abc$ conjecture, we show that for a positive proportion of pairs $(a,b)$ of integers the trinomials of the form $t^n+at+b (a,b\in \mathbb Z)$ are irreducible and their…

Number Theory · Mathematics 2008-08-05 Anirban Mukhopadhyay , M. Ram Murty , Kotyada Srinivas

We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

Number Theory · Mathematics 2014-05-26 Yann Bugeaud , Andrej Dujella

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

Representation Theory · Mathematics 2026-02-24 Frank Lübeck

Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…

Number Theory · Mathematics 2018-12-26 Doug Bowman , James Mc Laughlin

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Number Theory · Mathematics 2017-07-12 Randell Heyman

The supremum of reduction numbers of ideals having principal reductions is expressed in terms of the integral degree, a new invariant of the ring, which is finite provided the ring has finite integral closure. As a consequence, one obtains…

Commutative Algebra · Mathematics 2007-06-25 José M. Giral , Francesc Planas-Vilanova

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

Number Theory · Mathematics 2023-04-18 H. E. A. Campbell , David L. Wehlau

Consider a system of two polynomial equations in two variables: $$F(X,Y)=G(X,Y)=0$$ where $F \in \rr[X,Y]$ has degree $d \geq 1$ and $G \in \rr[X,Y]$ has $t$ monomials. We show that the system has only $O(d^3t+d^2t^3)$ real solutions when…

Computational Complexity · Computer Science 2014-07-24 Pascal Koiran , Natacha Portier , Sébastien Tavenas

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

We prove that in each degree divisible by 2 or 3, there are infinitely many totally real number fields that require universal quadratic forms to have arbitrarily large rank.

Number Theory · Mathematics 2023-07-18 Vítězslav Kala

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

Numerical Analysis · Mathematics 2024-11-26 Prashant Batra

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

Number Theory · Mathematics 2012-04-10 Martin Widmer

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Rings and Algebras · Mathematics 2007-05-23 Constantin M. Petridi , P. B. Krikelis

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

Number Theory · Mathematics 2024-07-24 Aleksandr Tuxanidy , Daniel Panario

We consider finite extensions of the rationals which are unramified except for at 2 and infinity. We show there are no such extensions of degrees 9 through 15.

Number Theory · Mathematics 2007-10-16 John W. Jones

We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…

Dynamical Systems · Mathematics 2019-02-20 Igors Gorbovickis