2000 character limit reached
Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon (1802.07164v1)
Published 20 Feb 2018 in math.CO and cs.DM
Abstract: The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to graphs whose vertices have degree one or three. In this paper, we prove the scissors congruence conjecture, posed by Haase and McAllister, for this class of polytopes. The key ingredient in the proofs is the nearest neighbor interchange on graphs and a naturally arising piecewise unimodular transformation.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.