Extended rank reduction formulas containing Wedderburn and Abaffy–Broyden–Spedicato rank reducing processes

The Wedderburn rank reduction formula and the Abaffy–Broyden–Spedicato (ABS) algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes such as Gram–Schmidt, conjugate direction and Lanczos methods. We present a rank reduction formula for transforming the rows and columns of A, extending the Wedderburn rank reduction formula and the ABS approach. By repeatedly applying the formula to reduce the rank, an extended rank reducing process is derived. The biconjugation process associated with the Wedderburn rank reduction process and the scaled extended ABS class of algorithms are shown to be in our proposed rank reducing process, while the process is more general to produce several other effective reduction algorithms to compute various structured factorizations. The process provides a general finite iterative approach for constructing factorizations of A   and A^T$A^T$ under a common framework of a general decomposition V^TAP=Ω$V^{T}AP=\Omega$. We also show that the biconjugation process associated with the Wedderburn rank reduction process can be derived from the scaled ABS class of algorithms applied to A   or A^T$A^T$. Finally, we provide a list of some well-known reduction procedures as special cases of our extended rank reducing process. The approach is general enough to produce various structured decompositions as well.     

Some apparent connection between Baxter and averaging operators

A formula for the resolvent R(λ, T) of a Baxter operator T, on a complex Banach algebra $\text{A}$ with identity e, is obtained. With the parameter θ ≠ 0 and e, but under some restriction, this formula is analogous to that for the resolvent of an averaging operator. A counterexample is given, which shows that such a Baxter operator is not averaging in general. When θ is regular in $\text{A}$, a simple representation of T in terms of summation and averaging operators is obtained.     

New formulae for higher order derivatives and applications

We present new formulae (the Slevinsky–Safouhi formulae I and II) for the analytical development of higher order derivatives. These formulae, which are analytic and exact, represent the kth derivative as a discrete sum of only k+1 terms. Involved in the expression for the kth derivative are coefficients of the terms in the summation. These coefficients can be computed recursively and they are not subject to any computational instability. As examples of applications, we develop higher order derivatives of Legendre functions, Chebyshev polynomials of the first kind, Hermite functions and Bessel functions. We also show the general classes of functions to which our new formula is applicable and show how our formula can be applied to certain classes of differential equations. We also presented an application of the formulae of higher order derivatives combined with extrapolation methods in the numerical integration of spherical Bessel integral functions.     

Extended integer rank reduction formulas and Smith normal form

We present an integer rank reduction formula for transforming the rows and columns of an integer matrix A. By repeatedly applying the formula to reduce rank, an extended integer rank reducing process is derived. The process provides a general finite iterative approach for constructing factorizations of A and A ^T under a common framework of a general decomposition V ^T AP?=?Ω. Then, we develop the integer Wedderburn rank reduction formula and its integer biconjugation process. Both the integer biconjugation process associated with the Wedderburn rank reduction process and the scaled extended integer Abaffy–Broyden–Spedicato (ABS) class of algorithms are shown to be in the integer rank reducing process. We also show that the integer biconjugation process can be derived from the scaled integer ABS class of algorithms applied to A or A ^T . Finally, we show that the integer biconjuagation process is a special case of our proposed ABS class of algorithms for computing the Smith normal form.     

The eigenvalue distribution of degenerate Dirichlet forms

We obtain a positive lower bound to the spectrum of certain second-order elliptic operators H on $\text{L}{}^2\text{(Ω),}\text{where}\text{Ω ?}$$\text{R}$^N has a Lipschitz boundary and the coefficients of H become singular as one approaches the boundary. We also find a general formula for the order of the asymptotic eigenvalue distribution of H in some situations where the classical limit formula of Weyl, Courant, Titchmarsh, and others is not applicable.     

An alternative proof of the extended Saalschütz summation theorem for the r + 3Fr + 2(1) series with applications

