Related papers: Towards enriched universal algebra
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
We define and study a notion of $\textit{commutant}$ for $\mathcal{V}$-enriched $\mathcal{J}$-algebraic theories for a system of arities $\mathcal{J}$, recovering the usual notion of commutant or centralizer of a subring as a special case…
We provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories. We illustrate our methodology by means of two applications: a rational reconstruction of Birkhoff's Equational Logic and a new…
We prove that topological Hochschild homology (THH) arises from a presheaf of circles on a certain combinatorial category, which gives a universal construction of THH for any enriched infinity category. Our results rely crucially on an…
The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…
We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are…
We prove that given $\mathcal{C}$ a presentably symmetric monoidal $\infty$-category, and any essentially small $\infty$-operad $\mathcal{O}$, the $\infty$-category of $\mathcal{O}$-algebras in $\mathcal{C}$ is enriched, tensored and…
The idea in the title is to blow up a finite structure, replacing each 'colour or atom' by infinitely many, using blurs to represent the resulting term algebra, but the blurs are not enough to blur the structure of the finite structure in…
The Agda Universal Algebra Library (agda-algebras) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and…
The category of all $k$-algebras with a bilinear form, whose objects are all pairs $(R,b)$ where $R$ is a $k$-algebra and $b\colon R\times R\to k$ is a bilinear mapping, is equivalent to the category of unital $k$-algebras $A$ for which the…
We develop a general finite-alphabet framework for Euler-type sums based on the notion of a monoidal alphabet. An alphabet of summand letters is called monoidal when it is closed under pointwise multiplication, thereby inducing the usual…
We build bounded solutions to a linear integral equation. Our functions are built as limit of iterated Birkhoff sums over auto-similar dynamical systems. Nous construisons des solutions born\'ees \`a une \'equation int\'egrale. Notre…
We define a higher analogue of Dirac structures on a manifold M. Under a regularity assumption, higher Dirac structures can be described by a foliation and a (not necessarily closed, non-unique) differential form on M, and are equivalent to…
Applying (enriched) categorical structures we define the notion of ordered sheaf on a quantaloid Q, which we call `Q-order'. This requires a theory of semicategories enriched in the quantaloid Q, that admit a suitable Cauchy completion.…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
A higher dimensional analogue of the notion of vertex algebra is formulated in terms of formal variable language with Borcherds' notion of $G$-vertex algebra as a motivation. Some examples are given and certain analogous duality properties…
We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…
Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…
In this article, we present a fresh perspective on language, combining ideas from various sources, but mixed in a new synthesis. As in the minimalist program, the question is whether we can formulate an elegant formalism, a universal…
Cumulants are a notion that comes from the classical probability theory, they are an alternative to a notion of moments. We adapt the probabilistic concept of cumulants to the setup of a linear space equipped with two multiplication…