Related papers: The Catalan simplicial set
Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…
We define a weighted analog for the multidimensional Catalan numbers, obtain matrix-based recurrences for some of them, and give conditions under which they are periodic. Building on this framework, we introduce two new sequences of…
In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
We introduce the simple notion of a "crystallographic arrangement" and prove a one-to-one correspondence between these arrangements and the connected simply connected Cartan schemes for which the real roots are a finite root system (up to…
We consider a notion of "numerosity" for sets of tuples of natural numbers, that satisfies the five common notions of Euclid's Elements, so it can agree with cardinality only for finite sets. By suitably axiomatizing such a notion, we show…
In this paper we study the representation theory of three monoids of partial functions on an $n$-set. The monoid of all order-preserving functions (i.e., functions satisfying $f(x)\leq f(y)$ if $x\leq y$) the monoid of all order-decreasing…
The notion of a mesh pattern was introduced recently, but it has already proved to be a useful tool for description purposes related to sets of permutations. In this paper we study eight mesh patterns of small lengths. In particular, we…
We introduce the concept of a dendroidal set. This is a generalization of the notion of a simplicial set, specially suited to the study of operads in the context of homotopy theory. We define a category of trees, which extends the category…
The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains…
We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type-uniform proof…
The category of Cartesian cubical sets is introduced and endowed with a Quillen model structure using ideas coming from recent constructions of cubical systems of univalent type theory.
We study and classify faithfully balanced modules for the algebra of lower triangular $n$ by $n$ matrices. The theory extends known results about tilting modules, which are classified by binary trees, and counted with the Catalan numbers.…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
We define an interesting sub-category of the category of simplicial sets, $\Sr$, whose objects are called regular. Both it and the subcategory ${\cal S}_{f-{\rm reg}}$ of finite regular simplicial sets have good stability properties under…
A simplicial set is said to be non-singular if its non-degenerate simplices are embedded. Let $sSet$ denote the category of simplicial sets. We prove that the full subcategory $nsSet$ whose objects are the non-singular simplicial sets…
In this paper we first study clusters in type $\tilde{\mathbb{A}}$ by collecting them into a finite number of infinite families given by Dehn twists of their corresponding triangulations, and show that these families are counted by the…
This is a report on aspects of the theory and use of monoidal categories. The first section introduces the main concepts through the example of the category of vector spaces. String notation is explained and shown to lead naturally to a…
We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of…
It is known that monoidal categories have a finite definition, whereas multicategories have an infinite (albeit finitary) definition. Since monoidal categories correspond to representable multicategories, it goes without saying that…