Related papers: Polynomial functors and trees
A vector species is a functor from the category of finite sets with bijections to vector spaces; informally, one can view this as a sequence of $S_n$-modules. A Hopf monoid (in the category of vector species) consists of a vector species…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…
{\em Galois comodules} over a coring can be characterised by properties of the relative injective comodules. They motivated the definition of {\em Galois functors} over some comonad (or monad) on any category and in the first section of the…
We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…
Given $n \geq 1$, we study the existence of a tree on $n$ vertices whose independence polynomial is symmetric and unimodal as well as the existence of a symmetric and unimodal independence polynomial of degree $n$ of a tree.
We study the existence and left properness of transferred model structures for "monoid-like" objects in monoidal model categories. These include genuine monoids, but also all kinds of operads as for instance symmetric, cyclic, modular,…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
We construct a modular functor which takes its values in the monoidal bicategory of finite categories, left exact functors and natural transformations. The modular functor is defined on bordisms that are 2-framed. Accordingly we do not need…
Monoidal functors U:C --> M with left adjoints determine, in a universal way, monoids T in the category of oplax monoidal endofunctors on M. Such monads will be called bimonads. Treating bimonads as abstract "quantum groupoids" we derive…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
Given an $\mathbb{N}$-weighted tree automaton, we give a decision procedure for exponential vs polynomial growth (with respect to the input size) in quadratic time, and an algorithm that computes the exact polynomial degree of growth in…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
This note is an introduction to several generalizations of the dendroidal sets of Moerdijk--Weiss. Dendroidal sets are presheaves on a category of rooted trees, and here we consider indexing categories whose objects are other kinds of…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Arboreal categories were introduced as an axiomatic framework for game comonads, which provide a comonadic view on many model-comparison games in logic. We demonstrate the inadequacy of the axiom stating that paths are connected. We then…
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.
We study commutative ring structures on the integral span of rooted trees and $n$-dimensional skew shapes. The multiplication in these rings arises from the smash product operation on monoid representations in pointed sets. We interpret…
The category of contexts underlying a model of Martin-L\"of type theory with Unit-, $\Sigma$-, and $\Pi$-types need not be locally Cartesian closed, but is necessarily a $\pi$-clan. We exploit this $\pi$-clan structure to build the theory…