Related papers: Polynomial Reduction and Super Congruences
Let p be an odd prime. In 1984, Greene introduced the notion of hypergeometric functions over finite fields. Special values of these functions have been of interest as they are related to the number of F_p points on algebraic varieties and…
We discuss algorithms for arithmetic properties of hypergeometric functions. Most notably, we are able to compute the p-adic valuation of a hypergeometric function on any disk of radius smaller than the p-adic radius of convergence. This we…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…
The theoretical computing of special values assumed by the hypergeometric functions has a high interest not only on its own, but also in sight of the remarkable implications to both pure Mathematics and Mathematical Physics. Accordingly, in…
Using a ${}_7F_6$ hypergeometric transformation formula, we prove two supercongruences. In particular, one of these supercongruences confirms a recent conjecture of Guo, Liu and Schlosser, and gives an extension of a supercongruence of Long…
The special case of the hypergeometric function $_{2}F_{1}$ represents the binomial series $(1+x)^{\alpha}=\sum_{n=0}^{\infty}(\:\alpha n\:)x^{n}$ that always converges when $|x|<1$. Convergence of the series at the endpoints, $x=\pm 1$,…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
The considered problem is uniform convergence of sequences of hypergeometric series. We give necessary and sufficient conditions for uniformly dominated convergence of infinite sums of proper bivariate hypergeometric terms. These conditions…
We introduce an object that has obvious similarity to the classical one - the algebra of supersymmetric polynomials. Despite the similarity, the known structure theorems on supersymmetric polynomials do not help in the study of the new…
We classify decompositions of simple special finite-dimensional Jordan superalgebras over an algebraically closed field of characteristic zero into the sum of two proper simple subsuperalgebras.
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
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…
We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced by the author. The reduced nested subresultant reduces the…
We study in detail the class of even polynomials and their behavior with respect to finite free convolutions. To this end, we use some specific hypergeometric polynomials and a variation of the rectangular finite free convolution to…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
Using the language of finite element exterior calculus, we define two families of $H^1$-conforming finite element spaces over pyramids with a parallelogram base. The first family has matching polynomial traces with tensor product elements…
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
By means of the $q$-Zeilberger algorithm, we prove a basic hypergeometric supercongruence modulo the fifth power of the cyclotomic polynomial $\Phi_n(q)$. This result appears to be quite unique, as in the existing literature so far no basic…