A simple proof is given of a new summation formula recently added in the literature for a terminating _{r + 3}F_{r + 2}(1) hypergeometric series for the case when r pairs of numeratorial and denominatorial parameters differ by positive integers. This formula represents an extension of the well‐known Saalschütz summation formula for a ₃F₂(1) series. Two applications of this extended summation formula are discussed. The first application extends two identities given by Ramanujan and the second, which also employs a similar extension of the Vandermonde–Chu summation theorem for the ₂F₁ series, extends certain reduction formulas for the Kampé de Fériet function of two variables given by Exton and Cvijovi? & Miller. Copyright © 2015 John Wiley & Sons, Ltd.     

Certain summation and transformation formulas for generalized hypergeometric series

We derive summation formulas for generalized hypergeometric series of unit argument, one of which upon specialization reduces to Minton’s summation theorem. As an application we deduce a reduction formula for a certain Kampé de Fériet function that in turn provides a Kummer-type transformation formula for the generalized hypergeometric function _pF_p(x).     

Some families of combinatorial and other series identities and their applications

The main object of this presentation is to show how some simple combinatorial identities can lead to several general families of combinatorial and other series identities as well as summation formulas associated with the Fox-Wright function _pΨ_q and various related generalized hypergeometric functions. At least one of the hypergeometric summation formulas, which is derived here in this manner, has already found a remarkable application in producing several interesting generalizations of the Karlsson-Minton summation formula. We also consider a number of other combinatorial series identities and rational sums which were proven, in recent works, by using different methods and techniques. We show that much more general results can be derived by means of certain summation theorems for hypergeometric series. Relevant connections of the results presented here with those in the aforementioned investigations are also considered.     

A polynomial expression for the Hilbert series of the quotient ring of diagonal coinvariants

A special case of Haiman?s identity [M. Haiman, Vanishing theorems and character formulas for the Hilbert scheme of points in the plane, Invent. Math. 149 (2002) 371–407] for the character of the quotient ring of diagonal coinvariants under the diagonal action of the symmetric group yields a formula for the bigraded Hilbert series as a sum of rational functions in q,t. In this paper we show how a summation identity of Garsia and Zabrocki for Macdonald polynomial Pieri coefficients can be used to transform Haiman?s formula for the Hilbert series into an explicit polynomial in q,t with integer coefficients. We also provide an equivalent formula for the Hilbert series as the constant term in a multivariate Laurent series.     

An efficient algorithm for accelerating the convergence of oscillatory series,useful for computing the polylogarithm and Hurwitz zeta functions

This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein’s “An efficient algorithm for computing the Riemann zeta function” by Borwein for computing the Riemann zeta function, to more general series. The algorithm provides a rapid means of evaluating Li _s (z) for general values of complex s and a kidney-shaped region of complex z values given by ∣z ²/(z–1)∣<4. By using the duplication formula and the inversion formula, the range of convergence for the polylogarithm may be extended to the entire complex z-plane, and so the algorithms described here allow for the evaluation of the polylogarithm for all complex s and z values. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler–Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler–Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor’s series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.      

Complementary moments and the summation of series

In previous papers the author has treated the summation of power and other series whose coefficients re moments of a function f(u), usually over the interval 0 </ u </ 1. The present paper defines “complementary moments” of f(u) for the same interval, and demonstrates their use in convergence acceleration and in the analytic summation of series having somewhat complicated coefficients of a rather special form. Simple algorithms are established, and these enable one, for example, to obtain exact Laplace-transform inverses of unusual functions of the Laplace-transform operator p.     

On Dirichlet L-functions with periodic coefficients and Eisenstein series

We prove a Lipschitz type summation formula with periodic coefficients. Using this formula, representations of the values at positive integers of Dirichlet L-functions with periodic coefficients are obtained in terms of Bernoulli numbers and certain sums involving essentially the discrete Fourier transform of the periodic function forming the coefficients. The non-vanishing of these L-functions at s = 1 are then investigated. There are additional applications to the Fourier expansions of Eisenstein series over congruence subgroups of SL₂(\mathbbZ){SL_2(\mathbb{Z})} and derivatives of such Eisenstein series. Examples of a family of Eisenstein series with a high frequency of vanishing Fourier coefficients are given.     

