M. Singhal

activity

20192021

most citedErdos-Littlewood-Offord problem with arbitrary probabilities

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

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2021★ 1 cited

Computations associated with the resonance arrangement

Zachary Chroman, Mihir Singhal

The resonance arrangement $A_{n}$ is the arrangement of hyperplanes in $R^{n}$ given by all hyperplanes of the form $\sum_{i \in I} x_{i} = 0$ , where $I$ is a nonempty…

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.CO2020

Lower bounds for superpatterns and universal sequences

Zachary Chroman, Matthew Kwan, Mihir Singhal

A permutation $σ \in S_{n}$ is said to be $k$ -universal or a $k$ -superpattern if for every $π \in S_{k}$ , there is a subsequence of $σ$ that is order-isomorphic to $π$ . A simple counting…

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…