Related papers: Holonomic Tools for Basic Hypergeometric Functions
Quantum Graphical Models (QGMs) generalize classical graphical models by adopting the formalism for reasoning about uncertainty from quantum mechanics. Unlike classical graphical models, QGMs represent uncertainty with density matrices in…
The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…
Machine learning has been presented as one of the key applications for near-term quantum technologies, given its high commercial value and wide range of applicability. In this work, we introduce the \textit{quantum-assisted Helmholtz…
Possible irreducible holonomy algebras $\g\subset\osp(p,q|2m)$ of Riemannian supermanifolds under the assumption that $\g$ is a direct sum of simple Lie superalgebras of classical type and possibly of a one-dimensional center are…
We give a definition of generalized hypergeometric functions over finite fields using modified Gauss sums, which enables us to find clear analogy with classical hypergeometric functions over the complex numbers. We study their fundamental…
Our Chapter in the upcoming Volume I: Computer Science and Software Engineering of Computing Handbook (Third edition), Allen Tucker, Teo Gonzales and Jorge L. Diaz-Herrera, editors, covers Algebraic Algorithms, both symbolic and numerical,…
We review the results of several of our papers about the procedure of extension of Hamiltonians, allowing the construction of families of superintegrable systems with non-trivial polynomial first integrals (or symmetry operators) of…
This memoir is devoted to the study of formal-analytic arithmetic surfaces. These are arithmetic counterparts, in the context of Arakelov geometry, of germs of smooth complex-analytic surfaces along a projective complex curve.…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
The main result of the paper is a construction of a five-parameter family of new bases in the algebra of symmetric functions. These bases are inhomogeneous and share many properties of systems of orthogonal polynomials on an interval of the…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
A unified algebraic interpretation of both finite families of orthogonal polynomials and biorthogonal rational functions of $q$-Hahn type is provided. The approach relies on the meta $q$-Hahn algebra and its finite-dimensional bidiagonal…
The paper addresses linear hyperbolic systems in one space dimension with random field coefficients. In many applications, a low degree of regularity of the paths of the coefficients is required, which is not covered by classical stochastic…
Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…
This survey article is concerned with the modeling of the kinematical structure of quantum systems in an algebraic framework which eliminates certain conceptual and computational difficulties of the conventional approaches. Relying on the…
The need for a mathematically rigorous quantization procedure of singular spaces and incomplete motions is pointed out in connection with quantum cosmology. We put our previous suggestion for such a procedure, based on the theory of induced…
In the algebraic metacomplexity framework we prove that the decomposition of metapolynomials into their isotypic components can be implemented efficiently, namely with only a quasipolynomial blowup in the circuit size. We use this to…
Certain many-particle Hardy inequalities are derived in a simple and systematic way using the so-called ground state representation for the Laplacian on a subdomain of $\mathbb{R}^n$. This includes geometric extensions of the standard Hardy…
Applying the $q$-Zeilberger algorithm, we establish a unified $q$-analogue of the (C.2) and (G.2) supercongruences of Van Hamme, which can be viewed as a refinement of several previously known results. As consequences, we obtain a…
In 2021, the first author and Kalita obtained two general hypergeometric formulas for sums involving certain rising factorials to prove some supercongruence conjectures of Guo related to (B.2) and (C.2). In this paper, we further generalize…