Bay Area Discrete Math Day XII: The Coloring Torus of a...
2,580 views · Published 9 October 2007 · 1:03:28 · Indexed 15 October 2026
Channel: Google TechTalks · 2007 · Howto & Style
Google TechTalks Bay Area Discrete Math Day XII April 15, 2006 Dave Bayer (Barnard College, Columbia University) ABSTRACT Circular colorability geometrizes the study of graph colorings. Using color values in R mod Z, one can reformulate "avoid edge differences close to zero" as " seek edge differences close to 1/2", then generalize to arbitrary edge difference goals. We define the coloring torus Xg of a graph G to be the space of all such coloring problems. X is made of the same stuff as the color values R mod Z: it is R mod L for a lattice L, so we can apply toric methods to its study. For planar graphs, the observed distances from 0 to torsion points of Xg form a pattern generalizing the four...
More from this channel
-
34:17
Thinglink - A Free Product Code for Creative Work
-
32:48
Thinking Beyond Borders
-
44:29
Understanding Urban Environments Through the Use of...
-
46:04
Customizable Scalable Compute Intensive Stream Queries
-
51:26
All The Government's Information
-
41:35
Combining Discriminative Features to Infer Complex...
-
59:42
Dimensions of Reputation in Electronic Markets
-
46:50
Accessing Legacy Documents in the iPod Age