M. Singhal

most citedErdos-Littlewood-Offord problem with arbitrary probabilities

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

cs.CC2020

Tetris is NP-hard even with $O (1)$ 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…

math.CO2020

Families with no perfect matchings

Mihir Singhal

We consider families of $k$ -subsets of ${1, \dots, n}$ , where $n$ is a multiple of $k$ , which have no perfect matching. An equivalent condition for a family $F$ to have…

math.CO2020

Unimodality of a refinement of Lassalle's sequence

Mihir Singhal

Defant, Engen, and Miller defined a refinement of Lassalle's sequence $A_{k + 1}$ by considering uniquely sorted permutations of length $2 k + 1$ whose first element is $ℓ$ . They sho…

math.CO2019★ 1 cited

Erdos-Littlewood-Offord problem with arbitrary probabilities

Mihir Singhal

The classical Erdős-Littlewood-Offord problem concerns the random variable $X = a_{1} ξ_{1} + \dots + a_{n} ξ_{n}$ , where $a_{i} \in R ∖ {0}$ are fixed and $ξ_i \sim \text…

Tetris is NP-hard even with O(1) rows or columns

Families with no perfect matchings

Unimodality of a refinement of Lassalle's sequence

Erdos-Littlewood-Offord problem with arbitrary probabilities

Tetris is NP-hard even with $O (1)$ rows or columns