Fabian Arevalo

Lattice paths · enumerative combinatorics

The antidiagonal anomaly stops at 495, and never comes back

A proof of Conjecture 7.4 of Gil, Liang, Odetola and Weiner: analytic for n ≥ 3000, exact integer arithmetic for 496 ≤ n ≤ 2999. Plus the limit of the ratio, and an explanation of the paper's "irregular" pattern.
September 4, 2026 · session of the Matematica research log · code, certificate and note in conjectures/antidiagonal-anomaly/

Start here — no maths required

Draw a square grid, n steps wide and n steps tall. A traveller starts at the bottom-left corner and walks to the top-right, always going one step east or one step north, never back. There are a great many such routes. Now put a roadblock on one crossing, and ask a simple question: which crossing near the start carries the most surviving routes?

The natural answer is the crossing one step east and one step north, the point (1,1), because it sits on the fat middle of the traffic. And usually it wins. But Gil, Liang, Odetola and Weiner noticed something strange. If you put the roadblock on the anti-diagonal, the line running from the top-left corner to the bottom-right one, then for small and medium boards the winner flips: the point (1,0), sitting flat on the bottom edge, beats it.

They checked every board size up to 495. The flip happens for every size from 8 up to 375. Then it starts to flicker: some sizes yes, some sizes no, in a pattern they described as irregular, until it stops at 375…495. They conjectured it never happens again, for any board size at all. That is what this note proves, and the figure below is the moment it dies.

Show
The last hundred and thirty board sizes where the anomaly is alive. Each dot is one board size n, plotted at the exact value of the ratio ρ(n) that decides the question: above the line, the edge point wins and the board is anomalous; below it, the ordinary point wins. The dots are measurements, exact integer arithmetic rounded down at the ninth decimal. The dashed curve is the model, the smooth envelope c0(1 + 1/√(2n)) derived in section 5, which is what the ratio would be if the best roadblock position were allowed to be a fraction. It crosses 1 near n = 454. The dots straddle it because a roadblock has to sit on an actual crossing, and the gap between the two is the whole story of the flickering.

What this note adds

The paper is five days old at the time of writing. It states the conjecture, verifies it by computer to n = 495, and asks three questions about it. Here is what came out of one session.

  1. The conjecture is true, and with strict inequality. The anomaly never reappears for any n ≥ 496. The proof splits: a Stirling-type bound handles every n ≥ 3000 at once, and exact integer arithmetic settles the 2504 remaining sizes in twelve seconds, with the certificate committed.
  2. The criterion is a statement about Catalan numbers. The paper's ratio is above 1 exactly when a(n−2a+1)·C(n,a)² > (n−1)·C(2n−2,n−1): the traffic the roadblock destroys exceeds the (n−1)-th Catalan number. That answers their first question.
  3. The ratio has a limit, c0 = √(8/π)·e−1/2 = 0.967882…, approached as c0(1 + 1/√(2n) + O(1/n)). Because that envelope crosses 1 near n = 454 and the true threshold is 495, the last forty sizes are decided by rounding alone. The margin is genuinely thin: ρ(495) = 1.000024 and ρ(497) = 0.999955.
  4. The "irregular" pattern is not irregular. The best roadblock position wants to sit at n/2 − (√(2n+1)−1)/4, which is almost never an integer. The anomaly survives exactly where that number rounds well. Since n/2 is a whole number for even n and a half for odd n, the even and the odd sizes take turns being lucky, which is why the anomalous list runs through the even numbers to 462 and then the odd numbers to 495.
  5. The exact anomalous set below 496 is now on the record: all 373 sizes 3 ≤ n ≤ 375, plus 82 sporadic ones, 455 in all. The paper printed only "intermittently up to 495".

Everything below is the technical version. If you read only one more thing, make it figure 2: it is the rounding mechanism, and it is the reason the pattern looked irregular.

AbstractSummary of results

Gil, Liang, Odetola and Weiner [GLOW] (arXiv:2609.01562, 1 September 2026) count monotone lattice paths from (0,0) to (n,n) that avoid a forbidden point B, and ask which point A carries the most B-avoiding traffic. They prove that for n ≥ 9 the maximum is attained at one of ten near-corner points whatever B is; they observe that an obstruction B = (a, n−a) on the antidiagonal moves the maximum from (1,1) to the boundary point (1,0) for every 8 ≤ n ≤ 375 and sporadically up to n = 495; and they conjecture (Conjecture 7.4) that this anomaly never reappears for n ≥ 496.

