Related papers: Double graph complex and characteristic classes of…

In this paper we analyse the birational geometry of O'Grady ten dimensional manifolds, giving a characterisation of Kaehler classes and lagrangian fibrations. Moreover, we study symplectic compactifications of intermediate jacobian…

This paper is centered on the random graph generated by a Doeblin-type coupling of discrete time processes on a countable state space whereby when two paths meet, they merge. This random graph is studied through a novel subgraph, called a…

In this work, we explore a double categorical framework for categories of enriched graphs, categories and the newly introduced notion of cocategories. A fundamental goal is to establish an enrichment of V-categories in V-cocategories, which…

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if…

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…

In this paper we give an explicit construction of a symplectic Lefschetz fibration whose total space is a smooth compact four dimensional manifold with a prescribed fundamental group. We also study the numerical properties of the sections…

We introduce a new approach to constructing networks with realistic features. Our method, in spite of its conceptual simplicity (it has only two parameters) is capable of generating a wide variety of network types with prescribed…

Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…

We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.

We propose a precise definition of a continuous time dynamical system made up of interacting open subsystems. The interconnections of subsystems are coded by directed graphs. We prove that the appropriate maps of graphs called graph…

We construct a natural chain map from the Kontsevich graph complex to the rational singular chain complex of $B\mathrm{Diff}_\partial(D^{2k})$ when the dimension $2k$ is sufficiently large, generalizing Goussarov and Habiro's theories of…

The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove…

A generalized complex structure is called stable if its defining anticanonical section vanishes transversally, on a codimension-two submanifold. Alternatively, it is a zero elliptic residue symplectic structure in the elliptic tangent…

We establish a duality within the spectral sequence that governs the holomorphic double fibration transform. It has immediate application to the questions of injectivity and range characterization for this transform. We discuss some key…

The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the edges of L(G) are incident edges of G. In this article, we…

Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant…

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

Within the framework of Riehl-Shulman's synthetic $(\infty,1)$-category theory, we present a theory of two-sided cartesian fibrations. Central results are several characterizations of the two-sidedness condition \`{a} la Chevalley, Gray,…

In this paper, we provide a notion of $\infty$-bicategories fibred in $\infty$-bicategories which we call 2-Cartesian fibrations. Our definition is formulated using the language of marked biscaled simplicial sets: Those are scaled…