聚合搜Scholar - 壹搜网为您找到"
Type Construction and Cycle Detection
"相关结果 20条www.techniques-ingenieur.fr We give an explicit construction of Lie algebras of type $E_7$ out of a Lie algebra of type $D_6$ with some restrictions. Up to odd degree extensions, every Lie algebra of type $E_7$ arises this way. For Lie algebras that admit a $56$-dimensional representation we provide a more symmetric construction based on an observation of Manivel; the input is seven quaternion algebras subject to some relations.
arxiv.orgGiven a bridgeless graph G, the well-known cycle double cover conjecture posits that there is a list of cycles of G, such that every edge appears in exactly two cycles. In this paper, we prove the cycle double cover conjecture. More precisely, we prove the Goddyn's conjecture as a stronger version of the cycle double cover conjecture which states that every cycle in G is a member of some cycle double cover of G.
arxiv.orgWe determine the cycle packing number of a directed graph using elementary projective algebraic geometry. Our idea is rooted in the Khovanov-Rozansky theory. In fact, using the Khovanov-Rozansky homology of a graph, we also obtain algebraic methods of detecting directed and undirected cycles containing a particular vertex or edge.
arxiv.org