We prove the conjecture, in strict form. Their criterion is the integer inequality a(n−2a+1)·C(n,a)² > (n−1)·C(2n−2,n−1) (Lemma 1). A Robbins–Stirling bound shows that ρ(n) = maxa Rn(a) is below 0.9939 for every n ≥ 3000 (Theorem A), and exact integer arithmetic settles 496 ≤ n ≤ 2999 (Theorem A′, certificate shipped). We also prove ρ(n) → c0 = √(8/π)e−1/2 = 0.96788…, more precisely ρ(n) = c0(1 + 1/√(2n) + O(1/n)) (Theorem B), which places the transition at n ≈ 454; and we show that Rn(a) is log-concave in a with real maximiser n/2 − x*(n), x*(n) = (√(2n+1)−1)/4, so that the sporadic pattern on 376 ≤ n ≤ 495 is the rounding of that number to an integer, alternating with the parity of n (Proposition C). This answers questions (1) and (2) of [GLOW, §7].

ResultLabelScope
Conjecture 7.4: ρ(n) < 1 for all n ≥ 496ProvedAnalytic for n ≥ 3000; exact finite case analysis for 496…2999
Criterion = Catalan inequality (Lemma 1)ProvedAll n ≥ 3
ρ(n) < U(n) ≤ 0.9939 (Theorem A)Provedn ≥ 3000; final numeric step in exact rationals
ρ(n) < 1 on 496 ≤ n ≤ 2999 (Theorem A′)CertifiedExact integers, 12 s, certificate committed
ρ(n) = c0(1 + 1/√(2n) + O(1/n)) (Theorem B)ProvedO(1/n) not made explicit
Log-concavity of Rn(·) (Proposition C(a))ProvedAll n ≥ 3
Maximiser within 1 of n/2 − x*(n)Certified3 ≤ n ≤ 3000 only
The 455 anomalous n below 496, listed exactlyCertifiedExact integers
Rounding-penalty explanation of the patternNumericalModel, not a theorem
Control: [GLOW, Prop. 7.2] re-derived from the definitionCertified9 ≤ n ≤ 120, 0 mismatches

Section 1The setting, from the paper

Let 𝓟n be the monotone lattice paths from (0,0) to (n,n). For grid points A, B let fB(A) be the number of paths through A avoiding B. With A = (a1,b1), B = (c,d) and A south-west of B,

fB(A) = C(a1+b1, a1)·[ C(2n−a1−b1, n−a1) − C(c+d−a1−b1, c−a1)·C(2n−c−d, n−c) ]

[GLOW] prove (Theorems 3.6, 4.4, 5.1) that for n ≥ 9 and every B, the maximum of fB is attained at one of the ten points (1,0), (0,1), (1,1), (2,1), (1,2) and their images under (x,y) ↦ (n−x, n−y). For B = (a, n−a) on the antidiagonal with 2a < n they show (their Proposition 7.2) that fB(1,0) > fB(1,1) exactly when Rn(a) > 1, where

Rn(a) = G(n,a)/D(n),   G(n,a) = ((n−2a+1)/(n−a))·C(n,a)·C(n−2,a−1),   D(n) = C(2n−2,n−1)/n,
and ρ(n) = max1 ≤ a < n/2 Rn(a). The anomaly at n is the event ρ(n) > 1.

Throughout we write x := n/2 − a, so that 2x + 1 = n − 2a + 1 and 0 ≤ x ≤ n/2 − 1.

One caveat to state up front, since it is load-bearing. The statement proved here is about ρ(n). Turning "ρ(n) < 1" into "the boundary point never wins" uses [GLOW]'s own ten-point theorem and their Proposition 7.2, taken as published. We re-derived Proposition 7.2 from the definition of traffic, at every grid point, only for 9 ≤ n ≤ 120 (0 mismatches; allpoints_control.py).

Section 2The criterion is a Catalan inequality

Lemma 1

For n ≥ 3 and 1 ≤ a ≤ n/2,

G(n,a) = C(n,a)²·a(n−2a+1)/(n(n−1)),    D(n) = C(2n−2,n−1)/n = Cat(n−1),

so that Rn(a) = a(n−2a+1)·C(n,a)² / ((n−1)·C(2n−2,n−1)), and Rn(a) > 1 if and only if a(n−2a+1)·C(n,a)² > (n−1)·C(2n−2,n−1).

Proof. C(n−2,a−1) = (n−2)!/((a−1)!(n−a−1)!) = C(n,a)·a(n−a)/(n(n−1)); substitute into G and cancel n−a. The second identity is the definition of the Catalan number. ∎

So in the unobstructed grid the margin f(1,1) − f(1,0) is a Catalan number, and the obstruction subtracts G(n,a) from it. The anomaly is the event that a single roadblock destroys more than Cat(n−1) of the advantage. This is the simplification asked for in [GLOW, §7, question (1)].

Section 3The analytic bound

The Stirling tools are Robbins' two-sided factorial bound (Lemma 2, cited via Feller §II.9, secondary source, not re-derived here), the resulting two-sided bound on C(n,a) (Lemma 3), the entropy inequality t² ≤ (1+t)log(1+t) + (1−t)log(1−t) ≤ t² + t⁴/(6(1−t²)) (Lemma 4) and the central binomial bound (4m/√(πm))e−1/(6m) < C(2m,m) < 4m/√(πm) (Lemma 5). Full statements and proofs are in the note.

