Results 21 to 30 of about 485 (68)
Note on the number of divisors of reducible quadratic polynomials
In a recent paper, Lapkova uses a Tauberian theorem to derive the asymptotic formula for the divisor sum $\sum_{n \leq x} d( n (n+v))$ where $v$ is a fixed integer and $d(n)$ denotes the number of divisors of $n$.
Dudek, Adrian W. +2 more
core +1 more source
We show that there are at most $O_{n,\epsilon}(H^{n-2+\sqrt{2}+\epsilon})$ monic integer polynomials of degree $n$ having height at most $H$ and Galois group different from the full symmetric group $S_n$, improving on the previous 1973 world record $O_{n}
Dietmann, Rainer
core +1 more source
Some inequalities and an application of exponential polynomials
In the paper, with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem for the Stirling numbers of the first and second kinds, the author presents an explicit formula and an identity for ...
Feng Qi (祁锋)
semanticscholar +1 more source
Some special finite sums related to the three-term polynomial relations and their applications
We define some finite sums which are associated with the Dedekind type sums and Hardy-Berndt type sums. The aim of this paper is to prove a reciprocity law for one of these sums. Therefore, we define a new function which is related to partial derivatives
Elif Çeti̇n, Y. Simsek, I. N. Cangul
semanticscholar +2 more sources
Inequalities for Lorentz polynomials [PDF]
We prove a few interesting inequalities for Lorentz polynomials including Nikolskii-type inequalities. A highlight of the paper is a sharp Markov-type inequality for polynomials of degree at most n with real coefficients and with derivative not vanishing
Erdelyi, Tamas
core +2 more sources
Squarefree values of polynomial discriminants II
We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out maximal orders
Manjul Bhargava +2 more
doaj +1 more source
Classification and irreducibility of a class of integer polynomials
We find all integer polynomials of degree dd that take the values ±1\pm 1 at exactly dd integer arguments, and determine the irreducibility of these polynomials by means of an elementary approach.
Chen Yizhi, Zhao Xiangui, Zhou Xuan
doaj +1 more source
Improvements on dimension growth results and effective Hilbert’s irreducibility theorem
We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree d, over any global field.
Raf Cluckers +4 more
doaj +1 more source
A Swan-like note for a family of binary pentanomials
In this note, we employ the techniques of Swan (Pacific J. Math. 12(3): 1099-1106, 1962) with the purpose of studying the parity of the number of the irreducible factors of the penatomial $X^n+X^{3s}+X^{2s}+X^{s}+1\in\mathbb{F}_2[X]$, where $s$ is even ...
Kapetanakis, Giorgos
core +1 more source
Root separation for irreducible integer polynomials
We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).Comment: 8 pages ...
Bugeaud, Yann, Dujella, Andrej
core +1 more source

