**Problem of the Week**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

**Math Club**

**Actuarial Association**

You are here: Homepage » Seminars - Academic year 2023-24 » Combinatorics Seminar » Thomas Zaslavsky (Binghamton)

seminars:comb:abstract.200209zas

A *gain graph* is a graph with edges orientably labelled from a group. It is *balanced* if the product of gains (the labels) around any circle is the identity (we call the circle balanced). Under set sum the circles, regarded as edge sets, generate a binary vector space, the *binary cycle space*. For which graphs Gamma is it true that, whenever you have a gain graph based on Gamma such that there exists a basis of the binary cycle space that is composed of balanced circles, then the gain graph is balanced? The answer is intriguing in that it is complicated but exactly solvable and it gives a special role to the group *Z*_{3}.

This is joint work with Konstantin Rybnikov.

seminars/comb/abstract.200209zas.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported