Wednesday, July 1, 2026

Silver Rectangles and the Methods of Kings


Golden rectangles

The defining property of golden rectangle is that should you stick a sq. on its longer aspect, you get one other golden rectangle.

The smaller vertical rectangle is just like the bigger horizontal rectangle. This implies

φ / 1 = (1 + φ) / φ

which tells us φ² = 1 + φ and so the golden ratio φ equals (1 + √5)/2.

Silver rectangles

A silver rectangle is one which should you stick two squares on its longer aspect you get one other rectangle with the identical side ratio.

This tells us

σ / 1 = (1 + 2σ) / σ

and so σ² = 1 + 2σ and the silver ratio is σ = 1 + √2.

Simply as you may outline a golden ratio and a silver ratio, there’s a similar technique to outline a sequence of metallic ratios.

Kings and Dellanoy numbers

The silver ratio has a number of connections to the methods of how kings. By that I imply the variety of methods a king can go from one nook of a chessboard to the diagonally reverse nook with out backtracking.

A king can transfer one house in any route. If we begin with a king within the backside left nook of the board, the no-backtracking requirement means the king can transfer up, proper, or up and proper.

The variety of paths a king can take from one nook to the other nook of an n × n chessboard is the nth central Delannoy quantity Dn. extra usually Dellanoy numbers are outlined for an m × n chessboard, however I’ll follow the case mn known as the central Dellanoy quantity, or simply Dellanoy numbers for brief.

The primary Delannoy quantity is 1 as a result of there’s just one means for a king to get from one nook to the opposite: do nothing, as a result of the other nook is similar nook. The second Delannoy quantity is 3 as a result of the king can transfer up then proper, or proper then up, or transfer diagonally up and proper.

For a 3 × 3 grid issues are considerably extra difficult, and D3 = 13. For an 8 × 8 grid the variety of paths is 48,639.

Producing operate

How would you estimate the variety of paths on an n × n board for giant values of n with out calculating it precisely? You would possibly begin by discovering a producing operate for the Delannoy numbers, which works out to be

(x² − 6x + 1)−1/2

The radius of convergence r for the producing operate sequence is the space from 0 to the closest singularity of the producing operate, which is the smaller root of

x² − 6x + 1

which is

3 − √8 = (3 + √8)−1 = (1 + √2)−2 = 1/σ²

i.e. the radius of convergence is the reciprocal of the silver ratio squared.

Asymptotic estimate

The radius of convergence provides us a primary approximation to the asymptotic dimension of the sequence coefficients. Since we’re working with the producing operate of the Delannoy numbers, these coefficients are the Delannoy numbers. That’s,

Dn ~ rn = (σ2)n = σ2n.

That’s pretty much as good as you are able to do simply understanding the radius of convergence. A extra cautious evaluation would refine this estimate by dividing by an element proportional to √n.

Associated posts

Related Articles

Latest Articles