Related papers: On examples of difference operators for $\{0,1\}$-…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
We give a description of unital operads in a symmetric monoidal category as monoids in a monoidal category of unital $\Lambda$-sequences. This is a new variant of Kelly's old description of operads as monoids in the monoidal category of…
Notions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are basic programming features, such as reading or updating the…
This is a survey of some recent applications of Boolean valued models of set theory to order bounded operators in vector lattices.
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…
The selection monad on a set consists of selection functions. These select an element from the set, based on a loss (dually, reward) function giving the loss resulting from a choice of an element. Abadi and Plotkin used the monad to model a…
We study monomial operators on $ L^2[0,1]$, that is bounded linear operators that map each monomial $x^n$ to a multiple of $x^{p_n}$ for some $p_n$. We show that they are all unitarily equivalent to weighted composition operators on a Hardy…
We give explicit $q$-difference operators acting diagonally on wreath Macdonald $P$-polynomials in finitely many variables.
We study the set of chords of a real-valued continuous function on [0,1] with f(0)=f(1)=0. We describe which chords may appear as isolated points and provide examples illustrating our characterization. Maximal Hopf sets are introduced and…
This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition…
Several definitions of differential operators on modules over noncommutative rings are discussed.
Fractal sets, by definition, are non-differentiable, however their dimension can be continuous, differentiable, and arithmetically manipulable as function of their construction parameters. A new arithmetic for fractal dimension of polyadic…
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…
In this contribution we consider sequences of monic polynomials orthogonal with respect to Sobolev-type inner product \[ \left\langle f,g\right\rangle _{\lambda,\mu}\!=\!\sum_{x=0}^Nf(x)g(x)\frac{\Gamma(N+1) p^x(1-p)^{N-x} }{\Gamma (N-x+1)…
The n-point correlation functions introduced by Bloch and Okounkov have already found several geometric connections and algebraic generalizations. In this Note we formulate a q,t-deformation of this n-point function. The key operator used…
Fractional difference sequence spaces have been studied in the literature recently. In this work, some identities or estimates for the operator norms and the Hausdorff measures of noncompactness of certain operators on some difference…
In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…
We introduce a generalization of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed lambda-calculus syntax and indexed…
We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these…
V.I. Arnold has recently defined the complexity of finite sequences of zeroes and ones in terms of periods and preperiods of attractors of a dynamic system of the operator of finite differentiation. Arnold has set up a hypothesis that the…