Write φn(x) = (2x+1)e−4x²/n and x*(n) = (√(2n+1)−1)/4. Lemma 6 shows φn rises on [0, x*] and falls after it, with an explicit value at the peak.

Theorem A

For every n ≥ 3000 and every integer a with 1 ≤ a ≤ n/2,

Rn(a) < U(n) := c0·√(n/(n−1))·(1 − 1/√(2n))−1·exp( 1/√(2n) + 1/(3(n−1)) ),

with c0 = √(8/π)e−1/2 = 0.967882…, and U(n) ≤ U(3000) < 0.9939. In particular ρ(n) < 1 for all n ≥ 3000.

Proof sketch. Put x = n/2 − a. Lemma 1, the upper bound of Lemma 3 squared, the upper bound of Lemma 4 squared, and the lower bound of Lemma 5 at m = n−1 give

Rn(a) < (2/√π)·(n/(n−a))·φn(x)/√(n−1)·e1/(6n) + 1/(6(n−1)).
(3.1)

Since a ≤ n/2 we have n/(n−a) ≤ 2; bounding φn(x) ≤ φn(x*) by Lemma 6 collapses everything to U(n), each of whose three correction factors decreases in n. ∎

The final numeric step is the one place a proof of this shape usually leaks floating point, so it is done in exact rational arithmetic (check_bound.py, Fraction only, with ey ≤ 1/(1−y) standing in for the exponential):

StepRational bound usedVerdict
π from Machin's formula, alternating-series bracketingπ > 3.1415926526OK
e from a Taylor partial sume > 2.7182815256OK
c0² = 8/(πe)c0² ≤ 0.9367974091, so c0 < 0.96808OK
√(3000/2999)< 1.00017OK
u = 1/√6000< 0.01291, so (1−u)−1 < 1.013079OK
y = u + 1/8997y = 0.01302115, ey ≤ 1/(1−y) < 1.013194OK
U(3000)< 0.99384915OK

Output of check_bound.py, reproduced verbatim from results_check_bound.txt: eight lines, all OK, ending ALL CERTIFIED.

Section 4The conjecture

Theorem A′ — [GLOW, Conjecture 7.4], in strict form

ρ(n) < 1 for every n ≥ 496. Consequently, for every n ≥ 496 and every obstruction B = (a, n−a) on the antidiagonal, the boundary point (1,0) carries strictly less traffic than (1,1): the antidiagonal anomaly never reappears.

Proof. For n ≥ 3000 this is Theorem A. For 496 ≤ n ≤ 2999 the script verify_anomaly.py evaluates the integer inequality of Lemma 1 for every 1 ≤ a ≤ n/2, in exact integer arithmetic with running-product binomials and no floating point, and finds no anomalous a. The per-n record (maximising a, number of anomalous a, ⌊109ρ(n)⌋) is the committed certificate certificate_3_3000.csv; the run takes 12 s on one core. The "consequently" is [GLOW, Proposition 7.2] with their ten-point theorem. ∎

The largest value on that range is ρ(497) = 0.999955284, attained at a = 241. On the other side, ρ(495) = 1.000024. The threshold is real but the margin is about two parts in a hundred thousand, which is worth keeping in mind when reading the figures.

On the label. Theorem A is a proof for n ≥ 3000. The finite range 496 ≤ n ≤ 2999 is an exact, reproducible computation shipping a certificate, and on its own it is Certified, not proved. Together they establish the conjecture for all n ≥ 496, and the combined statement is Proved in the sense that a finite exact case analysis is a legitimate step in a proof. A reader who declines to accept computer-checked finite case analysis should read the result as: proved for n ≥ 3000, verified for 496 ≤ n ≤ 2999.

The same computation reproduces [GLOW]'s data below 496 and sharpens it. Anomalous n: every 3 ≤ n ≤ 375 (373 values, the paper reports from 8), then exactly

377,  379–422,  the even 424–462,  464,  465,  and the odd 467–495

which is 82 values, 455 in all on [3, 3000]. The paper printed only "intermittently up to 495".

Section 5The limit of the ratio

Theorem B

ρ(n) → c0 = √(8/π)e−1/2 = 0.9678828980…, more precisely ρ(n) = c0(1 + 1/√(2n) + O(1/n)). In particular the envelope c0(1 + 1/√(2n)) crosses 1 at n ≈ 454.

The proof works with Fn(x) = log(2x+1) − 4x²/n − log(1 + 2x/n), shows it is concave, locates its maximiser within 1 of x*, and matches the upper bound of (3.1) with a lower bound obtained from the lower halves of Lemmas 3 and 4 at a well-chosen integer an. The O(1/n) is not made explicit; that is the one gap between this section and a fully quantitative transition analysis.

