Related papers: The B\'enabou-Roubaud theorem via string diagrams
In graph theory, Courcelle's theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved in linear time for graphs of bounded treewidth. We prove such a metatheorem for a…
We extend Bourke and Garner's idempotent adjunction between monads and pretheories to the framework of $\infty$-categories and we use this to prove many classical results about monads in the $\infty$-categorical framework. Amongst other…
We study random walks on sub-Riemannian manifolds using the framework of retractions, i.e., approximations of normal geodesics. We show that such walks converge to the correct horizontal Brownian motion if normal geodesics are approximated…
Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward's decomposition theorem for…
We establish a unified group-theoretic framework bridging the arithmetic homotopy exact sequence of a variety and the Birman exact sequence of a surface. Within this framework, we reinterpret classical arithmetic notions - such as the…
This article contains a complete proof of Gabrielov's rank Theorem, a fundamental result in the study of analytic map germs. Inspired by the works of Gabrielov and Tougeron, we develop formal-geometric techniques which clarify the difficult…
In this small note we present a Tannakian proof of the theorem of Grothendieck-Harder on the classification of torsors under a reductive group on the projective line over a field.
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
The heterotic string occurs as a soliton of the type I superstring in ten dimensions, supporting the conjecture that these two theories are equivalent. The conjecture that the type IIB string is self-dual, with the strong coupling dynamics…
We prove an adelic descent result for localizing invariants: for each Noetherian scheme $X$ of finite Krull dimension and any localizing invariant $E$, e.g., algebraic K-theory of Bass-Thomason, there is an equivalence $E(X)\simeq \lim…
Motivated by the study of periods of automorphic forms and relative trace formulae, we develop the theory of descent necessary to study orbital integrals arising in the fundamental lemma for a general class of symmetric spaces over a…
S. B. Rao conjectured that graphic sequences are well-quasi-ordered under an inclusion based on induced subgraphs. This conjecture has now been settled completely by M. Chudnovsky and P. Seymour. One part of the proof proves the result for…
It is conjectured by Chen and Raspaud that for each integer $k \ge 2$, any graph $G$ with \[ \mathrm{mad}(G) < \frac{2k+1}{k} \quad\text{and}\quad \mathrm{odd\text{-}girth}(G) \ge 2k+1 \] admits a homomorphism into the Kneser graph…
We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
By using a general formalism, we expose a simplified proof of the convergence of the B\'ezier polynomials attached to a continuous function defined in arbitrary dimensional simplex. We obtain an error estimate that contains the error in…
We develop further a kinetic theory of strings and derive a transport equation for a network of cosmic strings with Nambu-Goto evolution, interactions and background gravitational effects taken into account. We prove an H-theorem and obtain…
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…
We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…