Convolution identities and lacunary recurrences for Bernoulli numbers

We extend Euler's well-known quadratic recurrence relation for Bernoulli numbers, which can be written in symbolic notation as n(B₀+B₀)=−nBn−1−(n−1)Bn, to obtain explicit expressions for n(Bk+Bm) with arbitrary fixed integers k,m?0. The proof uses convolution identities for Stirling numbers of the second kind and for sums of powers of integers, both involving Bernoulli numbers. As consequences we obtain new types of quadratic recurrence relations, one of which gives B6k depending only on B2k,B2k+2,…,B4k.     

Applications of?the Cosecant and Related Numbers

Power series expansions for cosecant and related functions together with a vast number of applications stemming from their coefficients are derived here. The coefficients for the cosecant expansion can be evaluated by using: (1) numerous recurrence relations, (2) expressions resulting from the application of the partition method for obtaining a power series expansion and (3) the result given in Theorem 3. Unlike the related Bernoulli numbers, these rational coefficients, which are called the cosecant numbers and are denoted by c _k , converge rapidly to zero as k????. It is then shown how recent advances in obtaining meaningful values from divergent series can be modified to determine exact numerical results from the asymptotic series derived from the Laplace transform of the power series expansion for tcsc?(at). Next the power series expansion for secant is derived in terms of related coefficients known as the secant numbers d _k . These numbers are related to the Euler numbers and can also be evaluated by numerous recurrence relations, some of which involve the cosecant numbers. The approaches used to obtain the power series expansions for these fundamental trigonometric functions in addition to the methods used to evaluate their coefficients are employed in the derivation of power series expansions for integer powers and arbitrary powers of the trigonometric functions. Recurrence relations are of limited benefit when evaluating the coefficients in the case of arbitrary powers. Consequently, power series expansions for the Legendre-Jacobi elliptic integrals can only be obtained by the partition method for a power series expansion. Since the Bernoulli and Euler numbers give rise to polynomials from exponential generating functions, it is shown that the cosecant and secant numbers gives rise to their own polynomials from trigonometric generating functions. As expected, the new polynomials are related to the Bernoulli and Euler polynomials, but they are found to possess far more interesting properties, primarily due to the convergence of the coefficients. One interesting application of the new polynomials is the re-interpretation of the Euler-Maclaurin summation formula, which yields a new regularisation formula.     

Multiple Orthogonal Polynomials Associated with the Modified Bessel Functions of the First Kind

Abstract. We consider polynomials which are orthogonal with respect to weight functions, which are defined in terms of the modified Bessel function I _ν and which are related to the noncentral χ ² -distribution. It turns out that it is the most convenient to use two weight functions with indices ν and ν+1 and to study orthogonality with respect to these two weights simultaneously. We show that the corresponding multiple orthogonal polynomials of type I and type II exist and give several properties of these polynomials (differential properties, Rodrigues formula, explicit formulas, recurrence relation, differential equation, and generating functions).     

Convex Pencils of Real Quadratic Forms

We study the topology of the set X of the solutions of a system of two quadratic inequalities in the real projective space ?P ⁿ (e.g. X is the intersection of two real quadrics). We give explicit formulas for its Betti numbers and for those of its double cover in the sphere S ⁿ ; we also give similar formulas for level sets of homogeneous quadratic maps to the plane. We discuss some applications of these results, especially in classical convexity theory. We prove the sharp bound b(X)??2n for the total Betti number of X; we show that for odd n this bound is attained only by a singular?X. In the nondegenerate case we also prove the bound on each specific Betti number b _k (X)??2(k+2).     

Central and local limit theorems applied to asymptotic enumeration

Let a double sequence a_n(k) ? 0 be given. We prove a simple theorem on generating functions which can be used to establish the asymptotic normality of a_n(k) as a function of k. Next we turn our attention to local limit theorems in order to obtain asymptotic formulas for a_n(k). Applications include constant coefficient recursions, Stirling numbers, and Eulerian numbers.     

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.     

A new family of k-Fibonacci numbers

