Related papers: A category for bijective combinatorics
We show how to define biproducts up to isomorphism in an arbitrary category without assuming any enrichment. The resulting notion coincides with the usual definitions whenever all binary biproducts exist or the category is suitably…
We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…
A matching from a finite subset $A$ of an abelian group $G$ to another subset $B$ is a bijection $f : A \to B$ such that $af(a) \notin A$ for all $a \in A$. The study of matchings began in the 1990s and was motivated by a conjecture of E.…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…
We describe a deterministic process to associate a practical, permanent label to isomorphism classes of abelian varieties defined over finite fields with commutative endomorphism algebra as long as they are ordinary or defined over a prime…
An unrepresentable cohomological functor of finite type of the bounded derived category of coherent sheaves of a compact complex manifold of dimension greater than one with no proper closed subvariety is given explicitly in categorical…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…
The Euler characteristic of a finite category is defined and shown to be compatible with Euler characteristics of other types of object, including orbifolds. A formula for the cardinality of the colimit of a diagram of sets is proved,…
We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…
For a reductive connected group or a finite group over a field of characteristic zero, we define an equivariant algebraic cobordism theory by a generalized version of the double point relation of Levine-Pandharipande. We prove basic…
Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the…
In this paper we introduce the theory of ends and coends in the context of enriched bicategories. This will be an enriched version of the theory introduced in [Cor16], and a bicategorical version of the classical theory of enriched…
We consider sets with infinite addition, called $\Sigma$-monoids, and contribute to their literature in three ways. First, our definition subsumes those from previous works and allows us to relate them in terms of adjuctions between their…
A quasi-schemoid is a small category whose morphisms are colored with appropriate combinatorial data. In this note, Mitchell's embedding theorem for a tame schemoid is established. The result allows us to give a cofibrantly generated model…
In this paper, we first endow the set of ribbon string links (up to isotopy) with a structure of a cyclic and of a cocyclic set. Next, we relate these (co)cyclic sets with those associated with the coend of a ribbon category. The…
Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…
The notion of a duality between two derived functors as well as an extension theorem for derived functors to larger categories in which they need not be defined is introduced. These ideas are then applied to extend and study the coext…
Constellations are asymmetric generalisations of categories. Although they are not required to possess a notion of range, many natural examples do. These include commonly occurring constellations related to concrete categories (since they…