Related papers: Cartesian closed 2-categories and permutation equi…

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…

A coherence result for symmetric monoidal closed categories with biproducts is shown in this paper. It is explained how to prove, by using the same technique, coherence for compact closed categories with biproducts and for dagger compact…

Logically constrained term rewriting is a relatively new rewriting formalism that naturally supports built-in data structures, such as integers and bit vectors. In the analysis of logically constrained term rewrite systems (LCTRSs),…

We introduce a graded version of dagger closure and prove that it coincides with solid closure for homogeneous ideals in two dimensional $\mathbb{N}$-graded domains of finite type over a field.

Products in double categories, as found in cartesian double categories, are an elegant concept with numerous applications, yet also have a few puzzling aspects. In this paper, we revisit double-categorical products from an unbiased…

In this paper we investigate equivariant recollements of abelian (resp. triangulated) categories. We first characterize when a recollement of abelian (resp. triangulated) categories induces an equivariant recollement, i.e. a recollement…

Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…

We prove that the \emph{permutation closure} of a multiple context-free language is multiple context-free, which extends work of Okhotin and Sorokin [LATA 2020] who showed closure under \emph{cyclic shift}, and complements work of…

We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…

We construct bases for the spaces of higher order modular forms of all orders and weights. We also provide a cohomological interpretation of these forms.

Vector space methods that measure semantic similarity and relatedness often rely on distributional information such as co--occurrence frequencies or statistical measures of association to weight the importance of particular co--occurrences.…

Higher category theory is an exceedingly active area of research, whose rapid growth has been driven by its penetration into a diverse range of scientific fields. Its influence extends through key mathematical disciplines, notably homotopy…

For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…

Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…

Let $\mathbb{F}_2^\omega$ denote the countably infinite dimensional vector space over the two element field and $\operatorname{GL}(\omega, 2)$ its automorphism group. Moreover, let $\operatorname{Sym}(\mathbb{F}_2^\omega)$ denote the…

We characterize virtual double categories of enriched categories, functors, and profunctors by introducing a new notion of double-categorical colimits. Our characterization is strict in the sense that it is up to equivalence between virtual…

Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…