Related papers: The oriented graph complex revisited
For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…
This paper develops new aspects of the interplay between shifted symplectic geometry and classical Poisson geometry, focusing on lagrangian morphisms into 2-shifted symplectic groups. We establish a Lie-type correspondence between such…
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…
We study Lie algebras of generators of infinitesimal symmetries of almost-cosymplectic-contact structures of odd dimensional manifolds. The almost-cosymplectic-contact structure admits on the sheaf of pairs of 1-forms and functions the…
We relate graph complexes, Calabi-Yau $A_\infty$-categories and Kontsevich's cocycle construction. Our main result produces a commutative square of shifted Poisson algebras; one of its edges is the Loday-Quillen-Tsygan map, generalized to…
We provide a unified geometric realization of the classical deformation complexes. We construct GL-equivariant bilinear incidence varieties whose diagonal slices recover the varieties of associative, commutative, Leibniz, and Lie algebra…
Recently, it has been shown that a connected graph $\Gamma$ with $d+1$ distinct eigenvalues and odd-girth $2d+1$ is distance-regular. The proof of this result was based on the spectral excess theorem. In this note we present an alternative…
The graph groupoids of directed graphs are topologically isomorphic if and only if there is a diagonal-preserving ring *-isomorphism between the Leavitt path algebras.
Erd{\H o}s (1963) initiated extensive graph discrepancy research on 2-edge-colored graphs. Gishboliner, Krivelevich, and Michaeli (2023) launched similar research on oriented graphs. They conjectured the following extension of Dirac's…
We obtain a Lie theoretic intrinsic characterization of the connected and simply connected solvable Lie groups whose regular representation is a factor representation. When this is the case, the corresponding von Neumann algebras are…
We give an infinite class of counterexamples to the Gotsman-Linial conjecture when d = 2. On the other hand, we establish an asymptotic form of the conjecture for quadratic threshold functions whose non-zero quadratic terms define a graph…
In this paper, we study orthogonal representations of simple graphs $G$ in $\mathbb{R}^d$ from an algebraic perspective in case $d = 2$. Orthogonal representations of graphs, introduced by Lov\'asz, are maps from the vertex set to…
We prove that every proper connective DG-algebra $A$ admits a geometric realization (as defined by Orlov) by a smooth projective scheme with a full exceptional collection. As a corollary we obtain that $A$ is quasi-isomorphic to a finite…
We show that the coefficients of the re-normalized link invariants of the paper "Multivariable link invariants arising from Lie superalgebras of type I" are Vassiliev invariants which give rise to a canonical family of weight systems.
This paper presents "oriented pivoting systems" as an abstract framework for complementary pivoting. It gives a unified simple proof that the endpoints of complementary pivoting paths have opposite sign. A special case are the Nash…
We show that the problem of deciding whether a given graph $G$ has a well-balanced orientation $\vec{G}$ such that $d_{\vec{G}}^+(v)\leq \ell(v)$ for all $v \in V(G)$ for a given function $\ell:V(G)\rightarrow \mathbb{Z}_{\geq 0}$ is…
A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f-2 of which are of degree d and the remaining two are of degrees m_1;m_2, both different from d. Such a graph is called balanced if m_1=m_2. We show that all…
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least $2k$ vertices is {\it $k$-linked} if, for every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of vertices, there…
Graph convolutional neural networks (GCN) have been the model of choice for graph representation learning, which is mainly due to the effective design of graph convolution that computes the representation of a node by aggregating those of…
We prove a relative version of Kontsevich's formality theorem. This theorem involves a manifold M and a submanifold C and reduces to Kontsevich's theorem if C=M. It states that the DGLA of multivector fields on an infinitesimal…