A note on simultaneous Diophantine approximation in positive characteristic
Let k be an (imaginary or real) abelian number field whose conductor has two distinct prime divisors. We shall construct a basis for the group C of circular units in k and compute the index of C in the group E of units in k. This result is a generalization of Theorem 3.3 in a previous paper [1].
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
The paper studies the structure of the ring A of arithmetical functions, where the multiplication is defined as the Dirichlet convolution. It is proven that A itself is not a discrete valuation ring, but a certain extension of it is constructed,this extension being a discrete valuation ring. Finally, the metric structure of the ring A is examined.
Introduction. Recently J. Rutkowski (see [3]) has defined the p-adic analogue of the Walsh system, which we shall denote by . The system is defined in the space C(ℤₚ,ℂₚ) of ℂₚ-valued continuous functions on ℤₚ. J. Rutkowski has also considered some questions concerning expansions of functions from C(ℤₚ,ℂₚ) with respect to . This paper is a remark to Rutkowski’s paper. We define another system in C(ℤₚ,ℂₚ), investigate its properties and compare it to the system defined by Rutkowski. The system...
We show that the number of squares in an arithmetic progression of length is at most , for certain absolute positive constants , . This improves the previous result of Bombieri, Granville and Pintz [1], where one had the exponent in place of our . The proof uses the same ideas as in [1], but introduces a substantial simplification by working only with elliptic curves rather than curves of genus as in [1].
Let A be a multiplicative subgroup of . Define the k-fold sumset of A to be . We show that for . In addition, we extend a result of Shkredov to show that for .
Let a,b,c be fixed coprime positive integers with mina,b,c > 1, and let m = maxa,b,c. Using the Gel’fond-Baker method, we prove that all positive integer solutions (x,y,z) of the equation satisfy maxx,y,z < 155000(log m)³. Moreover, using that result, we prove that if a,b,c satisfy certain divisibility conditions and m is large enough, then the equation has at most one solution (x,y,z) with minx,y,z > 1.
In the paper we discuss the following type congruences: where is a prime, , , and are various positive integers with , and . Given positive integers and , denote by the set of all primes such that the above congruence holds for every pair of integers . Using Ljunggren’s and Jacobsthal’s type congruences, we establish several characterizations of sets and inclusion relations between them for various values and . In particular, we prove that for all , and , and for...