Related papers: The List Object Endofunctor is Polynomial

We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…

A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…

We propose a new description of Endofunctors of Module Categories, based upon a combinatorial category comprising finite sets and so-called mazes. Polynomial and numerical functors both find a natural interpretation in this frame-work.…

In this paper, we generalize the principle of the Long-Moody construction for representations of braid groups to other groups, such as mapping class groups of surfaces. Namely, we introduce endofunctors over a functor category that encodes…

We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…

This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…

A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…

We prove that for a large class of well-behaved cocomplete categories $\mathcal C$ the weak and strong Drinfeld centers of the monoidal category $\mathcal{E}$ of cocontinuous endofunctors of $\mathcal{C}$ coincide. This generalizes similar…

The main result concerns a bicategorical factorization system on the bicategory $\mathrm{Cat}$ of categories and functors. Each functor $A\xra{f} B$ factors up to isomorphism as $A\xra{j}E\xra{p}B$ where $j$ is what we call an ultimate…

Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…

In previous work, categories of algebras of endofunctors were shown to be enriched in categories of coalgebras of the same endofunctor, and the extra structure of that enrichment was used to define a generalization of inductive data types.…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

We show that the number of bifurcation points at infinity of a polynomial function f : C2 -> C is at most the number of branches at infinity of a generic fiber of f and that this upper bound can be diminished by one in certain cases.

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

We study polynomial functors in the incompressible category $\text{Ver}_4^+$, which can be viewed as super polynomial functors in characteristic 2. Concretely, we classify additive, exact and simple polynomial functors, and describe how…

Let M be a smooth manifold, and let O(M) be the poset of open subsets of M. Manifold calculus, due to Goodwillie and Weiss, is a calculus of functors suitable for studying contravariant functors (cofunctors) F: O(M)--> Top from O(M) to the…