Bernoulli convolutions and an intermediate value theorem for entropies of<Emphasis Type="Italic">K</Emphasis>-partitions

We establish a strong regularity property for the distributions of the random sums Σ±λ ⁿ , known as “infinite Bernoulli convolutions”: For a.e. λ ∃ (1/2, 1) and any fixed ℓ, the conditional distribution of (w _n+1...,w _n+ℓ) given the sum Σ _n=0 ^∞ w _n λ ⁿ , tends to the uniform distribution on {±1}^ℓ asn → ∞. More precise results, where ℓ grows linearly inn, and extensions to other random sums are also obtained. As a corollary, we show that a Bernoulli measure-preserving system of entropyh hasK-partitions of any prescribed conditional entropy in [0,h]. This answers a question of Rokhlin and Sinai from the 1960’s, for the case of Bernoulli systems. The authors were partially supported by NSF grants DMS-9729992 (E. L.), DMS-9803597 (Y. P.) and DMS-0070538 (W. S.).     

Faulhaber’s theorem on power sums

We observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a+b,a+2b,…,a+nb is a polynomial in na+n(n+1)b/2. While this assertion can be deduced from the original Fauhalber’s theorem, we give an alternative formula in terms of the Bernoulli polynomials. Moreover, by utilizing the central factorial numbers as in the approach of Knuth, we derive formulas for r-fold sums of powers without resorting to the notion of r-reflective functions. We also provide formulas for the r-fold alternating sums of powers in terms of Euler polynomials.     

A recursive formula for even order harmonic series

A useful recursive formula for obtaining the infinite sums of even order harmonic series Σ^∞_n=1 (1/n^2k), k = 1, 2, …, is derived by an application of Fourier series expansion of some periodic functions. Since the formula does not contain the Bernoulli numbers, infinite sums of even order harmonic series may be calculated by the formula without the Bernoulli numbers. Infinite sums of a few even order harmonic series, which are calculated using the recursive formula, are tabulated for easy reference.     

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x ²ⁿ + y ²ⁿ , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.     

Integer parts of powers of rational numbers

We prove that the sequence [ξ(5/4)ⁿ], n=1,2, . . . , where ξ is an arbitrary positive number, contains infinitely many composite numbers. A corresponding result for the sequences [(3/2)ⁿ] and [(4/3)ⁿ],n=1,2, . . . , was obtained by Forman and Shapiro in 1967. Furthermore, it is shown that there are infinitely many positive integers n such that ([ξ(5/4)ⁿ],6006)>1, where 6006=2·3·7·11·13. Similar results are obtained for shifted powers of some other rational numbers. In particular, the same is proved for the sets of integers nearest to ξ(5/3)ⁿ and to ξ(7/5)ⁿ, n∈ℕ. The corresponding sets of possible divisors are also described.     

Bounds on chromatic numbers of multiple factors of a complete graph

Bounds on the sum and product of the chromatic numbers of n factors of a complete graph of order p are shown to exist. The well-known theorem of Nordhaus and Gaddum solves the problem for n = 2. Strict lower and some upper bounds for any n and strict upper bounds for n = 3 are given. In particular, the sum of the chromatic numbers of three factors is between 3p^1/3 and p + 3 and the product is between p and [(p + 3)/3]³.     

Power closure and the Engel condition

A Liep-algebraL is calledn-power closed if, in every section ofL, any sum ofp ⁱ⁺ⁿ th powers is ap ⁱ th power (i>0). It is easy to see that ifL isp ⁿ -Engel then it isn-power closed. We establish a partial converse to this statement: ifL is residually nilpotent andn-power closed for somen≥0 thenL is (3p ^{n +2} +1)-Engel ifp>2 and (3 · 2 ⁿ⁺³+1)-Engel ifp=2. In particular, thenL is locally nilpotent by a theorem of Zel’manov. We deduce that a finitely generated pro-p group is a Lie group over thep-adic field if and only if its associated Liep-algebra isn-power closed for somen. We also deduce that any associative algebraR generated by nilpotent elements satisfies an identity of the form (x+y) ^{p n} =x ^{p n} +y ^{p n} for somen≥1 if and only ifR satisfies the Engel condition. This project was supported by the CNR in Italy and NSF-EPSCoR in Alabama during the first author’s stay at the Università di Palermo.     

