Additive Hilbert's Theorem 90 in the ring of algebraic integers

For a number field K, we give a complete characterization of algebraic numbers which can be expressed by a difference of two K-conjugate algebraic integers. These turn out to be the algebraic integers whose Galois group contains an element, acting as a cycle on some collection of conjugates which sum to zero. Hence there are no algebraic integers which can be written as a difference of two conjugate algebraic numbers but cannot be written as a difference of two conjugate algebraic integers. A generalization of the construction to a commutative ring is also given. Furthermore, we show that for n ?_ 3 there exist algebraic integers which can be written as a linear form in n K-conjugate algebraic numbers but cannot be written by the same linear form in K-conjugate algebraic integers.     

On the independence of Heegner points in the function field case

Let ∞ be a fixed place of a global function field k. Let E be an elliptic curve defined over k which has split multiplicative reduction at ∞ and fix a modular parametrization ΦE:X₀(N)→E. Let be Heegner points associated to the rings of integers of distinct quadratic “imaginary” fields K₁,…,Kr over (k,∞). We prove that if the “prime-to-2p” part of the ideal class numbers of ring of integers of K₁,…,Kr are larger than a constant C=C(E,ΦE) depending only on E and ΦE, then the points P₁,…,Pr are independent in . Moreover, when k is rational, we show that there are infinitely many imaginary quadratic fields for which the prime-to-2p part of the class numbers are larger than C.     

On the prime power factorization of n!

For a fixed prime q, let eq(n) denote the order of q in the prime factorization of n!. For two fixed integers m?2 and r with 0?r?m−1, let A(x;m,q,r) denote the numbers of positive integers n?x for which . In this paper we shall prove a sharp asymptotic formula of A(x;m,q,r).     

Pillai's conjecture revisited

We prove a generalization of an old conjecture of Pillai (now a theorem of Stroeker and Tijdeman) to the effect that the Diophantine equation 3^x−2^y=c has, for |c|>13, at most one solution in positive integers x and y. In fact, we show that if N and c are positive integers with N?2, then the equation |(N+1)^x−N^y|=c has at most one solution in positive integers x and y, unless (N,c)∈{(2,1),(2,5),(2,7),(2,13),(2,23),(3,13)}. Our proof uses the hypergeometric method of Thue and Siegel and avoids application of lower bounds for linear forms in logarithms of algebraic numbers.     

On integers of the forms k−2 and k2+1

In this paper we prove that if (r,12)?3, then the set of positive odd integers k such that k^r−2ⁿ has at least two distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k^r2ⁿ+1 is also true.     

On the solutions of a functional equation arising from multiplication of quantum integers

This paper is the first of several papers in which we prove, for the case where the fields of coefficients are of characteristic zero, four open problems posed in the work of Melvyn Nathanson (2003) [1] concerning the solutions of a functional equation arising from multiplication of quantum integers q[n]=qn−1+qn−2+?+q+1. In this paper, we prove one of the problems. The next papers, namely [002], [003] and [004] by Lan Nguyen, contain the solutions to the other 3 problems.     

Sums of products of Kronecker's double series

Closed expressions are obtained for sums of products of Kronecker's double series of the form , where the summation ranges over all nonnegative integers j₁,…,jN with j₁+?+jN=n. Corresponding results are derived for functions which are an elliptic analogue of the periodic Euler polynomials. As corollaries, we reproduce the formulas for sums of products of Bernoulli numbers, Bernoulli polynomials, Euler numbers, and Euler polynomials, which were given by K. Dilcher.     

An arithmetical property of powers of Salem numbers

Let ζ be a nonzero real number and let α be a Salem number. We show that the difference between the largest and smallest limit points of the fractional parts of the numbers ζαn, when n runs through the set of positive rational integers, can be bounded below by a positive constant depending only on α if and only if the algebraic integer α−1 is a unit.     

Regularity of patterns in the factorization of n!

Consider the multiplicities ep₁(n),ep₂(n),…,epk(n) in which the primes p₁,p₂,…,pk appear in the factorization of n!. We show that these multiplicities are jointly uniformly distributed modulo (m₁,m₂,…,mk) for any fixed integers m₁,m₂,…,mk, thus improving a result of Luca and St?nic? [F. Luca, P. St?nic?, On the prime power factorization of n!, J. Number Theory 102 (2003) 298-305]. To prove the theorem, we obtain a result regarding the joint distribution of several completely q-additive functions, which seems to be of independent interest.     

