Computing All Lattice-Rectangle Counts by Rational Staircase Sums
TL;DR
The algorithm applies a square-root cover before coefficient extraction and evaluates the resulting rational wedge and triangular sums by a local-denominator divide-and-conquer recursion.
Abstract
Let $F(n)$ be the number of rectangles, not necessarily axis-parallel, whose vertices belong to the $n\times n$ square grid of lattice points. We compute the complete table $F(1),\ldots,F(N)$ exactly in $O(M(N)\log N)$ coefficient-ring operations and $O(N\log N)$ ring elements of working memory, where $M(N)$ is a regular bound for multiplying degree-$N$ polynomials. The ring-level statement assumes that $6$ is invertible; over $\mathbb Z$ the only division is instead performed exactly in the elementary boundary term. With quasi-linear polynomial multiplication the arithmetic bound is $O(N\log^2 N)$. The algorithm applies a square-root cover before coefficient extraction and evaluates the resulting rational wedge and triangular sums by a local-denominator divide-and-conquer recursion. Primitive directions are recovered coefficientwise by M\"obius inversion, followed by five prefix sums. A modular number-theoretic-transform (NTT) implementation with certified Chinese-remainder (CRT) recovery is evaluated experimentally against the $O(N^{3/2})$ all-values algorithm.