Related papers: A Generalized Apagodu-Zeilberger Algorithm
We give a definition of generalized hypergeometric functions over finite fields using modified Gauss sums, which enables us to find clear analogy with classical hypergeometric functions over the complex numbers. We study their fundamental…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
In 2021, the first author and Kalita obtained two general hypergeometric formulas for sums involving certain rising factorials to prove some supercongruence conjectures of Guo related to (B.2) and (C.2). In this paper, we further generalize…
Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…
We examine hypergeometric functions in the finite field, p-adic and classical settings. In each setting, we prove a formula which splits the hypergeometric function into a sum of lower order functions whose arguments differ by roots of…
Motivated by the substantial development of the special functions, we contribute to establish some rigorous results on the general series identities with bounded sequences and hypergeometric functions with different arguments, which are…
Hermite reduction is a classical algorithmic tool in symbolic integration. It is used to decompose a given rational function as a sum of a function with simple poles and the derivative of another rational function. We extend Hermite…
Finite hypergeometric functions are complex valued functions on finite fields which are the analogue of the classical analytic hypergeometric functions. From the work of N.M.Katz it follows that their values are traces of Frobenius on…
We present a theorem on taking the repeated indefinite summation of a holomorphic function $\phi(z)$ in a vertical strip of $\mathbb{C}$ satisfying exponential bounds as the imaginary part grows. We arrive at this result using transforms…
We generalize generating functions for hypergeometric orthogonal polynomials, namely Jacobi, Gegenbauer, Laguerre, and Wilson polynomials. These generalizations of generating functions are accomplished through series rearrangement using…
We use the Dwork-Frobenius operator to prove an integrality result for $A$-hypergeometric series whose coefficients are factorial ratios. As a special case, we generalize one direction of a classical result of Landau on the integrality of…
This work continues the research of generalized Heisenberg algebras connected with several orthogonal polynomial systems. The realization of the annihilation operator of the algebra corresponding to a polynomial system by a differential…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
Supersymmetric quantum mechanics has many applications, and typically uses a raising and lowering operator formalism. For one dimensional problems, we show how such raising and lowering operators may be generalized to include an arbitrary…
With the exception of q-hypergeometric summation, the use of computer algebra packages implementing Zeilberger's "holonomic systems approach" in a broader mathematical sense is less common in the field of q-series and basic hypergeometric…
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…
Trager's Hermite reduction solves the integration problem for algebraic functions via integral bases. A generalization of this algorithm to D-finite functions has so far been limited to the Fuchsian case. In the present paper, we remove…
Many product formulas are known classically for generalized hypergeometric functions over the complex numbers. In this paper, we establish some analogous formulas for generalized hypergeometric functions over finite fields.
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…