Related papers: Formalizing Pfaffian in bounded arithmetic
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
We solve the several complex variables preSchwarzian operator equation $[Df(z)]^{-1}D^2f(z)=A(z)$, $z\in \C^n$, where $A(z)$ is a bilinear operator and $f$ is a $\C^n$ valued locally biholomorphic function on a domain in $\C^n$. Then one…
We study a parametrized family of strong maximal fractional operators. We prove their $L^p$ to $L^q$ boundedness for $1<p\le q<\infty$.
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
In the previous paper (J. Combin. Theory Ser. A, 120, 2013, 1263--1284) H. Tagawa and the two authors proposed an algebraic method to compute certain Pfaffians whose form resemble to Hankel determinants associated with moment sequences of…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
This paper presents a conception for computing gr\"{o}bner basis. We convert some of gr\"{o}bner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem…
Bernstein-Vazirani algorithm (the one-query algorithm) can identify a completely specified linear Boolean function using a single query to the oracle with certainty. The first aim of the paper is to show that if the provided Boolean…
The integral of a function $f$ defined on a symmetric space $M \simeq G/K$ may be expressed in the form of a determinant (or Pfaffian), when $f$ is $K$-invariant and, in a certain sense, a tensor power of a positive function of a single…
In this article, we discuss formal invariants of singularly-perturbed linear differential systems in neighborhood of turning points and give algorithms which allow their computation. The algorithms proposed are implemented in the computer…
We present first a brief review of the existing literature on shape optimization, stressing the recent use of Hamiltonian systems in topology optimization. In the second section, we collect some preliminaries on the implicit parametrization…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
In this work, we investigate binary classification under the constraints of both differential privacy and fairness. We first propose an algorithm based on the decoupling technique for learning a classifier with only fairness guarantee. This…
We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…
We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…
In the finite difference approximation of the fractional Laplacian the stiffness matrix is typically dense and needs to be approximated numerically. The effect of the accuracy in approximating the stiffness matrix on the accuracy in the…
We describe a type system for a synchronous pi-calculus formalising the notion of affine usage in signal-based communication. In particular, we identify a limited number of usages that preserve affinity and that can be composed. As a main…
We present an algorithm for factoring linear differential operators with coefficients in a finite separable extension of F p (x). Our methods rely on specific tools arising in positive characteristic: p-curvature, structure of simple…
We consider a family of boundary integral operators supported on a collection of parametrically defined bounded Lipschitz boundaries. Consequently, the boundary integral operators themselves also depend on the parametric variables, thus…