Related papers: Creative Telescoping for Hypergeometric Double Sum…
We introduce the notion of $\mathcal{N}=1$ abstract super loop equations, and provide two equivalent ways of solving them. The first approach is a recursive formalism that can be thought of as a supersymmetric generalization of the…
Hypergraphs, which use hyperedges to capture groupwise interactions among different entities, have gained increasing attention recently for their versatility in effectively modeling real-world networks. In this paper, we study the problem…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
A summation formula is derived for the sum of the first m+1 terms of the 3F2(a,b,c;(a+b+1)/2,2c;1) series when c = -m is a negative integer. This summation formula is used to derive a formula for the sum of a terminating double…
For linear systems $Ax=b$ we develop iterative algorithms based on a sketch-and-project approach. By using judicious choices for the sketch, such as the history of residuals, we develop weighting strategies that enable short recursive…
Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We introduce a broad class of random graph models: the generalised hypergeometric ensemble (GHypEG). This class enables to solve some long standing problems in random graph theory. First, GHypEG provides an elegant and compact formulation…
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
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…
Alignment algorithms usually rely on simplified models of gaps for computational efficiency. Based on an isomorphism between alignments and physical helix-coil models, we show in statistical mechanics that alignments with realistic laws for…
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…
We survey recent developments on rationality problems for algebraic varieties, with a particular emphasis on cycle-theoretic and combinatorial methods and their applications to hypersurfaces.
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
The geometric and algebraic theory of valuations on cones is applied to understand identities involving summing certain rational functions over the set of linear extensions of a poset.
We produce a decomposition of the parameter space of the $A$-hypergeometric system associated to a projective monomial curve as a union of an arrangement of lines and its complement, in such a way that the analytic behavior of the solutions…
Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear…
A new strategy based on numerical homogenization and Bayesian techniques for solving multiscale inverse problems is introduced. We consider a class of elliptic problems which vary at a microscopic scale, and we aim at recovering the highly…