English
Related papers

Related papers: Arithmetic properties of multiplier polynomials fo…

200 papers

This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…

Dynamical Systems · Mathematics 2023-09-28 Rin Gotou

We identify the complex plane C with the open unit disc D={z:|z|<1} by the homeomorphism z --> z/(1+|z|). This leads to a compactification $\bar{C}$ of C, homeomorphic to the closed unit disc. The Euclidean metric on the closed unit disc…

Complex Variables · Mathematics 2016-11-18 V. Nestoridis , N. Papadatos

Morton and Vivaldi defined the polynomials whose roots are parabolic parameters for a one-parameter family of polynomial maps. We call these polynomials delta factors. They conjectured that delta factors are irreducible for the family…

Number Theory · Mathematics 2025-09-29 Junnosuke Koizumi , Yuya Murakami , Kaoru Sano , Kohei Takehira

In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…

Representation Theory · Mathematics 2022-10-17 Friedrich Knop

It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…

Number Theory · Mathematics 2011-11-10 Sandro Mattarei

We show that there exist real parameters $c$ for which the Julia set $J_c$ of the quadratic map $z^2+c$ has arbitrarily high computational complexity. More precisely, we show that for any given complexity threshold $T(n)$, there exist a…

Dynamical Systems · Mathematics 2020-03-23 Cristobal Rojas , Michael Yampolsky

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

Number Theory · Mathematics 2025-10-24 Lingyu Guo , Victor Zhenyu Guo , Mengyao Jing

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

Number Theory · Mathematics 2020-03-20 Changhao Chen , Igor E. Shparlinski

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…

Operator Algebras · Mathematics 2008-04-16 Mihai Popa

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

Number Theory · Mathematics 2026-03-26 Tomohiro Yamada

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

Combinatorics · Mathematics 2021-11-02 Zhicheng Gao

In this article, we present an explicit formula for the $c$th nilpotent multiplier (the Baer invariant with respect to the variety of nilpotent groups of class at most $c\geq 1$) of the $n$th nilpotent product of some cyclic groups…

Group Theory · Mathematics 2011-05-17 Azam Hokmabadi , Behrooz Mashayekhy , Fahimeh Mohammadzadeh

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

Symbolic Computation · Computer Science 2016-07-19 James H. Davenport , Matthew England

We discuss tangent maps related to the multipliers of periodic points of a typical one-dimensional polynomial map.

Algebraic Geometry · Mathematics 2015-06-05 Yuri G. Zarhin

We prove pointwise bounds for two-parameter families of Jacobi polynomials. Our bounds imply estimates for a class of functions arising from the spectral analysis of distinguished Laplacians and sub-Laplacians on the unit sphere in…

Classical Analysis and ODEs · Mathematics 2022-02-28 Valentina Casarino , Paolo Ciatti , Alessio Martini

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

We prove the existence of complex polynomials $p(z)$ of degree $n$ and $q(z)$ of degree $m<n$ such that the harmonic polynomial $ p(z) + \overline{q(z)}$ has at least $\lceil n \sqrt{m} \rceil$ many zeros. This provides an array of new…

Complex Variables · Mathematics 2023-09-01 Erik Lundberg

We study a one parameter family of cubic self-inversive polynomials that "envelope" conic sections in the following sense. Provided the three roots of the polynomial lie on the unit circle, when you draw the triangle connecting the roots,…

Complex Variables · Mathematics 2015-11-05 William Calbeck