Related papers: Hypergeometric Solutions of Linear Difference Syst…

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…

A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…

We leverage the proximal Galerkin algorithm (Keith and Surowiec, Foundations of Computational Mathematics, 2024, DOI: 10.1007/s10208-024-09681-8), a recently introduced mesh-independent algorithm, to obtain a high-order finite element…

Space-filling designs such as scrambled-Hammersley, Latin Hypercube Sampling and Jittered Sampling have been proposed for fully parallel hyperparameter search, and were shown to be more effective than random or grid search. In this paper,…

Marginal MAP problems are notoriously difficult tasks for graphical models. We derive a general variational framework for solving marginal MAP problems, in which we apply analogues of the Bethe, tree-reweighted, and mean field…

We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which…

In this paper, an analytic approximation method for highly nonlinear equations, namely the homotopy analysis method (HAM), is employed to solve some backward stochastic differential equations (BSDEs) and forward-backward stochastic…

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…

We show the first dimension-preserving search-to-decision reductions for approximate SVP and CVP. In particular, for any $\gamma \leq 1 + O(\log n/n)$, we obtain an efficient dimension-preserving reduction from $\gamma^{O(n/\log n)}$-SVP to…

Common trends in model order reduction of large nonlinear finite-element-discretized systems involve the introduction of a linear mapping into a reduced set of unknowns, followed by Galerkin projection of the governing equations onto a…

In this paper an extension of the spectral Lanczos' tau method to systems of nonlinear integro-differential equations is proposed. This extension includes (i) linearization coefficients of orthogonal polynomials products issued from…

We show that B-model topological strings on local Calabi-Yau threefolds are large N duals of matrix models, which in the planar limit naturally give rise to special geometry. These matrix models directly compute F-terms in an associated N=1…

We develop high-order numerical schemes to solve random hyperbolic conservation laws using linear programming. The proposed schemes are high-order extensions of the existing first-order scheme introduced in [{\sc S. Chu, M. Herty, M.…

This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…

We focus on the tranformation matrices between the standard Young-Yamanouchi basis of an irreducible representation for the symmetric group S_n and the split basis adapted to the direct product subgroups S_{n_1} \times S_{n-n_1} . We…

We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound paradigm that applies alternating direction method of…

We obtain two new Thomae-type transformations for hypergeometric series with r pairs of numeratorial and denominatorial parameters differing by positive integers. This is achieved by application of the so-called Beta integral method…

Polynomial spectral methods produce fast, accurate, and flexible solvers for broad ranges of PDEs with one bounded dimension, where the incorporation of general boundary conditions is well understood. However, automating extensions to…

We introduce a configuration of a $q$-difference equation and characterize the variants of the $q$-hypergeometric equation, which were defined by Hatano-Matsunawa-Sato-Takemura, by configurations. We show integral solutions and series…

We apply polynomial approximation methods -- known in the numerical PDEs context as spectral methods -- to approximate the vector-valued function that satisfies a linear system of equations where the matrix and the right hand side depend on…