What does The Algebra of Check Digits conclude, in numbers, about “The Symmetries of a Pentagon: The Dihedral Group D5 and Anti-Symmetric Permutations”?

Answer: Chapter 4 builds D5 from a pentagon and proves by enumeration that no anti-symmetric permutation exists modulo 10, while D5 has 34040.

Scope of the numbers: Entry volumes, error rates and costs are illustrative; all calculations are generated by the book's programs; the book is not individual 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 onlyprinted values that match the answer: 10, 34040

grouporderanti-symmetric permutations
Z8 (cyclic, even)80
Z9 (cyclic, odd)92025
Z10 (digits mod 10)100
D5 (Verhoeff)1034040
share of all 10! = 3628800 permutations of D5 that work: 0.00938
Z10 search is exhaustive: no single-digit scheme over Z10 with
position maps can catch every single error and every swap
Show the full program
# Chapter 4. p43: counting anti-symmetric maps by exhaustive backtracking.
# A permutation s of a group G is anti-symmetric if x * s(y) != y * s(x)
# whenever x != y. In an abelian group this says that x -> s(x) - x is
# again a permutation (a complete mapping). The search fixes s(0), s(1),
# and so on, and prunes as soon as two values clash. A check scheme
# with one digit from G and position maps s^i catches every single error
# and every neighbour swap iff s is anti-symmetric. Cyclic groups of even
# order have none (Hall and Paige 1955); D5 has many.
import math


def cyclic(n):
    return n, (lambda a, b: (a + b) % n)


def dihedral5():
    def d5(i, j):
        if i < 5 and j < 5:
            return (i + j) % 5
        if i < 5:
            return 5 + (i + j) % 5
        if j < 5:
            return 5 + (i - j) % 5
        return (i - j) % 5
    return 10, d5


def count(n, op):
    s = [None] * n
    used = [False] * n
    found = [0]

    def ok(y, v):
        for x in range(y):
            if op(x, v) == op(y, s[x]):
                return False
        return True

    def place(y):
        if y == n:
            found[0] += 1
            return
        for v in range(n):
            if not used[v] and ok(y, v):
                used[v] = True
                s[y] = v
                place(y + 1)
                used[v] = False
        s[y] = None

    place(0)
    return found[0]


rows = [("Z8 (cyclic, even)", cyclic(8)),
        ("Z9 (cyclic, odd)", cyclic(9)),
        ("Z10 (digits mod 10)", cyclic(10)),
        ("D5 (Verhoeff)", dihedral5())]
print("group                  order  anti-symmetric permutations")
res = {}
for name, (n, op) in rows:
    res[name] = count(n, op)
    print("%-22s %5d  %d" % (name, n, res[name]))
print("share of all 10! = %d permutations of D5 that work: %.5f"
      % (math.factorial(10), res["D5 (Verhoeff)"] / math.factorial(10)))
print("Z10 search is exhaustive: no single-digit scheme over Z10 with")
print("position maps can catch every single error and every swap")

Single source and citation

Fan, Y. (2026). The Algebra of Check Digits and Verhoeff's Dihedral-Group Code: Detection Rates for Single-Digit Slips and Adjacent Transpositions in Order, Remittance and Book Numbers (Version 1.0.0), Chapter 4: The Symmetries of a Pentagon: The Dihedral Group D5 and Anti-Symmetric Permutations. 5D Library. DOI pending

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

BibTeX
@book{fan2026297,
  author    = {Fan, Yafu},
  title     = {The Algebra of Check Digits and Verhoeff's Dihedral-Group Code: Detection Rates for Single-Digit Slips and Adjacent Transpositions in Order, Remittance and Book Numbers},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book