arXiv:2509. 15822v3 Announce Type: replace-cross Abstract: Predictions from statistical physics postulate that recovery of the communities in the Stochastic Block Model (SBM) with a fixed number $K$ of communities is possible in polynomial time above, and only above, the Kesten-Stigum (KS) threshold.
arXiv:2607. 21517v1 Announce Type: cross Abstract: The Shannon capacity $\Theta(G)$ of a graph $G$ quantifies the maximum rate at which information can be transmitted with zero error over a noisy channel.
arXiv:2608. 11211v1 Announce Type: new Abstract: Conway's 99-graph problem asks whether a strongly regular graph with parameters $\mathrm{srg}(99,14,1,2)$ exists.
arXiv:2607. 23500v1 Announce Type: cross Abstract: Razborov's flag algebra method is a powerful tool for proving asymptotic inequalities in extremal graph theory, often reducing the task to finding a finite certificate by semidefinite programming.
arXiv:2609.16412v1 Announce Type: cross Abstract: Whitney's theorem allows isomorphism testing for connected simple graphs, apart from $K_3$ and $K_{1,3}$, to be formulated as distinguishing their li...
arXiv:2609.10487v2 Announce Type: replace Abstract: We construct counterexamples to Rockafellar's sum conjecture in which two maximally monotone operators satisfy the interior-domain condition but th...
arXiv:2607. 17469v1 Announce Type: cross Abstract: A randomized algorithm may terminate almost surely even though exceptional random tapes make it run forever.
arXiv:2608. 14369v1 Announce Type: cross Abstract: We consider the notion of shattering introduced by Ben Arous and Jagannath for spherical pure $p$-spin glasses with overlap $q$.
arXiv:2608.30869v1 Announce Type: cross Abstract: Let $r\geq3$ be fixed, and let $\mathbf{G}_n$ be the set of all simple graphs with vertex set $[n]=\{1,\ldots,n\}$. We consider an exponential random...
arXiv:2608. 15558v1 Announce Type: cross Abstract: For $m\geq 2$, let $c_p(m)$ be the all-dimensional best constant in $$ \left\|\sum_{k=1}^m A_k\right\|_p \leq c_p(m)\left\|\sum_{k=1}^m |A_k|\right\|_p.
arXiv:2609. 17926v1 Announce Type: new Abstract: The standard geometric derivation of neural scaling exponents takes the intrinsic dimension of a data manifold as its input.
We construct counterexamples to Rockafellar's sum conjecture in which two maximally monotone operators satisfy the interior-domain condition but their sum is not maximally monotone. We give one counte...