Related papers: Algebraic coherent confluence and higher globular …
We introduce a stable and efficient complex Langevin (CL) scheme to enable the first numerical simulations of the coherent-states (CS) formulation of polymer field theory. In contrast with Edwards' well known auxiliary-field (AF) framework,…
This is the second of a series of articles devoted to the study of relaxed highest-weight modules over affine vertex algebras and W-algebras. The first studied the simple "rank-$1$" affine vertex superalgebras $L_k(\mathfrak{sl}_2)$ and…
We introduce a method to define $C^*$-algebras from $C^*$-correspondences. Our construction generalizes Cuntz-Pimsner algebras, crossed products by Hilbert $C^*$-modules, and graph algebras.
This is a slightly revised version of lectures notes for a course in Summer 2022 joint between Bonn and Copenhagen, intended as a stable citable version. The goal of this course is to make our general approach to analytic geometry via…
Kleene algebra with tests (KAT) is a foundational equational framework for reasoning about programs, which has found applications in program transformations, networking and compiler optimizations, among many other areas. In his seminal…
We develop a new general framework for algebras and clones, called Universal Clone Algebra. Algebras and clones of finitary operations are to Universal Algebra what t-algebras and clone algebras are to Universal Clone Algebra. Clone…
It is shown how the theory of classical $W$--algebras can be formulated on a higher genus Riemann surface in the spirit of Krichever and Novikov. An intriguing relation between the theory of $A_1$ embeddings into simple Lie algebras and the…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
We show that in case a cluster algebra coincides with its upper cluster algebra and the cluster algebra admits a grading with finite dimensional homogeneous components, the corresponding Berenstein-Zelevinsky quantum cluster algebra can be…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offers a (co)algebraic framework for studying processes with algebraic branching structures and recursion operators. The framework captures Milner's algebra of regular…
Concurrent Kleene Algebra (CKA) is a formalism to study concurrent programs. Like previous Kleene Algebra extensions, developing a correspondence between denotational and operational perspectives is important, for both foundations and…
We present Metatheory, a comprehensive library for programming language foundations in Lean 4. The library features a modular framework for proving confluence of abstract rewriting systems using three classical proof techniques: the diamond…
We show how finite limits and colimits can be calculated compositionally using the algebras of spans and cospans, and give as an application a proof of the Kleene Theorem on regular languages.
Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step. We provide a countermodel witnessing that the…
The classification of Grassmannian cluster algebras resembles that of regular polygonal tilings. We conjecture that this resemblance may indicate a deeper connection between these seemingly unrelated structures.
In this paper, homological methods together with the theory of formal languages of theoretical computer science are proved to be effective tools to determine the growth and the Hilbert series of an associative algebra. Namely, we construct…
We introduce Probabilistic Regular Expressions (PRE), a probabilistic analogue of regular expressions denoting probabilistic languages in which every word is assigned a probability of being generated. We present and prove the completeness…
We initiate the systematic study of endomorphism algebras of permutation modules and show they are obtainable by a descent from a certain "generic" Hecke algebra, infinite-dimensional in general, coming from the universal enveloping algebra…
Local Completeness Logic (LCL) has been put forward as a program logic for proving both the correctness and incorrectness of program specifications. LCL is an abstract logic, parameterized by an abstract domain that allows combining over-…