Related papers: Polygraphs and Discrete Conduch{\'e} $\omega$-Func…
One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote by $\mathsf{Poly}_{\mathsf{Set}}$ the…
We point out that double categories provide a natural setting for modular functors obtained by a (bicategorical) string-net construction: The source of the modular functor -- which is now a double functor -- is a symmetric monoidal double…
Recently Bowden, Hensel and Webb defined the fine curve graph for surfaces, extending the notion of curve graphs for the study of homeomorphism or diffeomorphism groups of surfaces. Later Long, Margalit, Pham, Verberne and Yao proved that…
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…
This paper, being the sequel of [An inverse problem in Polya-Schur theory. I. Non-genegerate and degenerate operators], studies a class of linear ordinary differential operators with polynomial coefficients called \emph{exactly solvable};…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
Typed metagraphs are defined as hypergraphs with types assigned to hyperedges and their targets, and the potential to have targets of hyperedges connect to whole links as well as targets. Directed typed metagraphs (DTMGs) are introduced via…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…
Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…
A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…
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 introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…
A non-unital algebra in a closed monoidal category is called self-induced if the multiplication induces an isomorphism between A\otimes_A A and A. For such an algebra, we define smoothening and roughening functors that retract the category…
We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…
This paper is a step towards the complete topological classification of {\Omega}-stable diffeomorphisms on an orientable closed surface, aiming to give necessary and sufficient conditions for two such diffeomorphisms to be topologically…
Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to…
We formulate two conjectures about etale cohomology and fundamental groups motivated by categoricity conjectures in model theory. One conjecture says that there is a unique Z-form of the etale cohomology of complex algebraic varieties, up…
Given a projective family of semi-stable curves over a complete discrete valuation ring of characteristic p with algebraically closed residue field, we construct a specialization functor between the category of continuous representations of…
We upgrade the classical operation of \textit{isomonodromic deformations} along a path $\gamma$ to a functor $\mathbb{P}_{\gamma}$ between categories of flat connections with logarithmic singularities along a divisor $D$, which itself…