English
Related papers

Related papers: Time-dependent polynomials with one multiple root …

200 papers

Let $q$ be a prime power. We estimate the number of tuples of degree bounded monic polynomials $(Q_1,\ldots,Q_v) \in (\mathbb{F}_q[z])^v$ that satisfy given pairwise coprimality conditions. We show how this generalises from monic…

Number Theory · Mathematics 2017-07-12 Juan Arias de Reyna , Randell Heyman

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Mathematical Physics · Physics 2017-06-13 Francesco Calogero , Francois Leyvraz

The colored Jones polynomial is a series of one variable Laurent polynomials J(K,n) associated with a knot K in 3-space. We will show that for an alternating knot K the absolute values of the first and the last three leading coefficients of…

Geometric Topology · Mathematics 2007-05-23 Oliver T. Dasbach , Xiao-Song Lin

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…

Combinatorics · Mathematics 2017-01-03 Jesús A. De Loera , David C. Haws , Matthias Köppe

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal

The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…

Classical Analysis and ODEs · Mathematics 2017-10-31 Evgeniy Pustylnik

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

Let $f(x)\in {\mathbb Z}[x]$ be a monic polynomial of degree $N$ that is irreducible over ${\mathbb Q}$. We say $f(x)$ is \emph{monogenic} if $\Theta=\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers ${\mathbb…

Number Theory · Mathematics 2023-03-31 Lenny Jones

For $n$-body problem with arbitrary positive masses, we prove there are regularizable collinear periodic solutions for any ordering of the masses, going from a simultaneous binary collision to another in half of a period with half of the…

Dynamical Systems · Mathematics 2024-09-05 Guowei Yu

Suppose we have a Nikishin system of $p$ measures with the $k$th generating measure of the Nikishin system supported on an interval $\Delta_k\subset\er$ with $\Delta_k\cap\Delta_{k+1}=\emptyset$ for all $k$. It is well known that the…

Classical Analysis and ODEs · Mathematics 2023-08-30 Steven Delvaux , Abey López García , Guillermo López Lagomasino

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

We complete the study of some periods of polynomials in (n+1) variables with (n+2) monomials in computing the behavior of these periods in the natural parameter for such a polynomial.

Algebraic Geometry · Mathematics 2014-02-27 Daniel Barlet

In this work nonlinear pseudo-differential equations with the infinite number of derivatives are studied. These equations form a new class of equations which initially appeared in p-adic string theory. These equations are of much interest…

Mathematical Physics · Physics 2009-11-10 V. S. Vladimirov , Ya. I. Volovich

Let X be a subset of R^n whose interior is connected and dense in X, ordered by a polyhedral cone in R^n with nonempty interior. Let T be a monotone homeomorphism of X whose periodic points are dense. Then T is periodic.

Dynamical Systems · Mathematics 2016-11-29 Morris W. Hirsch

We study a set of topological roots of the local Bernstein-Sato polynomial of arbitrary plane curve singularities. These roots are characterized in terms of certain divisorial valuations and the numerical data of the minimal log resolution.…

Algebraic Geometry · Mathematics 2024-07-24 Guillem Blanco

This survey revolves around the question how the roots of a monic polynomial (resp. the spectral decomposition of a linear operator), whose coefficients depend in a smooth way on parameters, depend on those parameters. The parameter…

Functional Analysis · Mathematics 2024-10-23 Adam Parusiński , Armin Rainer

We consider an hierarchy of integrable 1+2-dimensional equations related to Lie algebra of the vector fields on the line. The solutions in quadratures are constructed depending on $n$ arbitrary functions of one argument. The most…

Exactly Solvable and Integrable Systems · Physics 2014-08-27 V. E. Adler , A. B. Shabat

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.

Mathematical Physics · Physics 2007-05-23 M. Lorente

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

Computational Complexity · Computer Science 2022-10-14 Alberto Dennunzio , Enrico Formenti , Luciano Margara