关于「东西方原典考辨:《孙子·虚实》的「我专敌分」与杜能的孤立国」,《图灵斑图与据点间距》给出的定量结论是什么?
结论:第七章考辨《孙子·虚实》的「我专为一,敌分为十」(高点只有均匀水平的 2.72 倍,达不到十倍)与冯·杜能 1826 年的《孤立国》(间距随价格变,图灵间距不随价格变)。
数据口径:书中半径、衰减率、城市长度与数据均为示意;全部计算由书中程序生成;本书属非个人化经营方法,不构成投资、法律或选址决策建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(17 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 2.72
| lh/la even level peak peak/even zone share zone activity | |
| 3.0 | 1.655 3.46 2.09 0.445 0.742 |
| 4.0 | 1.592 4.32 2.72 0.410 0.810 |
| 6.0 | 1.518 6.18 4.07 0.335 0.867 |
| budget 8 split height peaks total activity per opening | |
| 1 | 7.523 1 13.75 13.75 |
| 2 | 3.761 2 27.47 13.74 |
| 4 | 1.881 4 51.80 12.95 |
| 8 | 0.940 8 74.73 9.34 |
| 16 | 0.470 5 60.35 3.77 |
查看完整验算程序
# Chapter 7. p71: Sunzi's "we concentrate into one, the enemy divides
# into ten, so we attack one with ten", written as numbers.
# Part 1: the patterned corridor of p51 (40 km, la = 0.6 km, mu = 1,
# nu = 2) for three reach ratios. Compare the brand's peak with a rival
# that spreads the same total activity evenly: is any local ratio near
# ten to one? Also the share of activity inside the "concentrated"
# zone where a exceeds the even level.
# Part 2: one fixed opening budget (total bump mass 8) put into 1, 2,
# 4, 8 or 16 openings in an empty 40 km city (as in p61, lh = 2.4 km).
# Illustrative parameters throughout.
import math
import random
MU, NU, LA = 1.0, 2.0, 0.6
LENGTH, DX, DT = 40.0, 0.2, 0.05
def factor(n, r, c):
di = [1.0 + c + 2.0 * r] * n
di[0] = di[-1] = 1.0 + c + r
cp, den = [0.0] * n, [0.0] * n
den[0] = di[0]
cp[0] = -r / den[0]
for i in range(1, n):
den[i] = di[i] + r * cp[i - 1]
cp[i] = -r / den[i]
return cp, den, r
def solve(f, rhs):
cp, den, r = f
n = len(rhs)
y = [0.0] * n
y[0] = rhs[0] / den[0]
for i in range(1, n):
y[i] = (rhs[i] + r * y[i - 1]) / den[i]
for i in range(n - 2, -1, -1):
y[i] -= cp[i] * y[i + 1]
return y
def run(lh, a, t_end):
n = len(a)
h = [2.0] * n
fa = factor(n, DT * MU * LA * LA / DX ** 2, DT * MU)
fh = factor(n, DT * NU * lh * lh / DX ** 2, DT * NU)
for _ in range(int(round(t_end / DT))):
ra = [a[i] + DT * a[i] * a[i] / h[i] for i in range(n)]
rh = [h[i] + DT * a[i] * a[i] for i in range(n)]
a, h = solve(fa, ra), solve(fh, rh)
return a
def count_peaks(a):
lo, hi = min(a), max(a)
cut, n = lo + 0.5 * (hi - lo), len(a)
return len([i for i in range(n) if a[i] > cut
and (i == 0 or a[i] >= a[i - 1])
and (i == n - 1 or a[i] > a[i + 1])])
n = int(round(LENGTH / DX))
print("lh/la even level peak peak/even zone share zone activity")
for ratio in (3.0, 4.0, 6.0):
rng = random.Random(20261113)
a0 = [2.0 * (1.0 + 0.01 * (rng.random() - 0.5)) for _ in range(n)]
a = run(ratio * LA, a0, 400.0)
even = math.fsum(a) / n
zone = [x for x in a if x > even]
print("%5.1f %10.3f %4.2f %9.2f %10.3f %13.3f"
% (ratio, even, max(a), max(a) / even, len(zone) / n,
math.fsum(zone) / math.fsum(a)))
print("budget 8 split height peaks total activity per opening")
for k in (1, 2, 4, 8, 16):
gap = LENGTH / k
hgt = 8.0 / k / (0.6 * math.sqrt(math.pi))
a0 = [math.fsum(hgt * math.exp(-(((i + 0.5) * DX - gap / 2 - j * gap)
/ 0.6) ** 2) for j in range(k))
for i in range(n)]
a = run(2.4, a0, 300.0)
tot = DX * math.fsum(a)
print("%14d %6.3f %5d %14.2f %11.2f"
% (k, hgt, count_peaks(a), tot, tot / k))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《图灵反应扩散斑图、小众口碑品牌陌生城市据点涌现与区域垄断扩散比条件母典》第 7 章「东西方原典考辨:《孙子·虚实》的「我专敌分」与杜能的孤立国」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-247 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026247,
author = {Fan, Yafu},
title = {Turing Reaction-Diffusion Patterns: How the Outposts of a Niche Word-of-Mouth Brand Emerge in a New City, and the Diffusion-Ratio Condition for Regional Dominance},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}