The following pages link to Nitya Mani (Q726605):
Displaying 24 items.
- \(N\)-division points of hypocycloids (Q726606) (← links)
- Shifted convolution \(L\)-series values for elliptic curves (Q1702162) (← links)
- Lower bounds for max-cut via semidefinite programming (Q2081648) (← links)
- Infinite product exponents for modular forms (Q2520544) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- Diophantine tuples over $\mathbb {Z}_p$ (Q5854718) (← links)
- A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs (Q6063347) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
- Maximum gaps in one-dimensional hard-core models (Q6177613) (← links)
- Turán problems for mixed graphs (Q6500101) (← links)
- When will (game) wars end? (Q6508727) (← links)
- Strong spatial mixing for colorings on trees and its algorithmic applications (Q6509511) (← links)
- Variations on Sidorenko's conjecture in tournaments (Q6521596) (← links)
- Multidisperse Random Sequential Adsorption and Generalizations (Q6526978) (← links)
- Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences (Q6526982) (← links)
- From algorithms to connectivity and back: finding a giant component in random \(k\)-SAT (Q6538662) (← links)
- On sum-intersecting families of positive integers (Q6568838) (← links)
- Enumerating \(k\)-SAT functions (Q6575159) (← links)
- On the number of error correcting codes (Q6632779) (← links)
- Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity (Q6633135) (← links)
- Clustering in typical unit-distance avoiding sets (Q6735456) (← links)
- On monochromatic solutions to linear equations over the integers (Q6749330) (← links)
- Counterexamples to a Weitz-Style Reduction for Multispin Systems (Q6752824) (← links)
