Related papers: Two monads for graphs

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…

We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…

There has been a great deal of research on graphs defined on algebraic structures in the last two decades. In this paper we begin an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this…

Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…

We modify a previous result, which showed that certain diagrams of spaces are essentially simplicial monoids, to construct diagrams of spaces which model simplicial groups. Furthermore, we show that these diagrams can be generalized to…

For a Coxeter system (G,S) the multi-parametric alternating subalgebra H^+(G) of the Hecke algebra and the alternating subgroup B^+(G) of the braid group are defined. Two presentations for H^+(G) and B^+(G) are given; one generalizes the…

We show NP-completeness for the recognition problem of 2-line-bend graphs.

The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify…

We establish a duality between monads and monadic morphisms in any $(\infty,2)$-category and characterize monadic morphisms in a wide class of examples. This duality unifies several dualities between algebraic structures and their…

In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…

The goal of this article is to describe several presentations of the infinity category of algebras over some monad on the infinity category of chain complexes.

We compute magnitude homology of various graphs using algebraic Morse theory. Specifically, we (1) give an alternative proof that trees are diagonal, (2) identify a new class of diagonal graphs, (3) prove that the icosahedral graph is…

We give a new and conceptually straightforward proof of the well-known presentation for the Temperley-Lieb algebra, via an alternative new presentation. Our method involves twisted semigroup algebras, and we make use of two apparently new…

We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings.

In this note we propose an $\omega$-operadical way to prove the existence of the $\omega$-graph of the $\omega$-graphs and the reflexive $\omega$- graph of the reflexive $\omega$-graphs.

This is a condensed overview of the formal theory of monads in a 2-category. We also define two double categories of monads in a 2-category, extending Lack and Street's 2-categories of monads.

This paper continues the study of the homotopy theory of algebras over polynomial monads initiated by the first author and Clemens Berger. We introduce the notion of a quasi-tame polynomial monad (generalizing tame ones) and produce…

By defining grids as graphs, geometric graphs can be represented in a very concise way.

The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed…