Related papers: On Gosper-Karaji algebraic Identities

We use Constraint Satisfaction Methods to construct and enumerate finite $L$-algebras up to isomorphism. These objects were recently introduced by Rump and appear in Garside theory, algebraic logic, and the study of the combinatorial…

A new type of algorithms is presented that combine the advantages of quantum and classical ones. Those combined advantages along with aspects of Geometric Algebra that open possibilities unavailable to both of these computations are…

Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper's algorithm…

Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…

In a series of letters to D.Stanton, R.W.Gosper presented many strange evaluations of hypergeometric series. Recently, we rediscovered one of the strange hypergeometric identities appearing in [Go]. In this paper, we prove this identity and…

Inspired by ideas from umbral calculus and based on the two types of integrals occurring in the defining equations for the gamma and the reciprocal gamma functions, respectively, we develop a multi-variate version of umbral calculus and of…

We prove hypergeometric type summation identities for a function defined in terms of quotients of the $p$-adic gamma function by counting points on certain families of hyperelliptic curves over $\mathbb{F}_{q}$. We also find certain special…

We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic…

The beta integral method proved itself as a simple nonetheless powerful method of generating hypergeometric identities at a fixed argument. In this paper we propose a generalization by substituting the beta density with a particular type of…

In a recent paper (Appl. Math. Comput. 215, 1622--1645, 2009), the authors proposed a method of summation of some slowly convergent series. The purpose of this note is to give more theoretical analysis for this transformation, including the…

An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…

In this paper, we present a new method for finding identities for hypergeoemtric series, such as the (Gauss) hypergeometric series, the generalized hypergeometric series and the Appell-Lauricella hypergeometric series. Furthermore, using…

Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an…

In this article, we explore a series of elementary yet insightful results involving integrals related to Gaussian sums. Using techniques rooted in classical calculus, we derive several identities and evaluate nontrivial definite integrals…

The classical hypergeometric summation theorems are exploited to derive several striking identities on harmonic numbers including those discovered recently by Paule and Schneider (2003).

We show how well known tools of algebraic geometry for the study of finite sets can be fruitfully applied to the study of Waring decompositions of symmetric tensors (forms). We mainly focus on the uniqueness of a given decomposition (the…

We derive a combinatorial identity which is useful in studying the distribution of Fourier coefficients of L-functions by allowing us to pass from knowledge of moments of the coefficients to the distribution of the coefficients.

We improve the complex number identity proving method to a fully automated procedure, based on elimination ideals. By using declarative equations or rewriting each real-relational hypothesis $h_i$ to $h_i-r_i$, and the thesis $t$ to $t-r$,…

We explore a method which is implicit in a paper of Burkholder of identifying the $H^2$ Hardy norm of a conformal map with the explicit solution of Dirichlet's problem in the complex plane. Using the series form of the Hardy norm, we obtain…

The ubiquity of the class of D-finite functions and P-recursive sequences in symbolic computation is widely recognized. In this thesis, the presented work consists of two parts related to this class. In the first part, we generalize the…