Related papers: Formalizing Pfaffian in bounded arithmetic
In this paper, we study the boundedness of a class of fractional integrals and derivatives associated with Laguerre polynomial expansions on Laguerre Lipschitz spaces. The consideration of such operators is motivated by the study of…
We prove an effective integrability criterion for differential-algebraic Pfaffian systems leading to a decision method of consistency with a triple exponential complexity bound. As a byproduct, we obtain an upper bound for the order of…
A combinatorial construction proves an identity for the product of the Pfaffian of a skew-symmetric matrix by the Pfaffian of one of its submatrices. Several applications of this identity are followed by a brief history of Pfaffians.
In paper a new definition of reduced Pade approximant and algorithm for its computing is proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Pade approximant…
The thesis studies linear and semilinear Dirichlet problems driven by different fractional Laplacians. The boundary data can be smooth functions or also Radon measures. The goal is to classify the solutions which have a singularity on the…
Chen's lemma on iterated integrals implies that certain identities involving multiple integrals, such as the de Bruijn and Wick formulas, amount to combinatorial identities for Pfaffians and hafnians in shuffle algebras. We provide direct…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
We present a very simple algorithm for computing Pfaffians which uses no division operations. Essentially, it amounts to iterating matrix multiplication and truncation. Its complexity, for a $2n\times 2n$ matrix, is $O(nM(n))$, where $M(n)$…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of…
We elaborate on the connection between Gel'fand-Kapranov-Zelevinsky systems, de Rham theory for twisted cohomology groups, and Pfaffian equations for Feynman integrals. We propose a novel, more efficient algorithm to compute Macaulay…
This work advances knowledge of the threshold of prox-boundedness of a function; an important concern in the use of proximal point optimization algorithms and in determining the existence of the Moreau envelope of the function. In finite…
We introduce the dynamical quantum Pfaffian on the dynamical quantum general linear group and prove its fundamental transformation identity. Hyper quantum dynamical Pfaffian is also introduced and formulas connecting them are given.
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a…
The theory of fuzzy mathematics has been proven very effective for defining and solving optimization problems. Fuzzy quadratic programming (FQP) is a consequence of this approach. In this paper, an algorithm has been proposed to solve FQP…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
We prove a duality theorem the computation of certain Bellman functions is usually based on. As a byproduct, we obtain sharp results about the norms of monotonic rearrangements. The main novelty of our approach is a special class of…
Fermionic Gaussian operators are foundational tools in quantum many-body theory, numerical simulation of fermionic dynamics, and fermionic linear optics. While their structure is fully determined by two-point correlations, evaluating their…
We discuss numerical complexity of the L\"uscher algorithm applied to the Hubbard Model. In particular we present comparison to a certain algorithm based on direct computation of the fermionic determinant.
The goal of this paper is to introduce a new constructive geometric proof of the affine version of Chevalley's Theorem. This proof is algorithmic and a verbatim implementation resulted in an efficient code for computing the constructible…