Related papers: On examples of difference operators for $\{0,1\}$-…
In a previous study, the algebraic formulation of the First Fundamental Theorem of Calculus (FFTC) is shown to allow extensions of differential and Rota-Baxter operators on the one hand, and to give rise to categorical explanations using…
We study topological boundedness of order-to-topology bounded and order-to-topology continuous operators from ordered vector spaces to topological vector spaces. The uniform boundedness principle for such operators is investigated.
In this paper, we introduce statistical bounded set on topological vector space. Also, we consider three classes of bounded operators from topological vector spaces to ordered topological vector spaces. Moreover, we give relations between…
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…
For a small involutive quantaloid $\mathcal{Q}$, it is shown that the category of separated complete $\mathcal{Q}$-categories and left adjoint $\mathcal{Q}$-functors is strictly monadic over the category of symmetric…
In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad.…
Resolvents of set-valued operators play a central role in various branches of mathematics and in particular in the design and the analysis of splitting algorithms for solving monotone inclusions. We propose a generalization of this notion,…
We introduce the notion of irregular vertex (operator) algebras. The irregular versions of fundamental properties, such as Goddard uniqueness theorem, associativity and operator product expansions are formulated and proved. We also give…
Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of…
Large scale real number computation is an essential ingredient in several modern mathematical proofs. Because such lengthy computations cannot be verified by hand, some mathematicians want to use software proof assistants to verify the…
We give two examples of algebras of differential operators associated to families of matrix valued orthogonal polynomials arising from representations of SU$(N+1)$. The first one gives a commutative algebra and the second one a…
We develop the theory of relative monads and relative adjunctions in a virtual equipment, extending the theory of monads and adjunctions in a 2-category. The theory of relative comonads and relative coadjunctions follows by duality. While…
This dissertation concerns the pseudo-differential operators of type 1,1. These have been known especially since around 1980, when it was shown that they play an important role in the treatment of fully non-linear partial differential…
Fix a manifold M, and let V be an infinite dimensional Lie algebra of vector fields on M. Assume that V contains a finite dimensional semisimple maximal subalgebra A, the projective or conformal subalgebra. A projective or conformal…
We construct a family of pairwise commuting operators such that the Macdonald symmetric functions of infinitely many variables $x_1,x_2,...$ and of two parameters $q,t$ are their eigenfunctions. These operators are defined as limits at…
In this paper, we investigate shared value problems for shifts and higher-order difference operators of meromorphic and entire functions in several complex variables. Using Nevanlinna theory in $\mathbb{C}^n$, we obtain new uniqueness…
In this paper, motivated by the theory of operads and PROPs we reveal the combinatorial nature of tensor calculus for strict tensor categories and show that there exists a monad which is described by the coarse-graining of graphs and…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…
We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.