Related papers: Differential Recursion and Differentially Algebrai…
In this monograph we develop magnetic pseudodifferential theory for operator-valued and equivariant operator-valued functions and distributions from first principles. These have found plentiful applications in mathematical physics,…
Symmetry is present in many tasks in computer vision, where the same class of objects can appear transformed, e.g. rotated due to different camera orientations, or scaled due to perspective. The knowledge of such symmetries in data coupled…
We give a precise definition of a formal mathematical object as any symbol for an individual constant, predicate letter, or a function letter that can be introduced through definition into a formal mathematical language without inviting…
The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…
Functional data analysis is a growing research field as more and more practical applications involve functional data. In this paper, we focus on the problem of regression and classification with functional predictors: the model suggested…
The algebra of quantum differential operators on graded algebras was introduced by V. Lunts and A. Rosenberg. D. Jordan, T. McCune and the second author have identified this algebra of quantum differential operators on the polynomial…
Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…
Pseudodifferential operators of several variables are formal Laurent series in the formal inverses of $\partial_1, ..., \partial_n$ with $\partial_i = d$ $1 \leq i \leq n$. As in the single variable case, Lax equations can be constructed…
In the paper, by a general and fundamental, but non-extensively circulated, formula for derivatives of a ratio of two differentiable functions and by a recursive relation of the Hessenberg determinant, the author finds a new determinantal…
Quaternionic analysis relies heavily on results on functions defined on domains in $\mathbb R^4$ (or $\mathbb R^3$) with values in $\mathbb H$. This theory is centered around the concept of $\psi-$hyperholomorphic functions i.e.,…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
A method of G. Wilson for generating commutative algebras of ordinary differential operators is extended to higher dimensions. Our construction, based on the theory of D-modules, leads to a new class of examples of commutative rings of…
In semidefinite programming the dual may fail to attain its optimal value and there could be a duality gap, i.e., the primal and dual optimal values may differ. In a striking paper, Ramana proposed a polynomial size extended dual that does…
In a recent paper [J.Math.Phys. vol42, 2236-2265 (2001)], we discussed differential operators within a quaternionic formulation of quantum mechanics. In particular, we proposed a practical method to solve quaternionic and complex linear…
We introduce two kinds of fractional integral operators; the one is defined via the exponential-integral function $$ E_1(x)=\int_x^\infty \frac{e^{-t}}{t}\,dt,\quad x>0, $$ and the other is defined via the special function $$…
Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who…
Turing's famous 'machine' model constitutes the first intuitively convincing framework for computing with real numbers. Kleene's computation schemes S1-S9 extend Turing's approach and provide a framework for computing with objects of any…
Value functions derived from Markov decision processes arise as a central component of algorithms as well as performance metrics in many statistics and engineering applications of machine learning techniques. Computation of the solution to…
Spectral Barron spaces, constituting a specialized class of function spaces that serve as an interdisciplinary bridge between mathematical analysis, partial differential equations (PDEs), and machine learning, are distinguished by the decay…