Bay Area Discrete Math Day XII: The Coloring Torus of a...
From Google TechTalks · 1:10:12
Show by Google TechTalks
Google TechTalksBay Area Discrete Math Day XIIApril 15, 2006Dave Bayer (Barnard College, Columbia University)ABSTRACTCircular 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...Uploaded 08-10-07
More episodes of Google TechTalks
More episodes
- DSD: A Hybrid Analysis Tool for Bug Finding
- Chasing the Constants and its Implications in Differential Privacy
- Making Great Decisions
- Streaming Private Continual Counting via Binning
- Distributed Testing with SmartFrog
- Differentially Private Synthetic Data without Training
- A Dynamic Network Layer for Advanced Cloud Computing
- Data Representation/Laplace Operator
- Persistent Pre-Training Poisoning of LLMs
- Threat Models for Memorization: Privacy, Copyright, and Everything In-Between
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.