Related papers: Polynomial functors and opetopes

In this article, we characterize convexity in terms of algebras over a PROP, and establish a tensor-product-like symmetric monoidal structure on the category of convex sets. Using these two structures, and the theory of $\scr{O}$-monoidal…

This paper introduces the notion of Brauer-friendly modules, a generalisation of endo-p-permutation modules. A module over a block algebra OGe is said to be Brauer-friendly if it is a direct sum of indecomposable modules with compatible…

We define triangulated factorization systems on triangulated categories, and prove that a suitable subclass thereof (the normal triangulated torsion theories) corresponds bijectively to $t$-structures on the same category. This result is…

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

It is well known that strict $\omega$-categories, strict $\omega$-functors, strict natural $\omega$-transformations, and so on, form a strict $\omega$-category. A similar property for weak $\omega$-categories is one of the main hypotheses…

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…

We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of unordered interval graphs, any query is…

We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…

This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…

We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of…

We introduce a suitable notion of integral operators (comprising the fractional Laplacian as a particular case) acting on functions with minimal requirements at infinity. For these functions, the classical definition would lead to divergent…

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

In the theory of the moduli-stacks of n-pointed stable curves, there are two fundamental functors, contraction and stabilization. These functors are constructed in [4], where they are used to show that the various \bar{M_{g,n}}'s are…

Unstable operations in a generalized cohomology theory E give rise to a functor from the category of algebras over E to itself which is a colimit of representable functors and a comonoid with respect to composition of such functors. In this…

We construct an explicit minimal model for an algebra over the cobar-construction of a differential graded operad. The structure maps of this minimal model are expressed in terms of sums over decorated trees. We introduce the appropriate…

We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…

We introduce two new classes of single-valued contractions of polynomial type defined on a metric space. For the first one, called the class of polynomial contractions, we establish two fixed point theorems. Namely, we first consider the…