Asaf Cohen Antonir

activity

20212026

collaborators

4 papers

math.CO2026

A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs

Asaf Cohen Antonir, Ilay Hoshen, Maksim Zhukovskii

Let $X_{H}$ denote the number of copies of a fixed graph $H$ in $G_{n, p}$ . Gilmer and Kopparty conjectured that $X_{H}$ satisfies a local central limit theorem (LCLT) provided that $H…

math.CO2026

Universality in random graphs via optimal linking systems: trees and beyond

Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii

We develop a framework for proving universality results in sparse random graphs. As a first application, we show that there exists an absolute constant $C > 1$ such that, with high p…

math.NT2022

An Elementary Proof of a Theorem of Hardy and Ramanujan

Asaf Cohen Antonir, Asaf Shapira

Let $Q (n)$ denote the number of integers $1 \leq q \leq n$ whose prime factorization $q = \prod_{i = 1}^{t} p_{i}^{a_{i}}$ satisfies $a_{1} \geq a_{2} \geq \dots \geq a_{t}$ . Hardy and Ramanujan…

math.NT2021

On Erdős's Method for Bounding the Partition Function

Asaf Cohen Antonir, Asaf Shapira

For fixed $m$ and $R \subseteq {0, 1, \dots, m - 1}$ , take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$ , and let $p_{A} (n)$ be the number of…