相关论文: On Primes Represented by Quadratic Polynomials

In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…

We use the Hardy-Littlewood circle method to study primes of the form $n_1^u + n_2^v + k$, on average.

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

In this paper we investigate the recent advances by Zhang, Maynard and Pintz towards Polignac's conjecture and give some new results concerning the relationship between Polignac numbers and arithmetic progressions.

A "Littlewood polynomial" is a polynomial whose coefficients are all 1 or -1. The set of all complex roots of all Littlewood polynomials exhibits many complicated, beautiful and fascinating patterns. Some fractal regions of this set closely…

In this short note we establish new refinements of multidimensional Szemeredi and polynomial van der Waerden theorems along the shifted primes.

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

In 2002, M.Ram Murty showed that if p is a prime with k-adic expansion :$p = \sum_{i = 0}^n a_i k^i$ , then the polynomial $f(x) = \sum_{i = 0}^n a_ix^i$ is irreducible in $\mathbb{Z}[x]$.When $k = 10$ , it's a result of A.Cohn. I think…

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…

Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups ($GL_n$). The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for…

A celebrated theorem of Delange gives a sufficient condition for an arithmetic function to be the sum of the associated Ramanujan expansion with the coefficients provided by a previous result of Wintner. By applying the Delange theorem to…

In 1976, Gallagher showed that the Hardy--Littlewood conjectures on prime $k$-tuples imply that the distribution of primes in log-size intervals is Poissonian. He did so by computing average values of the singular series constants over…

We prove the logarithmic convexity of certain quantities, which measure the quadratic exponential decay at infinity and within two characteristic hyperplanes of solutions of Schr\"odinger evolutions. As a consequence we obtain some…

Defining a family of recurrences, we generalize Comtet's formula for the generating function of the enumeration of indecomposable permutations. Consequently, we generalize Panaitopol's asymptotic expansion for the prime counting function,…

In this note, simple proofs of certain well-known results involving the positive square root of positive matrices are given.

In this paper we study quadratic forms which are universal when restricted to almost prime inputs, establishing finiteness theorems akin to the Conway--Schneeberger 15 theorem.

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and…

We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.