In the present paper, we give a new family of k-Fibonacci numbers and establish some properties of the relation to the ordinary Fibonacci numbers. Furthermore, we describe the recurrence relations and the generating functions of the new family for k=2 and k=3, and presents a few identity formulas for the family and the ordinary Fibonacci numbers.     

Higher-order recurrences for Bernoulli numbers

Euler's well-known nonlinear relation for Bernoulli numbers, which can be written in symbolic notation as n(B₀+B₀)=−nBn−1−(n−1)Bn, is extended to n(Bk₁+?+Bkm) for m?2 and arbitrary fixed integers k₁,…,km?0. In the general case we prove an existence theorem for Euler-type formulas, and for m=3 we obtain explicit expressions. This extends the authors' previous work for m=2.     

Stirling polynomials

An investigation is made of the polynomials f_k(n) = S(n + k, n) and g_k(n) = (?1)^ks(n, n ? k), where S and s denote the Stirling numbers of the second and first kind, respectively. The main result gives a combinatorial interpretation of the coefficients of the polynomial (1 ? x)^2k+1Σ_n=0^∞f_k(n)xⁿ analogous to the well-known combinatorial interpretation of the Eulerian numbers in terms of descents of permutations.     

The evaluation of Tornheim double sums, Part 1

We provide an explicit formula for the Tornheim double series in terms of integrals involving the Hurwitz zeta function. We also study the limit when the parameters of the Tornheim sum become natural numbers, and show that in that case it can be expressed in terms of definite integrals of triple products of Bernoulli polynomials and the Bernoulli function A_k(q)?kζ^′(1-k,q).     

Polynomial interpolation and sums of powers of integers

In this note, we revisit the problem of polynomial interpolation and explicitly construct two polynomials in n of degree k + 1, P_k(n) and Q_k(n), such that P_k(n) = Q_k(n) = f_k(n) for n = 1, 2,…?, k, where f_k(1), f_k(2),…?, f_k(k) are k arbitrarily chosen (real or complex) values. Then, we focus on the case that f_k(n) is given by the sum of powers of the first n positive integers S_k(n) = 1^k + 2^k + ??? + n^k, and show that S_k(n) admits the polynomial representations S_k(n) = P_k(n) and S_k(n) = Q_k(n) for all n = 1, 2,…?, and k ≥ 1, where the first representation involves the Eulerian numbers, and the second one the Stirling numbers of the second kind. Finally, we consider yet another polynomial formula for S_k(n) alternative to the well-known formula of Bernoulli.     

A multiplication theorem for the Lerch zeta function and explicit representations of the Bernoulli and Euler polynomials

A multiplication theorem for the Lerch zeta function ?(s,a,ξ) is obtained, from which, when evaluating at s=−n for integers n?0, explicit representations for the Bernoulli and Euler polynomials are derived in terms of two arrays of polynomials related to the classical Stirling and Eulerian numbers. As consequences, explicit formulas for some special values of the Bernoulli and Euler polynomials are given.     

Über die Fourierkoeffizienten der Siegelschen Eisensteinreihen

It is well known that the Fourier coefficients a _n ^k (T) of Siegel's Eisenstein series of degree n and weight k are rational numbers with bounded denominators [14], [15]. In this paper we introduce a number b _n ^k (T), which is equal to a _n ^k (T) in many cases. This number can be computed in an elementary way. From our explicit formulas for b _n ^k (T) we can easily get results about the denominators of the Fourier coefficients a _n ^k (T), which are better than those obtained by Siegel in his difficult paper [15].     

Counting derangements, involutions and unimodal elements in the wreath product Cr ? Sn

We count derangements, involutions and unimodal elements in the wreath product C _r ≀ S _n by the numbers of excedances, fixed points and 2-cycles. Properties of the generating functions, including combinatorial formulas, recurrence relations and real-rootedness are studied. The results obtained specialize to those on the symmetric group S _n and on the hyperoctahedral group B _n when r = 1, 2, respectively.     

Functions with derivatives given by polynomials in the function itself or a related function

