Nitya Mani

I am a PhD student in the Department of Mathematics at MIT. I am excited by problems in extremal graph theory, discrete probability, and convex optimization. I am fortunate to be advised by Pablo Parrilo and Yufei Zhao. I am supported by a Hertz Graduate Fellowship and the NSF Graduate Research Fellowship Program.

Selected publications

See Google Scholar or the arXiv for an updated/more complete listing.

Asymptotic enumeration

• Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences
  with Dan Mikulincer
  [ arXiv ]
  

• Nearly all $k\textsf{-SAT}$ functions are unate
  with József Balogh, Dingding Dong, Bernard Lidicky, Yufei Zhao
  [ arXiv ] [ blog ] [ STOC '23 ]
  
  Enumerating $k\textsf{-SAT}$ functions
  with Dingding Dong, Yufei Zhao
  [ arXiv ] [ blog ] [ SODA '22 ] [ talk ]
  
• On monochromatic solutions to linear equations over the integers
  with Dingding Dong, Huy Tuan Pham, Jonathan Tidor
  [ arXiv ]
  
• On sum-intersecting families of positive integers
  with Aaron Berger
  [ arXiv ] [ European J. Combin. ]
  
• A fourth moment phenomenon for asymptotic normality of monochromatic subgraphs
  with Sayan Das, Zoe Himwich
  [ arXiv ] [ Random Structures Algorithms ]
  
• On the number of error correcting codes
  with Dingding Dong, Yufei Zhao
  [ arXiv ] [ Combin. Probab. Comput. ]
  

Sampling + statistical physics

• Strong spatial mixing for colorings on trees and its algorithmic applications
  with Zongchen Chen, Kuikui Liu, Ankur Moitra
  [ arXiv ] [ FOCS '23 ] [ JACM ] [ talk ]
  

• Counterexamples to a Weitz-style reduction for multispin systems
  with Kuikui Liu, Francisco Pernice
  [ arXiv ]
  

• Multidisperse random sequential adsorption and generalizations
  with Roger Fan
  [ arXiv ]
  

• Fast sampling of satisfying assignments from random $k\textsf{-SAT}$ with applications to connectivity
  with Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, and Ankur Moitra
  [ arXiv ] [ SIAM J. Discrete Math ]
  
  From algorithms to connectivity and back: finding a giant component in random $k\textsf{-SAT}$
  with Zongchen Chen, Ankur Moitra
  [ arXiv ] [ SODA '23 ]
  

• Maximum gaps in one-dimensional hard-core models
  with Dingding Dong
  [ arXiv ] [ Electron. Commun. Probab. ]
  

Probabilistic graph theory

• Clustering in typical unit-distance avoiding sets
  with Alex Cohen
  [ arXiv ]
  
• Variations on Sidorenko's conjecture in tournaments
  with Jacob Fox, Zoe Himwich, Yunkun Zhou
  [ arXiv ] [ J. Graph Theory ]
  
• A note on directed analogues of the Sidorenko and forcing conjectures
  with Jacob Fox, Zoe Himwich, Yunkun Zhou
  [ arXiv ]
  
• Turán problems for mixed graphs
  with Edward Yu
  [ arXiv ] [ J. Combin. Theory Ser. B ]
  
• Extremal results on feedback arc sets in digraphs
  with Jacob Fox, Zoe Himwich
  [ arXiv ] [ Random Structures Algorithms ]
  
• Making an $H$-free graph $k$-colorable
  with Jacob Fox, Zoe Himwich
  [ arXiv ] [ J. Graph Theory ]
  
• Lower bounds on $\textsf{Max-Cut}$ in $H$-free graphs via semidefinite programming
  with Charles Carlson, Alexandra Kolla, Ray Li, Benny Sudakov and Luca Trevisan
  [ arXiv ] [ SIAM J. Discrete Math ] [ LATIN '20 ]
  

Contact

Email: nmani@mit.edu

Accessibility