Related papers: Double graph complex and characteristic classes of…

We recall and define various kinds of supersingular $\ell$-isogeny graphs and precise graph isomorphism with a corresponding quaternion $\ell$-ideal graph. In particular, we introduce the notion of double-orientations on supersingular…

Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…

Using only the combinatorics of its defining ribbon graph, we classify the two-term tilting complexes, as well as their indecomposable summands, of a Brauer graph algebra. As an application, we determine precisely the class of Brauer graph…

We study the classification of Lefschetz fibrations up to stabilization by fiber sum operations. We show that for each genus there is a `universal' fibration f^0_g with the property that, if two Lefschetz fibrations over S^2 have the same…

Characteristic class relations in Dolbeault cohomology follow from the existence of a holomorphic Cartan geometry (for example, a holomorphic conformal structure or a holomorphic projective connection). These relations can be calculated…

The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…

Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the underlying graphs of these polyhedra. Double traces are walks…

Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repeatedly adding either pending vertices or twins (i.e.,…

The statistical literature discusses different types of Markov properties for chain graphs that lead to four possible classes of chain graph Markov models. The different models are rather well understood when the observations are continuous…

In this paper we study the variability and rigidity of secondary characteristic classes which arise from flat connections on a manifold. Considering the connection as a Lie-algebra valued one-form, we study the characteristic map from Lie…

We generalise the usual notion of fibred category; first to fibred 2-categories and then to fibred bicategories. Fibred 2-categories correspond to 2-functors from a 2-category into 2-Cat. Fibred bicategories correspond to trihomomorphisms…

The interactions between the components of complex networks are often directed. Proper modeling of such systems frequently requires the construction of ensembles of digraphs with a given sequence of in- and out-degrees. As the number of…

We study the doubled edge-stage lift \[ \HL'_2(G)=L(G\otimes K_2), \] the line graph of the canonical bipartite double cover of a graph \(G\). The natural involution \((u,v)\leftrightarrow(v,u)\) has quotient isomorphic to \(L(G)\), and…

We present an efficient and user-friendly method for constructing any cofibrantly generated model structure on the category of double categories whose trivial fibrations are the "canonical" ones: the double functors which are surjective on…

Despite the remarkable accomplishments of graph neural networks (GNNs), they typically rely on task-specific labels, posing potential challenges in terms of their acquisition. Existing work have been made to address this issue through the…

This is a survey on bi-Lagrangian manifolds, which are symplectic manifolds endowed with two transversal Lagrangian foliations. We also study the non-integrable case (i.e., a symplectic manifold endowed with two transversal Lagrangian…

The purpose of this paper is to develop a homotopical algebra for graphs, relevant to zeta series and spectra of finite graphs. More precisely, we define a Quillen model structure in a category of graphs (directed and possibly infinite,…

In this paper we compare the combinatorial Ricci curvature on cell complexes and the LLY-Ricci curvature defined on graphs. A cell complex is correspondence to a graph such that the vertexes are cells and the edges are vectors on the cell…

Bidirected graphs are a common generalisation of directed graphs where arcs can also be incoming to both their incident nodes, or outgoing from both their incident nodes. Such arcs allow a walk to change direction. Some algorithms can…

In this paper we introduce two general identities relating Eisenstein series on split classical groups, as well as double covers of symplectic groups. The first identity can be viewed as an extension of the doubling construction introduced…