Boundedness of Multilinear Operators in Herz-type Hardy Space

Let κ∈ℕ. We prove that the multilinear operators of finite sums of products of singular integrals on ℝⁿ are bounded from HK ^α1,p1 _q1 (ℝⁿ) ×···×HK ^αk,pk _qk (ℝⁿ) into HK ^α,p _q (ℝⁿ) if they have vanishing moments up to a certain order dictated by the target spaces. These conditions on vanishing moments satisfied by the multilinear operators are also necessary when α_j≥ 0 and the singular integrals considered here include the Calderón-Zygmund singular integrals and the fractional integrals of any orders. Received September 6, 1999, Revised November 17, 1999, Accepted December 9, 1999     

On Λ(p)-subsets of squares

This paper is a follow up of [B₁]. It is shown that the sequence of squares {n ²|n=1, 2, ...} contains Λ(p)-subsets of “maximal density”, for any givenp>4. The proof is based on the probabilistic method developed in [B₁] and a precise estimate of the Λ(p)-constant for the sequence of squares itself. Analogues of this phenomenon are obtained for other arithmetic sets, such as the sequence ofkth powers {n ^k |n=1, 2, ...} or the sequence of prime numbers. Sections 2 and 3 of the paper are of independent interest to orthogonal system theory.     

Distribution of exponential functions with k-full exponent modulo a prime

For a real x -1 we denote by S_k[X] the set of k-full integers n x, that is, the set of positive integers n x such that ℓ^k|n for any prime divisor ℓ|n. We estimate exponential sums of the form where is a fixed integer with gcd (, p) = 1, and apply them to studying the distribution of the powers ⁿ, n S_k[x], in the residue ring modulo p 1.     

Small quasimultiple affine and projective planes: Some improved bounds

We improve the known bounds on r(n): = min {λ| an (n², n, λ)-RBIBD exists} in the case where n + 1 is a prime power. In such a case r(n) is proved to be at most n + 1. If, in addition, n − 1 is the product of twin prime powers, then r(n) ${\ \le \ }{n \over 2}$. We also improve the known bounds on p(n): = min{λ| an (n² + n + 1, n + 1, λ)-BIBD exists} in the case where n² + n + 1 is a prime power. In such a case p(n) is bounded at worst by but better bounds could be obtained exploiting the multiplicative structure of GF(n² + n + 1). Finally, we present an unpublished construction by M. Greig giving a quasidouble affine plane of order n for every positive integer n such that n − 1 and n + 1 are prime powers. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 337–345, 1998     

A generalization of rummer’s congruences

Suppose thatm, n are positive even integers andp is a prime number such thatp-1 is not a divisor ofm. For any non-negative integerN, the classical Kummer’s congruences on Bernoulli numbersB _n(n = 1,2,3,...) assert that (1-p ^m-1)B _m/m isp-integral and

THE GROUPS OF ORDER qn · p

We describe a method to determine up to isomorphism the groups of order q ⁿ · p for a fixed prime-power q ⁿ and indeterminate prime p ≠ q. We report on the explicit construction of all groups of order 2 ⁿ · p for n ≤ 8 and 3 ⁿ · p for n ≤ 6. In particular, we show that there are 1 090 235 groups of order 768.     

Adams theorem on Bernoulli numbers revisited

If we denote B_n to be nth Bernoulli number, then the classical result of Adams (J. Reine Angew. Math. 85 (1878) 269) says that p^?|n and (p−1)?n, then p^?|B_n where p is any odd prime p>3. We conjecture that if (p−1)?n, p^?|n and p?+1?n for any odd prime p>3, then the exact power of p dividing B_n is either ? or ?+1. The main purpose of this article is to prove that this conjecture is equivalent to two other unproven hypotheses involving Bernoulli numbers and to provide a positive answer to this conjecture for infinitely many n.     

Random and Deterministic Triangle Generation of Three-Dimensional Classical Groups III

