Jump to content

Interleave sequence

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 17:54, 9 April 2014 (Properties: source z-order). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, an interleave sequence is obtained by merging two sequences.

Let be a set, and let and , be two sequences in The interleave sequence is defined to be the sequence Formally, it is the sequence given by

Properties

  • The interleave sequence is convergent if and only if the sequences and are convergent and have the same limit.
  • Consider two real numbers a and b greater than zero and smaller than 1. One can interleave the sequences of digits of a and b, which will determine a third number c, also greater than zero and smaller than 1. In this way one obtains an injection from the square (0, 1)×(0, 1) to the interval (0, 1). Different radixes give rise to different injections; the one for the binary numbers is called the Z-order curve or Morton code.[1]

References

  1. ^ Mamoulis, Nikos (2012), Spatial Data Management, Synthesis lectures on data management, vol. 21, Morgan & Claypool Publishers, pp. 22–23, ISBN 9781608458325.

This article incorporates material from Interleave sequence on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.