The gerrymander sequence, or A348456

TL;DR

This paper extends the gerrymander sequence to 11 terms, establishes its growth rate related to self-avoiding walks crossing a square, and reveals deep connections with related combinatorial problems.

Contribution

It provides the first proof of the exponential growth rate of the gerrymander sequence and links it to self-avoiding walk and polygon crossing problems, along with improved counting algorithms.

Findings

The gerrymander sequence coefficients grow as λ^{4L^2} with λ ≈ 1.7445.

The growth behavior is closely related to self-avoiding walks crossing a square.

The sequence's asymptotic form includes specific polynomial and exponential factors.

Abstract

Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11 terms, but more significantly prove that the coefficients grow as $\lambda^{4L^2},$ where $\lambda \approx 1.7445498, $ and is equal to the corresponding quantity for self-avoiding walks crossing a square (WCAS), or self-avoiding polygons crossing a square (PCAS). These are, respectively, OEIS sequences A007764 and A333323. Thus we have established a close connection between these previously separate problems. We have also related the sub-dominant behaviour to that of WCAS and PCAS, allowing us to conjecture that the coefficients of the gerrymander sequence A348456 grow as $\lambda^{4L^2+dL+e} \cdot L^g,$ where $d=-8.08708 \pm 0.0002,$ $e \approx 7.69$ and $g = 0.75 \pm 0.01,$ with $g$ almost certainly $3/4$ exactly. We also have generated 26 terms in the related gerrymander polynomial (defined below), and have been able to predict the asymptotic behaviour with a satisfying degree of precision. Indeed, it behaves exactly as $L$ times the corresponding coefficient of the generalised gerrymander sequence. The improved algorithm we give for counting these sequences is a variation of that which we recently developed for extending a number of sequences for SAWs and SAPs crossing a domain of the square or hexagonal lattices. It makes use of a minimal perfect hash function and in-place memory updating of the arrays for the counts of the number of paths.