English
Related papers

Related papers: On combinatorial differential operators on species…

200 papers

Properties of morphisms represented by so-called 'string diagrams' of monoidal categories (and their braided and symmetric derivatives), mainly their resistance in value to isotopic deformation, have made the usage of graphical calculi…

Category Theory · Mathematics 2023-04-10 Vihaan Dheer

In classical set theory, there are many equivalent ways to introduce ordinals. In a constructive setting, however, the different notions split apart, with different advantages and disadvantages for each. We consider three different notions…

Logic in Computer Science · Computer Science 2022-08-04 Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

Ornaments aim at taming the multiplication of special-purpose datatype in dependently-typed theory. In its original form, the definition of ornaments is tied to a particular universe of datatypes. Being a type theoretic object,…

Programming Languages · Computer Science 2013-04-23 Pierre-Evariste Dagand , Conor McBride

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

Logic in Computer Science · Computer Science 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…

Combinatorics · Mathematics 2009-09-25 Leopold Travis

We introduce a new definition for the species of type B, or H-species, analog to the classical species (of type A), but on which we consider the action of the groups Bn of signed permutations. We are interested in algebraic structure on…

Combinatorics · Mathematics 2010-10-05 Nantel Bergeron , Philippe Choquette

In this thesis, we present a flexible framework for specifying and constructing operads which are suited to reasoning about network construction. The data used to present these operads is called a \emph{network model}, a monoidal variant of…

Category Theory · Mathematics 2021-01-20 Joe Moeller

We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of…

Combinatorics · Mathematics 2017-07-04 Miguel Méndez , Rafael Sánchez

Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…

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…

Quantum Physics · Physics 2007-05-23 Bob Coecke , David Moore

We define a diagrammatic monoidal category, together with a full and essentially surjective monoidal functor from this category to the category of modules over the exceptional Lie algebra of type $F_4$. In this way, we obtain a set of…

Representation Theory · Mathematics 2025-05-14 Raj Gandhi , Alistair Savage , Kirill Zainoulline

An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.

Algebraic Topology · Mathematics 2012-01-20 Ittay Weiss

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

Combinatorics · Mathematics 2016-10-03 Wenjie Fang

A wealth of geometric and combinatorial properties of a given linear endomorphism $X$ of $\R^N$ is captured in the study of its associated zonotope $Z(X)$, and, by duality, its associated hyperplane arrangement ${\cal H}(X)$. This…

Commutative Algebra · Mathematics 2011-04-11 Olga Holtz , Amos Ron

We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…

Dynamical Systems · Mathematics 2019-02-20 Volodymyr Nekrashevych

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Representation Theory · Mathematics 2023-01-09 Rudolf Tange

The study of abstraction and composition - the focus of category theory - naturally leads to sophisticated diagrams which can encode complex algebraic semantics. Consequently, these diagrams facilitate a clearer visual comprehension of…

Category Theory · Mathematics 2024-06-27 Vincent Abbott , Gioele Zardini

A combinatorial category Disks was introduced by Andr\'e Joyal to play a role in his definition of weak omega-category. He defined the category Theta to be dual to Disks. In the ensuing literature, a more concrete description of Theta was…

Category Theory · Mathematics 2010-07-13 David Oury

An \'etale structure over a topological space $X$ is a continuous family of structures (in some first-order language) indexed over $X$. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model…

Logic · Mathematics 2023-10-19 Ruiyuan Chen

We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an "unbiased" way that a structure of size n gives rise to n…

Discrete Mathematics · Computer Science 2011-03-29 Manuel Bodirsky , Éric Fusy , Mihyun Kang , Stefan Vigerske