Let p₁, p₂, p₃ be primes. This is the final paper in a series of three on the (p₁, p₂, p₃)-generation of the finite projective special unitary and linear groups PSU ₃(pⁿ), PSL ₃(pⁿ), where we say a noncyclic group is (p₁, p₂, p₃)-generated if it is a homomorphic image of the triangle group T_{p1, p2, p3} . This article is concerned with the case where p₁ = 2 and p₂ ≠ p₃. We determine for any primes p₂ ≠ p₃ the prime powers pⁿ such that PSU ₃(pⁿ) (respectively, PSL ₃(pⁿ)) is a quotient of T = T_{2, p2, p3} . We also derive the limit of the probability that a randomly chosen homomorphism in Hom(T, PSU ₃(pⁿ)) (respectively, Hom(T, PSL ₃(pⁿ))) is surjective as pⁿ tends to infinity.     

Explicit formulae for sums of products of Bernoulli polynomials,including poly-Bernoulli polynomials

We study sums of products of Bernoulli polynomials, including poly-Bernoulli polynomials. As a main result, for any positive integer $m$ , explicit expressions of sums of $m$ products are given. This result extends that of the first author, as well as the famous Euler formula about sums of two products of Bernoulli numbers.     

Formulas for sums of powers of integers by functional equations

This paper presents a direct and simple approach to obtaining the formulas forS _k(n)= 1 ^k + 2 ^k + ... +n ^k wheren andk are nonnegative integers. A functional equation is written based on the functional properties ofS _k (n) and several methods of solution are presented. These lead to several recurrence relations for the functions and a simple one-step differential-recurrence relation from which the polynomials can easily be computed successively. Arbitrary constants which arise are (almost) the Bernoulli numbers when evaluated and identities for these modified Bernoulli numbers are obtained. The functional equation for the formulas leads to another functional equation for the generating function for these formulas and this is used to obtain the generating functions for theS _k 's and for the modified Bernoulli numbers. This leads to an explicit representation, not a recurrence relation, for the modified Bernoulli numbers which then yields an explicit formula for eachS _k not depending on the earlier ones. This functional equation approach has been and can be applied to more general types of arithmetic sequences and many other types of combinatorial functions, sequences, and problems.     

q-Numbers of quantum groups, Fibonacci numbers, and orthogonal polynomials

We obtain algebraic relations (identities) for q-numbers that do not contain q ^α-factors. We derive a formula that expresses any q-number [x] in terms of the q-number [2]. We establish the relationship between the q-numbers [n] and the Fibonacci numbers, Chebyshev polynomials, and other special functions. The sums of combinations of q-numbers, in particular, the sums of their powers, are calculated. Linear and bilinear generating functions are found for “natural” q-numbers. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 8, pp. 1055–1063, August, 1998.     

Prime and composite numbers as integer parts of powers

We study prime and composite numbers in the sequence of integer parts of powers of a fixed real number. We first prove a result which implies that there is a transcendental number ξ>1 for which the numbers [ξ^{n !}], n =2,3, ..., are all prime. Then, following an idea of Huxley who did it for cubics, we construct Pisot numbers of arbitrary degree such that all integer parts of their powers are composite. Finally, we give an example of an explicit transcendental number ζ (obtained as the limit of a certain recurrent sequence) for which the sequence [ζⁿ], n =1,2,..., has infinitely many elements in an arbitrary integer arithmetical progression. This revised version was published online in June 2006 with corrections to the Cover Date.     

Peters type polynomials and numbers and their generating functions: Approach with p‐adic integral method

The aim of this paper is to introduce and investigate some of the primary generalizations and unifications of the Peters polynomials and numbers by means of convenient generating functions and p‐adic integrals method. Various fundamental properties of these polynomials and numbers involving some explicit series and integral representations in terms of the generalized Stirling numbers, generalized harmonic sums, and some well‐known special numbers and polynomials are presented. By using p‐adic integrals, we construct generating functions for Peters type polynomials and numbers (Apostol‐type Peters numbers and polynomials). By using these functions with their partial derivative eqautions and functional equations, we derive many properties, relations, explicit formulas, and identities including the Apostol‐Bernoulli polynomials, the Apostol‐Euler polynomials, the Boole polynomials, the Bernoulli polynomials, and numbers of the second kind, generalized harmonic sums. A brief revealing and historical information for the Peters type polynomials are given. Some of the formulas given in this article are given critiques and comments between previously well‐known formulas. Finally, two open problems for interpolation functions for Apostol‐type Peters numbers and polynomials are revealed.