21 citations · 21 across the 3 of their papers we have counts for
3 papers
math.CO2019
Constructive Method for Finding the Coefficients of a Divided Symmetrization
Nate Ince
We consider a type of divided symmetrization where is a nonincreasing partition on and where is a graph. We discover that in the case where $…
math.CO2012
Computing with voting trees
Jennifer Iglesias, Nathaniel Ince, Po-Shen Loh
The classical paradox of social choice theory asserts that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definit…
math.CO2012★ 21 cited
On the length of a random minimum spanning tree
Colin Cooper, Alan Frieze, Nate Ince +2
We study the expected value of the length of the minimum spanning tree of the complete graph when each edge is given an independent uniform edge weight. We…