Candidate extension; not externally reviewed. The manuscript and fourth-moment refinement give simpler proofs of weaker bounds. This note uses the same cited analytic inputs, extracting a sharper error bound. It concerns all row sums collectively, not the fixed-sparse-row-sum conjecture of Resta and Sburlati.
Claim. For some absolute and all sufficiently large primes , the number of distinct permanent values of binary circulants of order satisfies . For every integer with , the row sum contributes at least distinct values, for an absolute .
1. Tune the first Fourier coefficient to bounded error
Use the Bernoulli model and fourth-moment event in the preceding note, with , , and . The three bounds there fail with total probability at most . Also partition the unit circle into twelve fixed half-open sectors of equal width. Each contains of the points . In each sector the expected selected and unselected counts are each at least one sixth its size, since the Bernoulli parameters lie in . By Hoeffding's inequality and a union bound, with probability all sectors have both counts at least one twelfth their size. The estimates are uniform in , so a realization satisfying both events exists.
Repair the cardinality to by edits. The first Fourier coefficient is now within of . Let be minus this coefficient. If , add an unselected root from the sector containing the direction of , and remove a selected root from its antipodal sector. The Fourier increment has length at most two and projection at least on the direction of . Hence Thus at most swaps reduce the remaining error to less than four. There are always candidates: each sector started with roots of each type, and the cardinality repair and all swaps together change at most membership choices. This argument preserves .
Divide the Fourier coefficients by to obtain the eigenvalues of . The resulting profile satisfies The bulk estimate follows just as in the preceding note: the original unnormalized fourth sum is , all edits contribute to each coefficient, and . In particular the maximum bulk modulus is . Thus obeys the same uniform entry and operator bounds as before. Exact Parseval and the log determinant formula from the preceding note give
2. Sharpen the quantitative permanent estimate
Use the inputs in Appendix A of the manuscript, extracted from Divoux–Wang, Section 3: for , , their rook polynomial differs from by uniformly on . If and , the normalized permanent equals . The absolute contribution of outside is exponentially small by the cited proof. Also for a constant and all large , by exponential moment bounds for Gamma variables.
The new step is to use the centered first-order term rather than bound its absolute value. On the functions are uniformly bounded: differentiate , where the singular values satisfy and . The denominators are uniformly bounded away from zero and the sums are bounded by constants times . Taylor's formula gives The exact moments are and . The first moment omitted by restricting to has modulus at most by Cauchy–Schwarz. The omitted constant term is also exponentially small; the Taylor remainder contributes . It follows that uniformly. As , taking logarithms retains this error order.
3. Count
For every in the specified ranges a suitable support therefore has log normalized permanent , uniformly. On the compact rectangle of parameters, . Let bound the error by . Take an amplitude grid from in steps of up to , with fixed . Adjacent values of the target function differ by at least , so all corresponding permanents for a fixed are distinct. This gives values for each of distinct row sums. The classical congruence ensures that values for different row sums are disjoint, proving the proposed bound.
Related literature
Kocharovsky, Kocharovsky and Tarasov (2020), §7.2 also use a determinantal approximation and Fourier diagonalization for positive weighted circulants. That calculation does not count distinct permanent values of binary circulants. The literature search distinguishes the all-row-sums question from earlier fixed-degree work. Follow-up searches for a quadratic lower bound across all row sums did not locate a prior proof; this is not a priority certification.