What does Turing Patterns and Topology of the Hand conclude, in numbers, about “From Spots to Parallel Ridges: Two-Dimensional Finite Differences, Anisotropy and Minutiae as Defects”?

Answer: The default two-dimensional Turing pattern is a field of spots, and directionality in a single coefficient is enough to turn it into parallel ridges that run along the direction of slower spreading. Ridge spacing is set by the law and, under the whole-number constraint, jumps around the fastest wavelength; minutiae are set by noise, ranging from 0 to 8 in six runs under one law. Palmistry treats every break and join in the lines as information. This chapter shows that the breaks are first of all the product of a random process.

Scope of the numbers: It analyses structure and probability, makes no personal judgment from anyone's hand, and is not medical, legal or business advice. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only

d_yregionslargest shareanisotropyu maxreading
20240.0720.0022.99spots
1450.2430.7802.79mixed
1050.2570.8892.60stripes
640.2500.9872.17stripes
an anisotropic cue in one coefficient turns spots into
parallel stripes; the stripes run along the slow direction
Show the full program
# Chapter 2. p21: The 2-D Schnakenberg system (a = 0.1, b = 0.9, as in
# p11) on a 26 x 26 periodic grid, grid step 2, time step 0.04, 4000
# explicit steps. The inhibitor diffuses with ratio 20 along x and with
# ratio d_y along y; d_y = 20 is the isotropic case. Below d_c = 8.5676
# (p11) no mode varying only along y can grow. We threshold u at its
# mean and report connected regions (4-neighbour, periodic), the share
# of the largest region, and the gradient anisotropy
# (Gx - Gy) / (Gx + Gy). Fixed seed; illustrative parameters.
import math
import random

A, B, N, DX, DT, STEPS = 0.1, 0.9, 26, 2.0, 0.04, 4000


def neighbours():
    m = N * N
    e = [(i // N) * N + (i % N + 1) % N for i in range(m)]
    w = [(i // N) * N + (i % N - 1) % N for i in range(m)]
    s = [((i // N + 1) % N) * N + i % N for i in range(m)]
    n = [((i // N - 1) % N) * N + i % N for i in range(m)]
    return e, w, s, n


def simulate(dx_ratio, dy_ratio, offset):
    rng = random.Random(20261112 + offset)
    m = N * N
    u = [1.0 + 0.02 * (rng.random() - 0.5) for _ in range(m)]
    v = [0.9 + 0.02 * (rng.random() - 0.5) for _ in range(m)]
    e, w, s, n = neighbours()
    h = 1.0 / (DX * DX)
    cx, cy = dx_ratio * h, dy_ratio * h
    idx = range(m)
    for _ in range(STEPS):
        lu = [h * (u[e[i]] + u[w[i]] + u[s[i]] + u[n[i]] - 4 * u[i])
              for i in idx]
        lv = [cx * (v[e[i]] + v[w[i]] - 2 * v[i])
              + cy * (v[s[i]] + v[n[i]] - 2 * v[i]) for i in idx]
        nu, nv = [], []
        for i in idx:
            a, b = u[i], v[i]
            q = a * a * b
            nu.append(a + DT * (A - a + q + lu[i]))
            nv.append(b + DT * (B - q + lv[i]))
        u, v = nu, nv
    return u


def regions(u):
    e, w, s, n = neighbours()
    mean = math.fsum(u) / len(u)
    on = [x > mean for x in u]
    seen = [False] * len(u)
    sizes = []
    for i in range(len(u)):
        if on[i] and not seen[i]:
            seen[i] = True
            stack, size = [i], 0
            while stack:
                j = stack.pop()
                size += 1
                for k in (e[j], w[j], s[j], n[j]):
                    if on[k] and not seen[k]:
                        seen[k] = True
                        stack.append(k)
            sizes.append(size)
    return sizes


def anisotropy(u):
    e, w, s, n = neighbours()
    gx = math.fsum((u[e[i]] - u[i]) ** 2 for i in range(len(u)))
    gy = math.fsum((u[s[i]] - u[i]) ** 2 for i in range(len(u)))
    return (gx - gy) / (gx + gy)


if __name__ == "__main__":
    print("  d_y   regions  largest share  anisotropy   u max   reading")
    for dy in (20.0, 14.0, 10.0, 6.0):
        u = simulate(20.0, dy, 0)
        sz = regions(u)
        on = math.fsum(sz)
        an = anisotropy(u)
        kind = "stripes" if an > 0.8 else "mixed" if an > 0.3 else "spots"
        print("  {:4.0f}   {:5d}    {:9.3f}     {:8.3f}    {:5.2f}   {}"
              .format(dy, len(sz), max(sz) / on, an, max(u), kind))
    print("an anisotropic cue in one coefficient turns spots into")
    print("parallel stripes; the stripes run along the slow direction")

Single source and citation

Fan, Y. (2026). Turing Reaction-Diffusion Patterns in Palm Dermatoglyphics, Flexion-Crease Topology and Embryonic Stress Inversion (Version 1.0.0), Chapter 2: From Spots to Parallel Ridges: Two-Dimensional Finite Differences, Anisotropy and Minutiae as Defects. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-158 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026158,
  author    = {Fan, Yafu},
  title     = {Turing Reaction-Diffusion Patterns in Palm Dermatoglyphics, Flexion-Crease Topology and Embryonic Stress Inversion},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book