Quantum integers and cyclotomy

A sequence of functions satisfies the functional equation for multiplication of quantum integers if f_mn(q)=f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of rational functions with coefficients in Q that satisfy this functional equation.     

Partitions of the set of natural numbers and their representation functions

For a given set A of nonnegative integers the representation functions R₂(A,n), R₃(A,n) are defined as the number of solutions of the equation n=a+a^′,a,a^′∈A with a<a^′, a?a^′, respectively. In this paper we give a simple proof to two results by Sándor.     

Gaps in semigroups

In this paper we investigate the behaviour of the gaps in numerical semigroups. We will give an explicit formula for the ith gap of a semigroup generated by k+1 consecutive integers (generalizing a result due to Brauer) as well as for a special numerical semigroup of three generators. It is also proved that the number of gaps of the numerical semigroup generated by integers p and q with g.c.d.(p,q)=1, in the interval [pq-(k+1)(p+q),…,pq-k(p+q)] is equals to

     

Distribution of exponential functions with squarefull exponent in residue rings

For a real x ≥ 1 we denote by S[x] the set of squarefull integers n ≤x, that is, the set of positive integers n ≤ such that l²|n for any prime divisor l|n. We estimate exponential sums of the form

     

An optimal lower bound for the Frobenius problem

Given N?2 positive integers a₁,a₂,…,aN with GCD(a₁,…,aN)=1, let fN denote the largest natural number which is not a positive integer combination of a₁,…,aN. This paper gives an optimal lower bound for fN in terms of the absolute inhomogeneous minimum of the standard (N−1)-simplex.     

The lengths of Hermitian self-dual extended duadic codes

Duadic codes are a class of cyclic codes that generalize quadratic residue codes from prime to composite lengths. For every prime power q, we characterize integers n such that there is a duadic code of length n over F_q² with a Hermitian self-dual parity-check extension. We derive asymptotic estimates for the number of such n as well as for the number of lengths for which duadic codes exist.     

Partitions of natural numbers with the same representation functions

For a set A of nonnegative integers the representation functions R₂(A,n), R₃(A,n) are defined as the number of solutions of the equation n=a+a^′,a,a^′∈A with a<a^′, a?a^′, respectively. Let D(0)=0 and let D(a) denote the number of ones in the binary representation of a. Let A₀ be the set of all nonnegative integers a with even D(a) and A₁ be the set of all nonnegative integers a with odd D(a). In this paper we show that (a) if R₂(A,n)=R₂(N?A,n) for all n?2N−1, then R₂(A,n)=R₂(N?A,n)?1 for all n?12N²−10N−2 except for A=A₀ or A=A₁; (b) if R₃(A,n)=R₃(N?A,n) for all n?2N−1, then R₃(A,n)=R₃(N?A,n)?1 for all n?12N²+2N. Several problems are posed in this paper.     

Mixed sums of squares and triangular numbers (III)

In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and only if Tm=m(m+1)/2 cannot be expressed as a sum of two odd squares and a triangular number, i.e., p²=x²+8(y²+z²) for no odd integers x,y,z. We also show that a positive integer cannot be written as a sum of an odd square and two triangular numbers if and only if it is of the form 2Tm(m>0) with 2m+1 having no prime divisor congruent to 3 modulo 4.     

Lower bounds for numbers of ABC-hits

By an ABC-hit, we mean a triple (a,b,c) of relatively prime positive integers such that a+b=c and rad(abc)<c. Denote by N(X) the number of ABC-hits (a,b,c) with c?X. In this paper we discuss lower bounds for N(X). In particular we prove that for every ?>0 and X large enough N(X)?exp((logX)^1/2−?).     

Sums and products with smooth numbers

We estimate the sizes of the sumset A+A and the productset A⋅A in the special case that A=S(x,y), the set of positive integers n?x free of prime factors exceeding y.     

Some irreducibility results for truncated binomial expansions

For positive integers n>k, let be the polynomial obtained by truncating the binomial expansion of n(1+x) at the kth stage. These polynomials arose in the investigation of Schubert calculus in Grassmannians. In this paper, the authors prove the irreducibility of Pn,k(x) over the field of rational numbers when 2≤2k≤n<³(k+1).