Related papers: The B\'enabou-Roubaud theorem via string diagrams
A geometric p-rough path can be seen to be a genuine path of finite p-variation with values in a Lie group equipped with a natural distance. The group and its distance lift (R^{d},+,0) and its Euclidean distance. This approach allows us to…
We completely characterize the unimodal category for functions $f:\mathbb R\to[0,\infty)$ using a decomposition theorem obtained by generalizing the sweeping algorithm of Baryshnikov and Ghrist. We also give a characterization of the…
The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…
We introduce nominal string diagrams as, string diagrams internal in the category of nominal sets. This requires us to take nominal sets as a monoidal category, not with the cartesian product, but with the separated product. To this end, we…
We develop the theory of n-stacks (or more generally Segal n-stacks which are $\infty$-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main…
We study the topological dynamics of H\'enon maps. For a parameter set generalizing the Benedicks-Carleson parameters (the Wang-Young parameter set) we obtain the following: The pruning front conjecture (due to Cvitanovi\'c); A kneading…
Given a symmetric monoidal stable $\infty$-category $\mathcal{C}$ and a left adjoint symmetric monoidal fiber functor to $\operatorname{Mod}_A^{\otimes}$ for some $\mathbb{E}_{\infty}$-ring $A$, one can construct a derived group scheme $G$…
By a closure space we will mean a pair $(A,\mathcal{C})$, in which $A$ is a set and $\mathcal{C}$ a set of subsets of $A$ closed under arbitrary intersections. The purpose of this paper is to initiate a development of descent theory of…
We propose to study transformations on graphs, and more generally structures, by looking at how the cut-rank (as introduced by Oum) of subsets is affected when going from the input structure to the output structure. We consider…
We determine which bipartite graphs embedded in a torus are move-reduced. In addition, we classify equivalence classes of such move-reduced graphs under square/spider moves. This extends the class of minimal graphs on a torus studied by…
Under a stronger genericity condition, we prove the local analogue of ghost conjecture of Bergdall and Pollack. As applications, we deduce in this case (a) a folklore conjecture of Breuil--Buzzard--Emerton on the crystalline slopes of…
We present a string theory that reproduces the large-$N$ expansion of two dimensional Yang-Mills gauge theory on arbitrary surfaces. First, a new class of topological sigma models is introduced, with path integrals localized to the moduli…
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…
We present a simple set-theoretic proof of the Banach-Stone Theorem .We thus apply this Topological classification theorem to the still unsolved problem of topological classification of euclidean manifolds through two conjectures and…
This elementary survey article was prepared for a talk at the 2016 Superschool on Derived Categories and D-branes. The goal is to outline an identification of the bounded derived category of coherent sheaves on a Calabi-Yau threefold with…
The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
In the article 'Recursive queries on trees and data trees' (ICDT'13), Abiteboul et al., asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is…
We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher rank graphs. Afterwards we will examine the properties of…
We obtain, under an additional assumption on the subanalytic abnormal distribution constructed in [4], a proof of the minimal rank Sard conjecture in the analytic category. It establishes that from a given point the set of points accessible…