54 citations · 164 across the 28 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.PR2017★ 1 cited
Cutoff for biased transpositions
Megan Bernstein, Nayantara Bhatnagar, Igor Pak
In this paper we study the mixing time of a biased transpositions shuffle on a set of cards with cards of two types. For a parameter , one type of card is chos…
math.CO2017★ 1 cited
Short Presburger arithmetic is hard
Danny Nguyen, Igor Pak
We study the computational complexity of short sentences in Presburger arithmetic (Short-PA). Here by "short" we mean sentences with a bounded number of variables, quantifiers, ine…