English
Related papers

Related papers: A note on Hayman's conjecture

200 papers

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

Algebraic Geometry · Mathematics 2013-10-08 Robert M. Guralnick , Michael E. Zieve

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Number Theory · Mathematics 2007-05-23 N. A. Carella

There are two fundamental problems motivated by Silverman's conversations over the years concerning the nature of the exact values of canonical heights of $f(z)\in\bar{\mathbb{Q}}(z)$ where $f$ has degree $d\geq 2$. The first problem is the…

Number Theory · Mathematics 2022-01-03 Khoa D. Nguyen

For differential equations $P(y^{(k)},y)=0,$ where $P$ is a polynomial, we prove that all meromorphic solutions having at least one pole are elliptic functions, possibly degenerate.

Classical Analysis and ODEs · Mathematics 2012-02-07 A. Eremenko , L. W. Liao , T. W. Ng

A result is proved concerning meromorphic functions of finite order in the plane such that all but finitely many zeros of the second derivative are zeros of the first derivative.

Complex Variables · Mathematics 2013-06-20 J. K. Langley

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

Number Theory · Mathematics 2010-08-24 Joseph H. Silverman

We give an explicit solution of a q-Riemann Hilbert problem which arises in the theory of orthogonal polynomials, prove that it is unique, and deduce several properties. Our new results include the asymptotic behaviour of zeroes in the…

Classical Analysis and ODEs · Mathematics 2021-10-18 Nalini Joshi , Tomas Lasic Latimer

Let $K$ be a field of characteristic zero, let $A_1=K[x][\partial ]$ be the first Weyl algebra. In this paper we prove the following two results. Assume there exists a non-zero polynomial $f(X,Y)\in K[X,Y]$, which has a non-trivial solution…

Algebraic Geometry · Mathematics 2025-06-25 Junhu Guo , Alexander Zheglov

Let $P(z)=z^{n}+a_{n-2}z^{n-2}+\cdots+a_0$ be a nonconstant polynomial and $S(z)$ be a nonzero rational function and denote $h(z)=S(z)e^{P(z)}$. Let $\theta\in(0,\pi/2n)$ be a constant and $\varepsilon>0$ be a small constant. It is shown…

Complex Variables · Mathematics 2026-01-16 Yueyang Zhang

It is known that if $f\colon {\mathbb R}^2 \to {\mathbb R}$ is a polynomial in each variable, then $f$ is a polynomial. We present generalizations of this fact, when ${\mathbb R}^2$ is replaced by $G\times H$, where $G$ and $H$ are…

General Topology · Mathematics 2021-05-26 Gergely Kiss , Miklós Laczkovich

Let f be a nonconstant meromorphic function in the plane and h be a nonconstant elliptic function. We show that if all zeros of f are multiple exept finitely many and T(r,h)=o{T(r,f)} as r tends to infinity, then f'=h has infinitely many…

Complex Variables · Mathematics 2011-11-04 Pai Yang , Shahar Nevo , Xuecheng Pang

The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…

Classical Analysis and ODEs · Mathematics 2020-03-19 Kyle R. Bryenton1 , Andrew R. Cameron , Keegan L. A. Kirk , Nasser Saad , Patrick Strongman , Nikita Volodin

We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…

Complex Variables · Mathematics 2013-01-24 Bernard Shiffman , Steve Zelditch

It is well known that the Bernoulli polynomials $\mathbf{B}_n(x)$ have nonintegral coefficients for $n \geq 1$. However, ten cases are known so far in which the derivative $\mathbf{B}'_n(x)$ has only integral coefficients. One may assume…

Number Theory · Mathematics 2024-03-01 Bernd C. Kellner

In this paper we show that a polynomial equation admits infinitely many prime-tuple solutions assuming only that the equation satisfies suitable local conditions and the polynomial is sufficiently non-degenerate algebraically. Our notion of…

Number Theory · Mathematics 2019-11-13 Stanley Yao Xiao , Shuntaro Yamagishi

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

Number Theory · Mathematics 2025-11-07 Péter P. Varjú , Max Wenqiang Xu

We show that the decidability of an amplification of Hilbert's Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

In this paper we prove that the PDE $p(D)f=q,$ where $p$ and $q$ are multivariate polynomials, has a solution in the space of polynomials of total degree not exceeding ${n+s},$ where $n$ is the degree of $q$ and $s$ is the zero order of…

Analysis of PDEs · Mathematics 2021-06-02 Anna R. Gharibyan , Hakop A. Hakopian

Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction…

Computational Complexity · Computer Science 2016-05-30 Martin Lück