2 citations · 4 across the 5 of their papers we have counts for
7 papers
Low-Degree Multicalibration
Parikshit Gopalan, Michael P. Kim, Mihir Singhal +1
Introduced as a notion of algorithmic fairness, multicalibration has proved to be a powerful and versatile concept with implications far beyond its original intent. This stringent…
Computations associated with the resonance arrangement
Zachary Chroman, Mihir Singhal
The resonance arrangement is the arrangement of hyperplanes in given by all hyperplanes of the form , where is a nonempty…
Tetris is NP-hard even with rows or columns
Sualeh Asif, Michael Coulombe, Erik D. Demaine +4
We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open prob…
Families with no perfect matchings
Mihir Singhal
We consider families of -subsets of , where is a multiple of , which have no perfect matching. An equivalent condition for a family to have…
Unimodality of a refinement of Lassalle's sequence
Mihir Singhal
Defant, Engen, and Miller defined a refinement of Lassalle's sequence by considering uniquely sorted permutations of length whose first element is . They sho…
Lower bounds for superpatterns and universal sequences
Zachary Chroman, Matthew Kwan, Mihir Singhal
A permutation is said to be -universal or a -superpattern if for every , there is a subsequence of that is order-isomorphic to . A simple counting…