Related papers: Almost-prime values of polynomials at prime argume…

We construct families of prime ideals in polynomial rings for which the number of associated primes of the second power (or higher powers) is exponential in the number of variables in the ring. We give a lower bound on the Ananyan-Hochster…

We prove bounds for the absolute sum of all level-$k$ Fourier coefficients for $(-1)^{p(x)}$, where polynomial $p:\mathbf{F}_2^n \to \mathbf{F}_2$ is of degree $1$ or degree $2$.

We provide lower bounds for p-adic valuations of multisums of factorial ratios which satisfy an Ap\'ery-like recurrence relation: these include Ap\'ery, Domb, Franel numbers, the numbers of abelian squares over a finite alphabet, and…

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length $N$ taking values of size close to $N^{3/4}$, which is the critical situation for several…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order…

Let N be a large enough natural number, A and B be subsets of {N+1, ... , 2N}. In this paper, we prove that there exists integers a, b with a belongs to A, b belongs to B such that ab=P_k^2 + O(P_k^{1-c}), where 0<c<1/2 and P_k denotes an…

We are interested in determining the bound of the average of the degrees of the irreducible characters whose degrees are not divisible by some prime $p$ that guarantees a finite group $G$ of odd order is $p$-nilpotent. We find a bound that…

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every $k$, the irreducible polynomials in $\mathbf{F}_q[t]$ contain configurations of the…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

Let $x>1$ be a large number. This note shows that the largest prime factor of the quadratic product $\prod_{x\leq n\leq 2x}\left(n^2+1 \right)$ satisfies the relation $p \geq x^{3/2}$ as $x$ tends to infinity. This improves the current…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

We prove that there are infinitely many solutions of $$ |\lambda_0+\lambda_1p+\lambda_2P_r|<p^{-\tau}, $$ where $r=3,$ $\tau=\frac1{118}$, and $\lambda_0$ is an arbitrary real number and $\lambda_1,\lambda_2\in\BR$ with $\lambda_2\neq0$ and…

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

Given $A\subseteq \mathbb{Z}$, the ratio set or the quotient set of $A$ is defined by $R(A):=\{a/b: a, b\in A, b\neq 0\}$. It is an open problem to study the denseness of $R(A)$ in the $p$-adic numbers when $A$ is the set of values attained…

Let p be a prime. In this paper we provide a lower bound for the number of almost p-rational characters of degree coprime to p in the principal p-block of a finite group of order divisible by p. We further describe the p-local structure of…

We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…