Related papers: Preservation of Equations by Monoidal Monads

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…

Let $\mathcal{E}$ and $\mathcal{F}$ be symmetrically $\Delta$-normed (in particular, quasi-normed) operator spaces affiliated with semifinite von Neumann algebras $\mathcal{M}_1$ and $\mathcal{M}_2$, respectively. We establish a…

We can approximate a continuous self-map $f$ of a compact metric space by discretizing the space into a grid. Through either the map itself or a time series, $f$ induces a multivalued grid map $\mathcal F$. The dynamical properties of…

Isometries of metric spaces $(X,d)$ preserve all level sets of $d$. We formulate and prove cases of a conjecture asserting if $X$ is a complete Riemannian manifold, then a function $f:X \rightarrow X$ preserving at least one level set…

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

An ultrametric preserving function $f$ is said to be strongly ultrametric preserving if ultrametrics $d$ and $f \circ d$ define the same topology on $X$ for each ultrametric space $(X,d)$. The set of all strongly ultrametric preserving…

Let $(X,\mathcal{B},\mu)$ be a standard probability space. We give new fundamental results determining solutions to the coboundary equation: \begin{eqnarray*} f = g - g \circ T \end{eqnarray*} where $f \in L^p$ and $T$ is ergodic invertible…

It is shown that shape preservation is decidable for top-down tree transducers, bottom-up tree transducers, and for compositions of total deterministic macro tree transducers. Moreover, if a transducer is shape preserving, then it can be…

Topoi are categories which have enough structure to interpret higher order logic. They admit two notions of morphism: logical morphisms which preserve all of the structure and therefore the interpretation of higher order logic, and…

In this paper, we describe linear maps between complex Banach algebras that preserve products equal to fixed elements. This generalizes some important special cases where the fixed elements are the zero or identity element. First we show…

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…

Given a rational monomial map, we consider the question of finding a toric variety on which it is algebraically stable. We give conditions for when such variety does or does not exist. We also obtain several precise estimates of the degree…

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural…

In this paper we study the representation theory of three monoids of partial functions on an $n$-set. The monoid of all order-preserving functions (i.e., functions satisfying $f(x)\leq f(y)$ if $x\leq y$) the monoid of all order-decreasing…

We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…

For metric spaces $X$ and $Y$, normed spaces $E$ and $F$, and certain subspaces $A(X,E)$ and $A(Y,F)$ of vector-valued continuous functions, we obtain a complete characterization of linear and bijective maps $T:A(X,E)\to A(Y,F)$ preserving…

For discretisations of hyperbolic conservation laws, mimicking properties of operators or solutions at the continuous (differential equation) level discretely has resulted in several successful methods. While well-posedness for nonlinear…

In recent years, there has been increasing interest in explanation methods for neural model predictions that offer precise formal guarantees. These include abductive (respectively, contrastive) methods, which aim to compute minimal subsets…

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

In this work, we study 'reduction monads', which are essentially the same as monads relative to the free functor from sets into multigraphs. Reduction monads account for two aspects of the lambda calculus: on the one hand, in the monadic…