Related papers: Formalizing Pfaffian in bounded arithmetic
Evaluation of pfaffians arises in a number of physics applications, and for some of them a direct method is preferable to using the determinantal formula. We discuss two methods for the numerical evaluation of pfaffians. The first is…
We establish the convergence of the forward-backward splitting algorithm based on Bregman distances for the sum of two monotone operators in reflexive Banach spaces. Even in Euclidean spaces, the convergence of this algorithm has so far…
It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
We develop properties of unramified, \'etale and smooth morphisms between Berkovich spaces over $\mathbb{Z}$. We prove that they satisfy properties analogous to those of morphisms of schemes and we provide analytification criteria. Our…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
We derive a straightening-free algorithm that computes the canonical bases of any higher-level q-deformed Fock space.
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…
The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres…
We construct a family of Pfaffian point processes relevant for the harmonic analysis on the infinite symmetric group. The correlation functions of these processes are representable as Pfaffians with matrix valued kernels. We give explicit…
We give a Pfaffian formula to compute the partition function of the Ising model on any graph $G$ embedded in a closed, possibly non-orientable surface. This formula, which is suitable for computational purposes, is based on the relation…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
This paper presents regularity results and associated high-order numerical methods for one-dimensional Fractional-Laplacian boundary-value problems. On the basis of a factorization of solutions as a product of a certain edge-singular weight…
We propose a Bayesian framework of Gaussian process in order to extend Fisher's discriminant to classify functional data such as spectra and images. The probability structure for our extended Fisher's discriminant is explicitly formulated,…
Probabilistic programming provides the means to represent and reason about complex probabilistic models using programming language constructs. Even simple probabilistic programs can produce models with infinitely many variables. Factored…
In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations are special cases-- on a representation of real numbers by…
We present algorithms to numerically evaluate Daubechies wavelets and scaling functions to high relative accuracy. These algorithms refine the suggestion of Daubechies and Lagarias to evaluate functions defined by two-scale difference…
In this paper we study strongly indefinite systems involving the fractional Laplacian on bounded domains. We obtain existence and non-existence results, $a priori$ estimates of Gidas-Spruck type, and the symmetric property.
Foundational material on complex Lie supergroups and their radial operators is presented. In particular, Berezin's recursion formula for describing the radial parts of fundamental operators in general linear and ortho-symplectic cases is…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…