相关论文: Polynomial functors and opetopes

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 use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

We study oplax colimits of stable categories, of hermitian categories and of Poincar\'e categories in nice cases. This allows us to produce a categorical model of the assembly map of a bordism-invariant functor of Poincar\'e categories…

Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…

For any coloured operad R, we prove a Fa\`a di Bruno formula for the `connected Green function' in the incidence bialgebra of R. This generalises on one hand the classical Fa\`a di Bruno formula (dual to composition of power series),…

Classical spectral theory provides powerful tools for analyzing linear operators, but does not extend naturally to nonlinear or compositional settings. In particular, there is no general way to transport spectral invariants in a functorial…

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…

Tree-like tableaux are combinatorial objects that appear in a combinatorial understanding of the PASEP model from statistical mechanics. In this understanding, the corners of the Southeast border correspond to the locations where a particle…

We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

We introduce Hopf polyads in order to unify Hopf monads and group actions on monoidal categories. A polyad is a lax functor from a small category (its source) to the bicategory of categories, and a Hopf polyad is a comonoidal polyad whose…

In the plane, we consider the problem of reconstructing a domain from the normal derivative of its Green's function (with fixed pole) relative to the Dirichlet problem for the Laplace operator. By means of the theory of conformal mappings,…

We explore a combinatorial bijection between two seemingly unrelated topics: the roots of irreducible polynomials of degree $m$ over a finite field $F_p$ for a prime number $p$ and the number of points that are periodic of order $m$ for a…

We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…

We introduce a notion of normalised oplax $3$-functor suitable for the elementary homotopy theory of strict $3$-categories, following the combinatorics of orientals. We show that any such morphism induces a morphism of simplicial sets…

This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…

The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…

In this paper, motivated by the theory of operads and PROPs we reveal the combinatorial nature of tensor calculus for strict tensor categories and show that there exists a monad which is described by the coarse-graining of graphs and…