Numerically the remainder behaves as advertised. With exact ratios ρ(3000) = 0.980606160, ρ(10000) = 0.974795079, ρ(30000) = 0.971852232, the quantity n(ρ(n)/c0 − 1 − 1/√(2n)) reads 0.707, 0.705 and 0.557, consistent with a remainder of size about 0.6/n. That last sentence is Numerical: three points are not an asymptotic.

The long view. Exact ρ(n) for 3 ≤ n ≤ 3000 on a logarithmic horizontal axis (374 sampled sizes out of 2998 computed; every size below 200, then every fifth, then every twenty-fifth). Measurement, exact integer arithmetic. The horizontal lines are ρ = 1 and the proved limit c0 = 0.967882. The curve crosses 1 for the last time between 495 and 497 and then decreases towards c0 from above, which is what Theorem B says it must do: the approach is from above because the correction term +1/√(2n) is positive.

Section 6Why the pattern looked irregular

Proposition C

(a) For n ≥ 3 the sequence a ↦ Rn(a) on 1 ≤ a ≤ ⌊(n−1)/2⌋ is log-concave, hence unimodal, because

Rn(a+1)/Rn(a) = (n−a)²(n−2a−1) / ( a(a+1)(n−2a+1) )

is a product of three positive factors each decreasing in a. Proved

(b) The integer maximiser an satisfies |an − (n/2 − x*(n))| ≤ 1 for every 3 ≤ n ≤ 3000. Certified on that range only.

(c) is the explanation, and it is a Numerical model rather than a theorem. Write δn for the distance from the real maximiser to the nearest admissible integer position. Then ρ(n) is a smooth envelope diminished by a rounding penalty of roughly exp(−8δn²/n). Near the threshold the envelope exceeds 1 by only 0.1 to 0.3 per cent, while the penalty ranges from 0 to about 8·(1/2)²/n ≈ 0.4 per cent. So on 376 ≤ n ≤ 495 the anomaly survives exactly when δn is small.

The parity alternation follows. x* drifts slowly, from 7.00 at n = 420 to 7.50 at n = 480, while n/2 is a whole number for even n and a half-integer for odd n. Around 420 the even sizes round well and the odd ones badly; around 480 the roles have swapped. Which is exactly the observed list: the even numbers survive to 462, the odd ones to 495.

Window
The rounding mechanism. For each board size, the vertical bar is δn, the distance from the real optimal roadblock position n/2 − x*(n) to the nearest whole one. Filled bars are sizes where the anomaly happens, hollow ones where it does not. Both the offsets and the anomaly flags are measurements computed from the exact certificate, not from the model. The claim the figure makes is the alternation: in the left half the filled bars are the even sizes, in the right half the odd ones, and in both halves they are the short bars. The model of paragraph (c) predicts precisely that, but the figure does not assume it.

Section 7The paper's three questions

  1. Can the criterion be simplified or better understood? Yes. It is a(n−2a+1)C(n,a)² > (n−1)C(2n−2,n−1), the obstruction's deficit against the Catalan number Cat(n−1) (Lemma 1). Asymptotically Rn(n/2−x) ≈ √(8/(πn))(x + ½)e−4x²/n, maximal near x = √(n/8) with value c0(1 + 1/√(2n) + O(1/n)).
  2. Why the irregular pattern? Rounding of n/2 − x*(n) to an integer, in the narrow window where the envelope is within 0.3 per cent of 1, with the parity of n deciding which class rounds well (Proposition C(c)). Model, not theorem.
  3. Can the bound n ≥ 9 be improved? Not addressed. That question concerns their ten-point theorem, not the anomaly.

Still open. An explicit description of the exact anomalous set from the cubic of Proposition C(a) and Theorem B's expansion with explicit constants; and a lower bound ρ(n) ≥ c0(1 + 1/√(2n) − C/n) with a numerical C, which would turn the transition analysis of section 6 from explanatory into rigorous.

Section 8Reproducing this

ScriptWhat it doesCost
verify_anomaly.py 3 3000 certificate_3_3000.csvExact integer verification of Lemma 1's inequality for every n, a; writes the certificate12 s, one core, Python 3.11, no dependencies
check_bound.pyThe rational-arithmetic evaluation of U(3000) in Theorem A (Fraction only)instant
allpoints_control.py 120Independent control of [GLOW, Prop. 7.2]: computes fB at all grid points for every antidiagonal B and checks both the argmax and the criterion9 ≤ n ≤ 120, 0 mismatches
transition_table.pyThe table behind figures 1 and 2 (n, an, x*, δn, ρ(n))instant

Run them from inside conjectures/antidiagonal-anomaly/: the scripts reference data files by bare relative name.