On S-Equivalence of Seifert Matrices.
On series, integrals and continued fractions, III
On Sets Characterizing Additive Arithmetical Functions.
On sets characterizing additive arithmetical functions, I
On sets characterizing additive arithmetical functions, I
On sets characterizing number-theoretical functions (II) (The set of "prime plus one"'s is a set of quasi-uniqueness)
On sets of integers containing k elements in arithmetic progression
On sets of natural numbers without solution to a noninvariant linear equation
On sets of polynomials whose difference set contains no squares
Let be the polynomial ring over the finite field , and let be the subset of containing all polynomials of degree strictly less than N. Define D(N) to be the maximal cardinality of a set for which A-A contains no squares of polynomials. By combining the polynomial Hardy-Littlewood circle method with the density increment technology developed by Pintz, Steiger and Szemerédi, we prove that .
On sets of weak uniform distribution
On sets S.
On Shanks' algorithm for computing the continued fraction of .
On Shank's algorithm for modular square roots.
On shifted primes
On Shioda's problem about Jacobi sums
On Shioda's problem about Jacobi sums II
On short sums of certain multiplicative functions.
On short zero-sum subsequences. II.
On Sidon sequences of even orders
On Siegel modular forms