Nitya Mani

activity

20152024

most citedA fourth moment phenomenon for asymptotic normality of monochromatic subgraphs

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

collaborators

21 papers

math.CO2024★ 1 cited

Variations on Sidorenko's conjecture in tournaments

Jacob Fox, Zoe Himwich, Nitya Mani +1

We study variants of Sidorenko's conjecture in tournaments, where new phenomena arise that do not have clear analogues in the setting of undirected graphs. We first consider orient…

math.CO2023

On sum-intersecting families of positive integers

Aaron Berger, Nitya Mani

We study the following natural arithmetic question regarding intersecting families: how large can a family of subsets of integers from ${1, \dots n}$ be such that, for every pai…

cs.DS2023

Strong spatial mixing for colorings on trees and its algorithmic applications

Zongchen Chen, Kuikui Liu, Nitya Mani +1

Strong spatial mixing (SSM) is an important quantitative notion of correlation decay for Gibbs distributions arising in statistical physics, probability theory, and theoretical com…

math.CO2023

When will (game) wars end?

Manan Bhatia, Byron Chin, Nitya Mani +1

We study several variants of the classical card game war. As anyone who played this game knows, the game can take some time to terminate, but it usually does. Here, we analyze a nu…

math.CO2022

A note on directed analogues of the Sidorenko and forcing conjectures

Jacob Fox, Zoe Himwich, Nitya Mani +1

We study analogues of Sidorenko's conjecture and the forcing conjecture in oriented graphs, showing that natural variants of these conjectures in directed graphs are equivalent to…

math.PR2022

Maximum gaps in one-dimensional hard-core models

Dingding Dong, Nitya Mani

We study the distribution of the maximum gap size in one-dimensional hard-core models. First, we randomly sequentially pack rods of length $2$ onto an interval of length $L$ , subje…

math.CO2022

Nearly all $k$ -SAT functions are unate

József Balogh, Dingding Dong, Bernard Lidický +2

We prove that $1 - o (1)$ fraction of all $k$ -SAT functions on $n$ Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer $k$ …

cs.DS2022

From algorithms to connectivity and back: finding a giant component in random k-SAT

Zongchen Chen, Nitya Mani, Ankur Moitra

We take an algorithmic approach to studying the solution space geometry of relatively sparse random and bounded degree $k$ -CNFs for large $k$ . In the course of doing so, we establi…

math.CO2022

On the number of error correcting codes

Dingding Dong, Nitya Mani, Yufei Zhao

We show that for a fixed $q$ , the number of $q$ -ary $t$ -error correcting codes of length $n$ is at most $2^{(1 + o (1)) H_{q} (n, t)}$ for all $t \leq (1 - q^{-1})n - C_q\sqrt{n \log n}…

math.PR2022★ 3 cited

A fourth moment phenomenon for asymptotic normality of monochromatic subgraphs

Sayan Das, Zoe Himwich, Nitya Mani

Given a graph sequence ${G_{n}}_{n \geq 1}$ and a simple connected subgraph $H$ , we denote by $T (H, G_{n})$ the number of monochromatic copies of $H$ in a uniformly random vertex colorin…

math.CO2022

Extremal results on feedback arc sets in digraphs

Jacob Fox, Zoe Himwich, Nitya Mani

A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph $G$ , let $β (G)$ denote the size of a minimum feedback…

cs.LG2021

An Interpretable Approach to Hateful Meme Detection

Tanvi Deshpande, Nitya Mani

Hateful memes are an emerging method of spreading hate on the internet, relying on both images and text to convey a hateful message. We take an interpretable approach to hateful me…

math.CO2021★ 1 cited

Enumerating k-SAT functions

Dingding Dong, Nitya Mani, Yufei Zhao

How many $k$ -SAT functions on $n$ boolean variables are there? What does a typical such function look like? Bollobás, Brightwell, and Leader conjectured that, for each fixed $k \ge…

math.CO2021★ 1 cited

Making an $H$ -Free Graph $k$ -Colorable

Jacob Fox, Zoe Himwich, Nitya Mani

We study the following question: how few edges can we delete from any $H$ -free graph on $n$ vertices in order to make the resulting graph $k$ -colorable? It turns out that various c…

math.CO2019

Max-Cut in Degenerate $H$ -Free Graphs

Ray Li, Nitya Mani

We obtain several lower bounds on the $Max-Cut$ of $d$ -degenerate $H$ -free graphs. Let $f (m, d, H)$ denote the smallest $Max-Cut$ of an $H$ -free $d$ -degenerate grap…

math.NT2019

Diophantine Tuples over $Z_{p}$

Nitya Mani, Simon Rubinstein-Salzedo

For an element $r$ of a ring $R$ , a Diophantine $D (r)$ $m$ -tuple is an $m$ -tuple $(a_{1}, a_{2}, \dots, a_{m})$ of elements of $R$ such that for all $i, j$ with $i \neq = j$ , $a_{i} a_{j} + r$ is a p…

cs.DS2018

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming

Charles Carlson, Alexandra Kolla, Ray Li +3

For a graph $G$ , let $f (G)$ denote the size of the maximum cut in $G$ . The problem of estimating $f (G)$ as a function of the number of vertices and edges of $G$ has a long history…

math.CO2018

$P$ Play in Candy Nim

Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo +1

Candy Nim is a variant of Nim in which both players aim to take the last candy in a game of Nim, with the added simultaneous secondary goal of taking as many candies as possible. W…

math.NT2016

Shifted Convolution $L$ -Series Values for Elliptic Curves

Asra Ali, Nitya Mani

Using explicit constructions of the Weierstrass mock modular form, we offer a closed formula for generating the values of shifted convolution $L$ -values for certain elliptic curves…

math.NT2016

Infinite Product Exponents for Modular Forms

Asra Ali, Nitya Mani

Recently, D. Choi obtained a description of the coefficients of the infinite product expansions of meromorphic modular forms over $Γ_{0} (N)$ . Using this result, we provide some bound…

math.NT2015

$N$ -Division Points of Hypocycloids

Nitya Mani, Simon Rubinstein-Salzedo

We show that the $n$ -division points of all rational hypocycloids are constructible with an unmarked straightedge and compass for all integers $n$ , given a pre-drawn hypocycloid. W…

Variations on Sidorenko's conjecture in tournaments

On sum-intersecting families of positive integers

Strong spatial mixing for colorings on trees and its algorithmic applications

When will (game) wars end?

A note on directed analogues of the Sidorenko and forcing conjectures

Maximum gaps in one-dimensional hard-core models

Nearly all k-SAT functions are unate

From algorithms to connectivity and back: finding a giant component in random k-SAT

On the number of error correcting codes

A fourth moment phenomenon for asymptotic normality of monochromatic subgraphs

Extremal results on feedback arc sets in digraphs

An Interpretable Approach to Hateful Meme Detection

Enumerating k-SAT functions

Making an H-Free Graph k-Colorable

Max-Cut in Degenerate H-Free Graphs

Diophantine Tuples over Zp​

Lower bounds for Max-Cut in H-free graphs via semidefinite programming

P Play in Candy Nim

Shifted Convolution L-Series Values for Elliptic Curves

Infinite Product Exponents for Modular Forms

N-Division Points of Hypocycloids

Nearly all $k$ -SAT functions are unate

Making an $H$ -Free Graph $k$ -Colorable

Max-Cut in Degenerate $H$ -Free Graphs

Diophantine Tuples over $Z_{p}$

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming

$P$ Play in Candy Nim

Shifted Convolution $L$ -Series Values for Elliptic Curves

$N$ -Division Points of Hypocycloids