The polynomial functions f, f,…, f are found to have highest common factor h for a set of values of the variables x, x,…,x whose asymptotic density is 1/h∑d∣hμ(d)Π ϱ(f, dh)/dΠp∣h(1−Πϱ(f, p)/p) For the special case f(x) = f(x) = … = f(x) = x and h = 1 the above formula reduces to Π(1 − 1/p) = 1/ζ(m), the density if m-tuples with highest common factor 1. Necessary and sufficient conditions on the polynomials f, f,…, f for the asymptotic density to be zero are found. In particular it is shown that either the polynomials may never have highest common factor h or else h is the highest common factor infinitely often and in fact with positive density
We study density modulo 1 of the sequence with general term ∑ m≤n f (G(m)) where f is the strongly m...
AbstractLet ƒ(x) be a monic polynomial of degree n with complex coefficients, which factors as ƒ(x) ...
AbstractLet ƒ(x) be a polynomial of degree n with complex coefficients, which factors as ƒ(x) = g(x)...
AbstractThe polynomial functions f1, f2,…, fm are found to have highest common factor h for a set of...
AbstractLet m ≥ 2, f1, f2,…, fm arbitrary nonconstant polynomials with integer coefficients, and h a...
Let f be a probability density function on (a, b) ⊂ (0,∞), and consider the class Cf of all probabil...
We find the generating function for the number of k-tuples of monic polynomials of degree n over Fq ...
Letf∈ Fq[x] be a monic polynomial of degreen, and let Φ(f) denote the number of polynomials in Fq[x]...
In this lecture, we give precise necessary conditions for the vanishing of re-sultants. We have alre...
AbstractIn a 1993 paper Beauzamy, Trevisan and Wang derived a single-factor coefficient bound, one w...
Hirschman and Widder introduced a class of Pólya frequency functions given by linear combinations of...
AbstractFor any continuous function f:[−1, 1]↦C and any p∈(0, ∞), let ‖f‖p≔(2−1∫1−1|f(x)|pdx)1/p; in...
AbstractThere are many known asymptotic estimates for the expected number of real zeros of polynomia...
Abstract. Rényi’s result on the density of integers whose prime factorizations have excess multipli...
Random sampling is a simple but powerful method in statistics and the design of randomized algorithm...
We study density modulo 1 of the sequence with general term ∑ m≤n f (G(m)) where f is the strongly m...
AbstractLet ƒ(x) be a monic polynomial of degree n with complex coefficients, which factors as ƒ(x) ...
AbstractLet ƒ(x) be a polynomial of degree n with complex coefficients, which factors as ƒ(x) = g(x)...
AbstractThe polynomial functions f1, f2,…, fm are found to have highest common factor h for a set of...
AbstractLet m ≥ 2, f1, f2,…, fm arbitrary nonconstant polynomials with integer coefficients, and h a...
Let f be a probability density function on (a, b) ⊂ (0,∞), and consider the class Cf of all probabil...
We find the generating function for the number of k-tuples of monic polynomials of degree n over Fq ...
Letf∈ Fq[x] be a monic polynomial of degreen, and let Φ(f) denote the number of polynomials in Fq[x]...
In this lecture, we give precise necessary conditions for the vanishing of re-sultants. We have alre...
AbstractIn a 1993 paper Beauzamy, Trevisan and Wang derived a single-factor coefficient bound, one w...
Hirschman and Widder introduced a class of Pólya frequency functions given by linear combinations of...
AbstractFor any continuous function f:[−1, 1]↦C and any p∈(0, ∞), let ‖f‖p≔(2−1∫1−1|f(x)|pdx)1/p; in...
AbstractThere are many known asymptotic estimates for the expected number of real zeros of polynomia...
Abstract. Rényi’s result on the density of integers whose prime factorizations have excess multipli...
Random sampling is a simple but powerful method in statistics and the design of randomized algorithm...
We study density modulo 1 of the sequence with general term ∑ m≤n f (G(m)) where f is the strongly m...
AbstractLet ƒ(x) be a monic polynomial of degree n with complex coefficients, which factors as ƒ(x) ...
AbstractLet ƒ(x) be a polynomial of degree n with complex coefficients, which factors as ƒ(x) = g(x)...