| 1:30–1:50 |
Combinatorial and algebraic formulas for volumes of adjacency polytopes Robert Davis |
|
| Adjacency polytopes are lattice polytopes associated to an underlying graph and are constructed in one of two ways. The first results in what are better-known as symmetric edge polytopes, and the second results in the edge polytope of a related bipartite graph. In this talk, we will discuss recent progress in identifying explicit formulas for these polytopes, an overview of the methods used in each case, and several wide-open questions of interest. | ||