2 citations · 2 across the 13 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
The Turán Polytope
Annie Raymond
The Turán hypergraph problem asks to find the maximum number of -edges in a -uniform hypergraph on vertices that does not contain a clique of size . When , i.e.,…
math.PR2016
The bullet problem with discrete speeds
Brittany Dygert, Christoph Kinzel, Jennifer Zhu +3
Bullets are fired, one per second, with independent speeds sampled uniformly from a discrete set. Collisions result in mutual annihilation. We show that the second fastest bullet s…
math.CO2016
Symmetric Sums of Squares over -Subset Hypercubes
Annie Raymond, James Saunderson, Mohit Singh +1
We consider the problem of finding sum of squares (sos) expressions to establish the non-negativity of a symmetric polynomial over a discrete hypercube whose coordinates are indexe…