Related papers: A categorical approach to additive combinatorics

Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

We axiomatically define (pre-)Hilbert categories. The axioms resemble those for monoidal Abelian categories with the addition of an involutive functor. We then prove embedding theorems: any locally small pre-Hilbert category whose monoidal…

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…

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

This is the second paper in a series on representations over diagrams of abelian categories. We show that, under certain conditions, a compatible family of abelian model categories indexed by a skeletal small category can be amalgamated…

We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…

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…

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

With the increased interest in machine learning, and deep learning in particular, the use of automatic differentiation has become more wide-spread in computation. There have been two recent developments to provide the theoretical support…

Within the framework of unitary easy quantum groups, we study an analogue of Brauer's Schur-Weyl approach to the representation theory of the orthogonal group. We consider concrete combinatorial categories whose morphisms are formed by…

In these self-contained low prerequisite introductory notes we first present (in part 1) basic concepts of set theory and algebra without explicit category theory. We then present (in part 2) basic category theory involving a somewhat…

Categorical compositional distributional semantics is a model of natural language; it combines the statistical vector space models of words with the compositional models of grammar. We formalise in this model the generalised quantifier…

We present a detailed synthetic overview of the utilisation of categorical techniques in the study of order structures together with their applications in operational quantum theory. First, after reviewing the notion of residuation and its…

This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase…

We construct an abelian category C and exact functors in C which on the Grothendieck group descend to the action of a simply-laced quantum group in its adjoint representation. The braid group action in the adjoint representation lifts to an…

This is a survey of several exciting recent results in which techniques originating in the area known as additive combinatorics have been applied to give results in other areas, such as group theory, number theory and theoretical computer…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

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…