We construct the set of holomorphic functions S ₁ = {f: Ω_f ? ? → ?} whose members have n-th order derivatives which are given by a polynomial of degree n+1 in the function itself. We also construct the set of holomorphic functions S ₂ = {g: Ω_g ? ? → ?} whose members have n-th order derivatives which are given by the product of the function itself with a polynomial of degree n in an element of S ₁. The union S ₁ ∪ S ₂ contains all the hyperbolic and trigonometric functions. We study the properties of the polynomials involved and derive explicit expressions for them. As particular results, we obtain explicit and elegant formulas for the n-th order derivatives of the hyperbolic functions tanh, sech, coth and csch and the trigonometric functions tan, sec, cot and csc.     

On dimer coverings of rectangles of fixed width

For fixed k let A_n denote the number of dimer coverings of a k × n rectangle. Various properties of the generating function ΣA_nxⁿ are obtained, in particular answering questions of Klarner and Pollack and of Hock and McQuistan. An explicit expression for the molecular freedom for dimers on a saturated k × n lattice space is also obtained. The results are consequences of the explicit formula for A_n obtained by Kasteleyn and by Temperley and Fisher.     

On the Riesz basis property of the eigen- and associated functions of periodic and antiperiodic Sturm-Liouville problems

The paper deals with the Sturm-Liouville operator $$ Ly = - y'' + q(x)y, x \in [0,1], $$ generated in the space L ₂ = L ₂[0, 1] by periodic or antiperiodic boundary conditions. Several theorems on the Riesz basis property of the root functions of the operator L are proved. One of the main results is the following. Let q belong to the Sobolev spaceW ₁ ^p [0, 1] for some integer p ≥ 0 and satisfy the conditions q ^(k)(0) = q ^(k)(1) = 0 for 0 ≤ k ≤ s ? 1, where s ≤ p. Let the functions Q and S be defined by the equalities $$ Q(x) = \int_0^x {q(t)dt, S(x) = Q^2 (x)} $$ and let q _n , Q _n , and S _n be the Fourier coefficients of q, Q, and S with respect to the trigonometric system $ \{ e^{2\pi inx} \} _{ - \infty }^\infty $ . Assume that the sequence q _2n ? S _2n + 2Q ₀ Q _2n decreases not faster than the powers n ^?s?2. Then the system of eigenfunctions and associated functions of the operator L generated by periodic boundary conditions forms a Riesz basis in the space L ₂[0, 1] (provided that the eigenfunctions are normalized) if and only if the condition $$ q_{2n} - s_{2n} + 2Q_0 Q_{2n} \asymp q_{ - 2n} - s_{2n} + 2Q_0 Q_{ - 2n} , n > 1, $$ holds.     

A summation on Bernoulli numbers

In this paper, our aim is to investigate the summation form of Bernoulli numbers B_n, such as . We derive some basic identities among them. These numbers can form a Seidel matrix. The upper diagonal elements of this Seidel matrix are called “the median Bernoulli numbers”. We determine the prime divisors of their numerators and denominators. And we characterize their ordinary generating function as the unique solution of some functional equation. At last, we also obtain the continued fraction representation of their ordinary generating function and their value of Hankel determinant.     

Some congruences for the Apery numbers

In 1979 R. Apéry introduced the numbers a_n = Σ₀ⁿ(_kⁿ)²(_k^{n + k}) and u_n = Σ₀ⁿ(_kⁿ)²(_k^{n + k})² in his irrationality proof for ζ(2) and ζ(3). We prove some congruences for these numbers which generalize congruences previously published in this journal.     

On defining sets of vertices of the hypercube by linear inequalities

This paper shows that for any subset S of vertices of the n-dimensional hypercube, ind(S)≤2^n?1, where ind(S) is the minimum number of linear inequalities needed to define S. Furthermore, for any k in the range 1≤k≤2^n?1, there is an S with ind(S) = k, with the defining inequalities taken as canonical cuts. Other related results are included, and all are proven by explicit constructions of the sets S or explicit definitions of such sets by linear inequalities.The paper is aimed at researchers in bivalent programming, since it provides upper bounds on the performance of algorithms which combine several linear constraints into one, even when the given constraints have a particularly simple form.