Related papers: The B\'enabou-Roubaud theorem via string diagrams
We prove a new convergence result for the slice spectral sequence, following work by Levine and Voevodsky. This verifies a derived variant of Voevodsky's conjecture on convergence of the slice spectral sequence. This is, in turn, a…
Via the adjunction $ - \boldsymbol{\cdot} 1 \dashv \mathcal V(1,-) \colon \mathsf{Span}(\mathcal V) \to \mathcal V \text{-} \mathsf{Mat} $ and a cartesian monad $ T $ on an extensive category $ \mathcal V $ with finite limits, we construct…
We prove that every class of graphs $\mathscr C$ that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear…
A mechanism of generating the metric is proposed, where the Kalb-Ramond symmetry existing in the topological BF theory is broken through the condensation of the string fields which are so introduced as to couple with the anti-symmetric…
We prove an analogue of James-Donkin row removal theorems for arbitrary diagrammatic Cherednik algebras. This is one of the first results concerning the (graded) decomposition numbers of these algebras over fields of arbitrary…
We prove that if the classical Baum-Connes conjecture in complex K-theory is true (for a given discrete group G), then the conjecture is also true in the real case (for the same group G). The essential ingredients of the proof are the…
In a recent paper, Kwon and Oum claim that every graph of bounded rank-width is a pivot-minor of a graph of bounded tree-width (while the converse has been known true already before). We study the analogous questions for "depth" parameters…
We prove a p-adic analogue of W\"ustholz's analytic subgroup theorem. We apply this result to show that a curve embedded in its Jacobian intersects the p-adic closure of the Mordell-Weil group transversely whenever the latter has rank equal…
We propose a combinatorial and graph-theoretic theory of dropout by modeling training as a random walk over a high-dimensional graph of binary subnetworks. Each node represents a masked version of the network, and dropout induces stochastic…
We give a simple combinatorial description of the elliptic endoscopic data of a twisted space under a group $G$, assuming that $G$ is semi-simple and simply connected. Assuming the same hypothesis and that the base field is a number field,…
We develop a formalism for studying descent and codescent in the context of Iwasawa theory. The main result essentially states that to control descent or codescent amounts to the same. Arithmetic applications are given.
We prove the Martingale Convergence Theorem by using the work of L. Dubins and I. Monroe about embedding a given discrete-time martingale in the sample paths of a Brownian motion.
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or…
In work of Fokkinga and Meertens a calculational approach to category theory is developed. The scheme has many merits, but sacrifices useful type information in the move to an equational style of reasoning. By contrast, traditional proofs…
We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…
We show that gradient descent converges to a local minimizer, almost surely with random initialization. This is proved by applying the Stable Manifold Theorem from dynamical systems theory.
We develop the formal theory of monads, as established by Street, in univalent foundations. This allows us to formally reason about various kinds of monads on the right level of abstraction. In particular, we define the bicategory of monads…
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as a monad) and its dynamics (an endofunctor). This setup is…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…