Related papers: Constructing combinatorial operads from monoids
An implicit operation of a class of similar algebras $\mathsf{K}$ is a collection of first order definable partial functions on the members of $\mathsf{K}$ that is globally preserved by homomorphisms. For instance, "taking inverses" can be…
We explore the link between combinatorics and probability generated by the question "What does a random parking function look like?" This gives rise to novel probabilistic interpretations of some elegant, known generating functions. It…
The aim of this note is to give a detailed account of how symmetric operads can be constructed from planar (non-symmetric) operads, and to carefully spell out the algebraic interplay between these two notions. It is a companion note to the…
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…
We introduce a monoid structure on a certain set of labelled binary trees, by a process similar to the construction of the plactic monoid. This leads to a new interpretation of the algebra of planar binary trees of Loday-Ronco.
We provide a general notion of induced structures of operated algebras in the context of unary-binary operads. This notion fully captures the binary quadratic relations encoded by a unary-binary operad, thereby unifying and formalizing the…
Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing…
We study the four plactic-like monoids that arise by taking the meets and joins of stalactic and taiga congruences. We obtain the combinatorial objects associated with the meet monoids, establishing Robinson-Schensted-like correspondences…
It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads. The…
We introduce a combinatorial model based on measured foliations in surfaces which captures the phenomenology of open/closed string interactions. The predicted equations are derived in this model, and new equations can be discovered as well.…
We develop a new definition of opetopic sets. There are two main technical ingredients. The first is the systematic use of fibrations, which are implicit in most of the approaches in the literature. Their explicit use leads to certain…
We describe a Grothendieck construction for non-symmetric operads with values in categories, and hence in groupoids and posets. The construction produces a 2-category which is operadically fibered over the category D of finite non-empty…
An operad structure on certain bicoloured noncrossing configurations in regular polygons is studied. Motivated by this study, a general functorial construction of enveloping operad, with input a coloured operad and output an operad, is…
We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…
We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…
The purpose of this exposition is to compare the constructions of classical nonsymmetric operads (and their algebras) to that of the globular operads of Leinster and Batanin. It is hoped that, through this comparison, understanding algebras…
In this paper, I introduce a new generalization of the concept of an operad, further generalizing the concept of an opetope introduced by Baez and Dolan, who used this for the definition of their version of non-strict $n$-categories.…
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…
We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.
We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations,…