Related papers: The oriented graph complexes
Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…
Let $\mathcal{OG}(4)$ denote the family of all graph-group pairs $(\Gamma, G)$ where $\Gamma$ is finite, 4-valent, connected, and $G$-oriented ($G$-half-arc-transitive). A subfamily of $\mathcal{OG}(4)$ has recently been identified as…
We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
Kontsevich has proven that the Lie homology of the Lie algebra of symplectic vector fields can be computed in terms of the homology of a graph complex. We prove that the Leibniz homology of this Lie algebra can be computed in terms of the…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
We consider finite-dimensional complex Lie algebras. Using certain complex parameters we generalize the concept of cohomology cocycles of Lie algebras. A special case is generalization of 1-cocycles with respect to the adjoint…
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…
Given a set $F$ of oriented graphs, a graph $G$ is an $F$-graph if it admits an $F$-free orientation. Building on previous work by Bang-Jensen and Urrutia, we propose a master algorithm that determines if a graph admits an $F$-free…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…
We prove that an isomorphism of graded Grothendieck groups $K^{gr}_0$ of two Leavitt path algebras induces an isomorphism of a certain quotient of algebraic filtered $K$-theory and consequently an isomorphism of filtered $K$-theory of their…
A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…
We use the definition of a simplicial cycle to define an odd-cycle-free facet complex (hypergraph). These are facet complexes that do not contain any cycles of odd length. We show that besides one class of such facet complexes, all of them…
We use chain level genus zero Gromov-Witten theory to associate to any closed monotone symplectic manifold a formal group (loosely interpreted), whose Lie algebra is the odd degree cohomology of the manifold (with vanishing bracket). When…
The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…
We study Lie-Rinehart algebra structures in the framework provided by a duality pairing of modules over a unital commutative associative algebra. Thus, we construct examples of Lie brackets corresponding to a fixed anchor map whose image is…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…