Related papers: Abstract composition laws and their modulation spa…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
We study modules over stacks of deformation quantization algebroids on complex Poisson manifolds. We prove finiteness and duality theorems in the relative case and construct the Hochschild class of coherent modules. We prove that this class…
The purpose of this paper is to study sparse domination estimates of composition operators in the setting of complex function theory. The method originates from proofs of the $A_2$ theorem for Calder\'on-Zygmund operators in harmonic…
We study a composition operator on Lorentz spaces. In particular we provide necessary and sufficient conditions under which a measurable mapping induces a bounded composition operator.
We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as…
Various formulas for reciprocals of densely defined weighted composition operators in $L^2$-spaces as well as for their adjoints are provided. The relation between the reciprocal of a weighted composition operator and the product of the…
We introduce some general classes of pseudodifferential operators with symbols admitting exponential type growth at infinity and we prove mapping properties for these operators on Gelfand-Shilov spaces both in the quasi-analytic and in the…
We propose a set of compositional design patterns to describe a large variety of systems that combine statistical techniques from machine learning with symbolic techniques from knowledge representation. As in other areas of computer science…
Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose…
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
Abstracting from a low level to a more explanatory high level of description, and ideally while preserving causal structure, is fundamental to scientific practice, to causal inference problems, and to robust, efficient and interpretable AI.…
We study compactness property of composition operator acting from a model space generated by an inner function to the Hardy space.
We introduce the notion of a subregular subalgebra, which we believe is useful for classification of subalgebras of Lie algebras. We use it to construct a non-regular invariant generalized complex structure on a Lie group. As an…
Despite ample evidence that our concepts, our cognitive architecture, and mathematics itself are all deeply compositional, few models take advantage of this structure. We therefore propose a radically compositional approach to computational…
We study the composition operators on an algebra of Dirichlet series, the analogue of the Wiener algebra of absolutely convergent Taylor series, which we call the Wiener-Dirichlet algebra. The central issue is to understand the connection…
The space of symbols of differential operators on a smooth manifold (i.e., the space of symmetric contravariant tensor fields) is naturally a module over the Lie algebra of vector fields. We study, in the case of $\bf R^n$ with $n\geq2$,…
We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context structural rules given by exchange (linear theory)…
In this paper, we study moduli spaces of 2-dimensional complex associative algebras. We give a complete calculation of the cohomology of every element in the moduli space, as well as compute their versal deformations.
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mechanism takes a scenario describing the constituent interacting…