Related papers: On examples of difference operators for $\{0,1\}$-…
Finitary monads on $\mathsf{Pos}$ are characterized as the precisely the free-algebra monads of varieties of algebras. These are classes of ordered algebras specified by inequations in context. Analagously, finitary enriched monads on…
We develop an $\infty$-categorical version of the classical theory of polynomial and analytic functors, initial algebras, and free monads. Using this machinery, we provide a new model for $\infty$-operads, namely $\infty$-operads as…
In this contribution we consider the sequence $\{Q_{n}^{\lambda}\}_{n\geq 0} $ of monic polynomials orthogonal with respect to the following inner product involving differences \begin{equation*} \langle p,q\rangle…
This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…
We consider Hadamard fractional derivatives and integrals of variable fractional order. A new type of fractional operator, which we call the Hadamard-Marchaud fractional derivative, is also considered. The objective is to represent these…
We consider an integral operator $\mathcal{I}$, special instances of which was studied in various contexts. Using an appropriate transformation we write this operator in terms of weighted composition operators. Then, we provide a…
We study the duals of a certain class of finite-dimensional operator systems, namely the class of operator systems associated to tolerance relations on finite sets or equivalently the class of operator systems that are associated with…
We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…
We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads,…
We introduce discrete equational theories where operations are induced by those having discrete arities. We characterize the corresponding monads as monads preserving surjections. Using it, we prove Birkhoff type theorems for categories of…
This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…
Related to a semigroup of operators on a metric measure space, we define and study pseudodifferential operators (including the setting of Riemannian manifold, fractals, graphs ...). Boundedness on $L^p$ for pseudodifferential operators of…
The problem of equivalency for linear differential operators of the first order is discussed.
First-order automatic differentiation is a ubiquitous tool across statistics, machine learning, and computer science. Higher-order implementations of automatic differentiation, however, have yet to realize the same utility. In this paper I…
We investigate the behavior of extension monads, introduced in the 1990s by the second author, in terms of structure results for infinitely many finitary operations and common constructions in varieties or categories of algebras.…
Integration over curved manifolds with higher codimension and, separately, discrete variants of continuous operators, have been two important, yet separate themes in harmonic analysis, discrete geometry and analytic number theory research.…
A differential operator of weight $\lambda$ is the algebraic abstraction of the difference quotient $d_\lambda(f)(x):=\big(f(x+\lambda)-f(x)\big)/\lambda$, including both the derivation as $\lambda$ approaches to $0$ and the difference…
We introduce a new definition of topological degree for a meaningful class of operators which need not be continuous. Subsequently, we derive a number of fixed point theorems for such operators. As an application, we deduce a new existence…
We propose to compute approximations to general invariant sets in dynamical systems by minimizing the distance between an appropriately selected finite set of points and its image under the dynamics. We demonstrate, through computational…
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…