T. Mishra

activity

20162026

most citedStatistical Machine Translation for Indic Languages

11 citations · 12 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Erdős Matching (Conjecture) Theorem

Tapas Kumar Mishra

Let $F$ be a family of $k$ -sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erdős Matching Conjecture, a celebrated and long-standing open…

math.CO2016

Induced bisecting families for hypergraphs

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra +1

Two $n$ -dimensional vectors $A$ and $B$ , $A, B \in R^{n}$ , are said to be \emph{trivially orthogonal} if in every coordinate $i \in [n]$ , at least one of $A (i)$ or $B (i)$ is…

math.CO2016

Bisecting and D-secting families for set systems

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra +1

Let $n$ be any positive integer and $F$ be a family of subsets of $[n]$ . A family $F^{'}$ is said to be $D$ -\emph{secting} for $F$ if for every $A \in \m…