Related papers: Polynomial functors and opetopes

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…

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…

Given an operad $\mathcal{O}$, we define a notion of weak $\mathcal{O}$-monoids -- which we term $\mathcal{O}$-pseudomonoids -- in a 2-category. In the special case with the 2-category in question is the 2-category $\mathsf{Cat}$ of…

Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…

We introduce a functor $\Psi$ that associates to a dioperad $P$ acting on a vector space $V$ a two-colored operad $\Psi(P)$ acting on the pair $(V, V^*)$. The construction is based on a simple pictorial idea: by selecting one input or…

For a family of polytopes of even dimension $2p$, known as \textit{dual-neighborly}, it has been shown for $p\ne 2$ that the associated intersection of quadrics is a connected sum of sphere products $S^p\times S^p$. In this article we give…

In the present paper we introduce the class of slice-polynomial functions: slice regular functions {defined over the quaternions, outside the real axis,} whose restriction to any complex half-plane is a polynomial. These functions naturally…

A new hierarchy of combinatorial operads is introduced, involving families of regular polygons with configurations of arcs, called decorated cliques. This hierarchy contains, among others, operads on noncrossing configurations, Motzkin…

It was recently conjectured that every system of exceptional orthogonal polynomials is related to classical orthogonal polynomials by a sequence of Darboux transformations. In this paper we prove this conjecture, which paves the road to a…

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…

Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of lambda-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc's), vastly…

Batanin and Leinster's work on globular operads has provided one of many potential defnitions of a weak $\omega$-category. Through the language of globular operads they construct a monad whose algebras encode weak $\omega$-categories. The…

Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

Lifting attempts to speed up probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the…

Polynomial functors are sums of covariant representable functors from the category of sets to itself. They have a robust theory with many applications -- from operads and opetopes to combinatorial species. In this paper, we define a…

Rigorous modelling of natural and industrial systems still conveys various challenges related to abstractions, methods to proceed with and easy-to-use tools to build, compose and reason on models. Operads are mathematical structures that…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…