June 7, 2016
The aim of this note is to establish an interesting hypergeometric generating relation contiguous to that of Exton by a short method.
January 30, 2024
The umbral restyling of hypergeometric functions is shown to be a useful and efficient approach in simplifying the associated computational technicalities. In this article, the authors provide a general introduction to the umbral version of Gauss hypergeometric functions and extend the formalism to certain generalized forms of these functions. It is shown that suggested approach is particularly efficient for evaluating integrals involving hypergeometric functions and their co...
October 17, 2004
We show that a 1969 result of Bouwkamp and de Bruijn on a formal power series expansion can be interpreted as the hypergraph analogue of the fact that every connected graph with n vertices has at least n-1 edges. We explain some of Bouwkamp and de Bruijn's formulas in terms of hypertrees and we use Lagrange inversion to count hypertrees by the number of vertices and the number of edges of a specified size.
August 25, 2014
We develop a theoretical study of non-terminating hypergeometric summations with one free parameter. Composing various methods in complex and asymptotic analysis, geometry and arithmetic of certain transcendental curves and rational approximations of irrational numbers, we are able to obtain some necessary conditions of arithmetic flavor for a given hypergeometric sum to admit a gamma product formula. This kind of research seems to be new even in the most classical case of th...
February 11, 2008
We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known results about the exponential generating functions for the different number of vertices. We consider also some applications as counting hyperforests in the k-uniform complete hypergraph and the one complete in hyperedges of all dimensions. ...
September 30, 2014
In this note we state (with minor corrections) and give an alternative proof of a very general hypergeometric transformation formula due to Slater. As an application, we obtain a new hypergeometric transformation formula for a ${}_5F_4(-1)$ series with one pair of parameters differing by unity expressed as a linear combination of two ${}_3F_2(1)$ series.
May 13, 2020
In this article, we investigate Muirhead's classical system of differential operators for the hypergeometric function 1F1 of a matrix argument. We formulate a conjecture for the combinatorial structure of the characteristic variety of its Weyl closure which is both supported by computational evidence as well as theoretical considerations. In particular, we determine the singular locus of this system.
November 20, 2010
By systematically applying ten well-known and inequivalent two-part relations between hypergeometric sums 3F2(...|1) to the published database of all such sums, 62 new sums are obtained. The existing literature is summarized, and many purportedly novel results extracted from that literature are shown to be special cases of these new sums. The general problem of finding elements contiguous to Watson's, Dixon's and Whipple's theorems is reduced to a simple algorithm suitable fo...
July 20, 2014
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied to counting the number of conjugacy classes of commuting tuples in finite groups and the number of isomorphism classes of representations of polynomial algebras over finite fields. The method for computing the rational generating functions,...
February 2, 2022
The Catalan numbers $C_n$ are an extremely well-studied sequence of numbers that appear as the answer to many combinatorial problems. Two generalizations of these numbers that have been studied are the Fuss-Catalan numbers and the Hypergraph Catalan numbers. In this paper, we study the combination of these, the Hypergraph Fuss-Catalan numbers. We provide some combinatorial interpretations of these numbers, as well as describe their generating function.