Related papers: Finite Inverse Categories as Signatures
Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…
We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…
We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…
We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…
We define a notion of finite type invariants for links with a fixed linking matrix. We show that Milnor's triple link homotopy invariant is a finite type invariant, of type 1, in this sense. We also generalize the approach to Milnor's…
We introduce the category of finite strings and study its basic properties. The category is closely related to the augmented simplex category, and it models categories of linear representations. Each lattice of non-crossing partitions…
We define the notion of duality categories as generalization of duality groups. Two examples are treated. The first is the Serre duality in the categories of strict polynomial functors. The second concerns finite complexes. We show in…
Lenses, optics and dependent lenses (or equivalently morphisms of containers, or equivalently natural transformations of polynomial functors) are all widely used in applied category theory as models of bidirectional processes. From the…
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free…
Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…
We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…
This paper is an expository account of the theory of stable infinity categories. We prove that the homotopy category of a stable infinity category is triangulated, and that the collection of stable infinity categories is closed under a…
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
The Ehresmann-Schein-Nambooripad theorem gives a structure theorem for inverse monoids: they are inductive groupoids. A particularly nice case due to Jarek is that commutative inverse monoids become semilattices of abelian groups. It has…
We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…
In this note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is…
In this paper we study grouplike monoids, these are monoids that contain a group to which we add an ordered set of idempotents. We classify finite categories with two objects having grouplike endomorphism monoids, and we give a count of…
In this paper we formalize some foundation concepts and theorems of group theory in a variant of type theory called the Calculus of Constructions with Definitions. In this theory we introduce definition of a group, which is both general and…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…