8 citations · 14 across the 5 of their papers we have counts for
5 papers
Candy-passing Games on General Graphs, II
Paul M. Kominers, Scott D. Kominers
We give a new proof that any candy-passing game on a graph G with at least 4|E(G)|-|V(G)| candies stabilizes. (This result was first proven in arXiv:0807.4450.) Unlike the prior li…
Candy-passing Games on General Graphs, I
Paul M. Kominers, Scott D. Kominers
We undertake the first study of the candy-passing game on arbitrary connected graphs. We obtain a general stabilization result which encompasses the first author's results (arXiv:0…
The 8-universality Criterion is Unique
Scott D. Kominers
Using the methods developed for the proof that the 2-universality criterion is unique, we partially characterize criteria for the n-universality of positive-definite integer-matrix…
Walk versus Wait: The Lazy Mathematician Wins
Justin G. Chen, Scott D. Kominers, Robert W. Sinnott
In this recreational mathematics note, we address a simple, yet instructive question: Justin has to travel a distance of d miles along a bus route. Along this route, there are n bu…
Hinged Dissections Exist
Timothy G. Abbott, Zachary Abel, David Charlton +3
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged a…