相关论文: The Distance to a Squarefree Polynomial Over $\mat…

In this paper, we consider a variant of Tur\'an's problem on the distance from an integer polynomial in $\mathbb{Z}[x]$ to the nea\-rest irreducible polynomial in $\mathbb{Z}[x]$. We prove that for any polynomial $f \in \mathbb{Z}[x]$,…

We study representation of square-free polynomials in the polynomial ring F[t] over a finite field F by polynomials in F[t][x]. This is a function field version of the well-studied problem of representing squarefree integers by integer…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

For nonempty subsets $S_0, \dots, S_{n-1}$ of a (large enough) finite field $\mathbb{F}$ satisfying $$|S_1|, \dots, |S_{n-1}| > 2 \quad \mathrm{or} \quad |S_1|,|S_{n-1}| > n - 1,$$ we show that there exist $a_0 \in S_0, \dots, a_{n-1} \in…

Let f be a square-free polynomial in Fq[t][x] where Fq is a field of q elements. We view f as a polynomial in the variable x with coefficients in the ring Fq[t]. We study squarefree values of f in sparse subsets of Fq[t] which are given by…

It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…

Given f in Z[x_1,...,x_n], we compute the density of x in Z^n such that f(x) is squarefree, assuming the abc conjecture. Given f,g in Z[x_1,...,x_n], we compute unconditionally the density of x in Z^n such that gcd(f(x),g(x))=1. Function…

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

We investigate the density of square-free values of polynomials with large coefficients over the rational function field $\mathbb{F}_q[t]$. Some interesting questions answered as special cases of our results include the density of…

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…

We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…

The number of square-free integers in $x$ consecutive values of any polynomial $f$ is conjectured to be $c_fx$, where the constant $c_f$ depends only on the polynomial $f$. This has been proven for degrees less or equal to 3. Granville was…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

We show that for Gaussian random SU(2)polynomials of a large degree $N$ the probability that there are no zeros in the disk of radius $r$ is less than $e^{-c_{1,r} N^2}$, and is also greater than $e^{-c_{2,r} N^2}$. Enroute to this result,…

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

We consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the…

We determine all F,G in C[X] of degree at least 2 for which the semigroup generated by F and G under composition is not the free semigroup on the letters F and G. We also solve the same problem for F,G in X^2 C[[X]], and prove partial…