Related papers: Polynomial Reduction and Super Congruences
We prove a two-parameter family of $q$-hypergeometric congruences modulo the fourth power of a cyclotomic polynomial. Crucial ingredients in our proof are George Andrews' multiseries extension of the Watson transformation, and a…
We introduce a natural method of computing antiderivatives of a large class of functions which stems from the observation that the series expansion of an antiderivative differs from the series expansion of the corresponding integrand by…
We prove existence and uniqueness of solutions for an entropic version of the semi-geostrophic equations. We also establish convergence to a weak solution of the semi-geostrophic equations as the entropic parameter vanishes. Convergence is…
It is known that semi-magic square matrices form a 2-graded algebra or superalgebra with the even and odd subspaces under centre-point reflection symmetry as the two components. We show that other symmetries which have been studied for…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
The Clifford-Hermite and the Clifford-Gegenbauer polynomials of standard Clifford analysis are generalized to the new framework of Clifford analysis in superspace in a merely symbolic way. This means that one does not a priori need an…
Several important families of orthogonal polynomials on the real line are called ``hypergeometric'' since they can be explicitly described in terms of some hypergeometric series $_pF_q$ that uses the degree $n$ of the polynomial as a…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…
Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…
The Abramov-Petkovsek reduction computes an additive decomposition of a hypergeometric term, which extends the functionality of the Gosper algorithm for indefinite hypergeometric summation. We modify the Abramov-Petkovsek reduction so as to…
By employing certain extended classical summation theorems, several surprising \pi and other formulae are displayed.
Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. This paper discusses the use of seminorms for…
We list the so-called Askey-scheme of hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation and generating functions of all classes of orthogonal…
Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…
In terms of several summation and transformation formulas for basic hypergeometric series, two forms of the Chinese remainder theorem for coprime polynomials, the creative microscoping method introduced by Guo and Zudilin, Guo and Li's…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as, if there exists the GCD (greatest common divisor) of initial…
This article describes the REDUCE package ZEILBERG implemented by Gregor St\"olting and the author. The REDUCE package ZEILBERG is a careful implementation of the Gosper and Zeilberger algorithms for indefinite, and definite summation of…