Graph structural properties of non-Yutsis graphs allowing fast recognition

Yutsis graphs are connected simple graphs which can be partitioned into two vertex-induced trees. Cubic Yutsis graphs were introduced by Jaeger as cubic dual Hamiltonian graphs, and these are our main focus.Cubic Yutsis graphs also appear in the context of the quantum theory of angular momenta, where they are used to generate summation formulae for general recoupling coefficients. Large Yutsis graphs are of interest for benchmarking algorithms which generate these formulae.In an earlier paper we showed that the decision problem of whether a given cubic graph is Yutsis is NP-complete. We also described a heuristic that was tested on graphs with up to 300,000 vertices and found Yutsis decompositions for all large Yutsis graphs very quickly.In contrast, no fast technique was known by which a significant fraction of bridgeless non-Yutsis cubic graphs could be shown to be non-Yutsis. One of the contributions of this article is to describe some structural impediments to Yutsisness. We also provide experimental evidence that almost all non-Yutsis cubic graphs can be rapidly shown to be non-Yutsis by applying a heuristic based on some of these criteria. Combined with the algorithm described in the earlier paper this gives an algorithm that, according to experimental evidence, runs efficiently on practically every large random cubic graph and can decide on whether the graph is Yutsis or not.The second contribution of this article is a set of construction techniques for non-Yutsis graphs implying, for example, the existence of 3-connected non-Yutsis cubic graphs of arbitrary girth and with few non-trivial 3-cuts.     

A generalization of the Riesz–Fischer theorem and linear summability methods

We extend the classical Riesz–Fischer theorem to biorthogonal systems of functions in Orlicz spaces: from a given double series (not necessarily convergent but satisfying a growth condition) we construct a function (in a given Orlicz space) by a linear summation method, and recover the original double series via the coefficients of the expansion of this function with respect to the biorthogonal system. We give sufficient conditions for the regularity of some linear summation methods for double series. We are inspired by a result of Fomin who extended the Riesz–Fischer theorem to $L^p$ spaces.     

Certain summation formulas involving harmonic numbers and generalized harmonic numbers

Harmonic numbers and generalized harmonic numbers have been studied since the distant past and involved in a wide range of diverse fields such as analysis of algorithms in computer science, various branches of number theory, elementary particle physics and theoretical physics. Here we aim at presenting further interesting identities about certain finite or infinite series involving harmonic numbers and generalized harmonic numbers by applying an algorithmic method to a known summation formula for the hypergeometric function ₅F₄(1).     

On Dirichlet <Emphasis Type="Italic">L</Emphasis>-functions with periodic coefficients and Eisenstein series

We prove a Lipschitz type summation formula with periodic coefficients. Using this formula, representations of the values at positive integers of Dirichlet L-functions with periodic coefficients are obtained in terms of Bernoulli numbers and certain sums involving essentially the discrete Fourier transform of the periodic function forming the coefficients. The non-vanishing of these L-functions at s = 1 are then investigated. There are additional applications to the Fourier expansions of Eisenstein series over congruence subgroups of \({SL_2(\mathbb{Z})}\) and derivatives of such Eisenstein series. Examples of a family of Eisenstein series with a high frequency of vanishing Fourier coefficients are given.     

Wiener–Hopf indices of unitary functions on the unit circle in terms of realizations and related results on Toeplitz operators

We provide new formulas for the Wiener–Hopf factorization indices of a rational matrix function $R$ which has neither poles nor zeros on the unit circle. In addition, we recover recent results on the Fredholm characteristics of the Toeplitz operator with symbol $R$ via the method of matricial coupling. Furthermore, we present an alternative formula for the index in terms of the Fourier coefficients of $R$.     

Fourier expansion along geodesics on Riemann surfaces

For an eigenfunction of the Laplacian on a hyperbolic Riemann surface, the coefficients of the Fourier expansion are described as intertwining functionals. All intertwiners are classified. A refined growth estimate for the coefficients is given and a summation formula is proved.