Related papers: A category for bijective combinatorics
A groupoid is a small category in which all morphisms are isomorphisms. An inductive groupoid is a specialised groupoid whose object set is a regular biordered set and the morphisms admit a partial order. A normal category is a specialised…
We show that every combinatorial model category can be obtained, up to Quillen equivalence, by localizing a model category of diagrams of simplicial sets. This says that any combinatorial model category can be built up from a category of…
This paper continues the research of the author on the homology of cubical and semi-cubical sets with coefficients in systems of objects. The main result is the theorem that the homology of cubical sets with coefficients in contravariant…
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
Many types of categorical structure obey the following principle: the natural notion of equivalence is generated, as an equivalence relation, by identifying $A$ with $B$ when there exists a strictly structure-preserving map $A \to B$ that…
Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…
The Leinster matrix corresponding to a finite category has entries counting the number of morphisms between objects. A first question is to know which positive integer matrices come from at least one finite category. Here, that question…
We prove that a Hom-finite additive category having determined morphisms on both sides is a dualizing variety. This complements a result by Krause. We prove that in a Hom-finite abelian category having Serre duality, a morphism is right…
We study centrality of morphisms in a setting derived from that of a pointed category in which binary products commute with coequalisers. The main results of this paper show that much of the behaviour of central morphisms for unital…
We introduce a finiteness property for braided fusion categories, describe a conjecture that would characterize categories possessing this, and verify the conjecture in a number of important cases. In particular we say a category has F if…
We say that two permutations $[n]\to [n]$ intersect if they map some element $x$ to the same element $y$. A matching in a family of permutations is a collection of pairwise disjoint permutations. In this paper, we study families of…
A classification of (countable) direct limits of finite dimensional involution simple associative algebras over an algebraically closed field of arbitrary characteristic is obtained. This also classifies the corresponding dimension groups.…
A theorem due to Ohkawa states that the collection of Bousfield equivalence classes of spectra is a set. We extend this result to arbitrary combinatorial model categories.
The homology cobordism group of homology cylinders is a generalization of the mapping class group and the string link concordance group. We study this group and its filtrations by subgroups by developing new homomorphisms. First, we define…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…
EI-categories are a simultaneous generalisation of finite groups and finite quivers without oriented cycles. It is therefore a natural question to ask for a characterisation of finite representation type. For special classes of…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
We introduce a complete set of combinatorial data that encode the category $2\mathfrak{Cob}$ of all $2$-cobordisms. As an application, we show that the local monoids of $2\mathfrak{Cob}$ do not have finitely axiomatizable equational…