Papers
Topics
Authors
Recent
Search
2000 character limit reached

Eulerian digraphs and toric Calabi-Yau varieties

Published 12 Nov 2010 in hep-th | (1011.2963v1)

Abstract: We investigate the structure of a simple class of affine toric Calabi-Yau varieties that are defined from quiver representations based on finite eulerian directed graphs (digraphs). The vanishing first Chern class of these varieties just follows from the characterisation of eulerian digraphs as being connected with all vertices balanced. Some structure theory is used to show how any eulerian digraph can be generated by iterating combinations of just a few canonical graph-theoretic moves. We describe the effect of each of these moves on the lattice polytopes which encode the toric Calabi-Yau varieties and illustrate the construction in several examples. We comment on physical applications of the construction in the context of moduli spaces for superconformal gauged linear sigma models.

Authors (1)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.