Article 76NQ2 Silver Rectangles and the Ways of Kings

Silver Rectangles and the Ways of Kings

by
John
from John D. Cook on (#76NQ2)
Golden rectangles

The defining property of golden rectangle is that if you stick a square on its longer side, you get another golden rectangle.

golden_rectangle.png

The smaller vertical rectangle is similar to the larger horizontal rectangle. This means

/ 1 = (1 + ) /

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

Silver rectangles

A silver rectangle is one that if you stick two squares on its longer side you get another rectangle with the same aspect ratio.

silver_rectangle.png

This tells us

/ 1 = (1 + 2) /

and so ^2 = 1 + 2 and the silver ratio is = 1 + 2.

Just as you can define a golden ratio and a silver ratio, there's an analogous way to define a sequence of metallic ratios.

Kings and Delannoy numbers

The silver ratio has several connections to the ways of ways kings. By that I mean the number of ways a king can go from one corner of a chessboard to the diagonally opposite corner without backtracking.

A king can move one space in any direction. If we start with a king in the bottom left corner of the board, the no-backtracking requirement means the king can move up, right, or up and right.

The number of paths a king can take from one corner to the opposite corner of an n * n chessboard is the nth central Delannoy number Dn. more generally Delannoy numbers are defined for an m * n chessboard, but I'll stick to the casem =n called thecentral Delannoy number, or just Delannoy numbers for short.

The first Delannoy number is 1 because there's only one way for a king to get from one corner to the other: do nothing, because the opposite corner is the same corner. The second Delannoy number is 3 because the king can move up then right, or right then up, or move diagonally up and right.

For a 3 * 3 grid things are significantly more complicated, and D3 = 13. For an 8 * 8 grid the number of paths is 48,639.

Generating function

How would you estimate the number of paths on an n * n board for large values of n without calculating it exactly? You might start by finding a generating function for the Delannoy numbers, which works out to be

(x^2 - 6x + 1)-1/2

The radius of convergence r for the generating function series is the distance from 0 to the closest singularity of the generating function, which is the smaller root of

x^2 - 6x + 1

which is

3 - 8 = (3 + 8)-1 = (1 + 2)-2 = 1/^2

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

Asymptotic estimate

The radius of convergence gives us a first approximation to the asymptotic size of the series coefficients. Since we're working with the generating function of the Delannoy numbers, these coefficients are the Delannoy numbers. That is,

Dn ~ r-n = (2)n = 2n.

That's as good as you can do just knowing the radius of convergence. A more careful analysis would refine this estimate by dividing by a factor proportional to n.

Related postsThe post Silver Rectangles and the Ways of Kings first appeared on John D. Cook.
External Content
Source RSS or Atom Feed
Feed Location http://feeds.feedburner.com/TheEndeavour?format=xml
Feed Title John D. Cook
Feed Link https://www.johndcook.com/blog
Reply 0 comments