Bijective numeration¶

A numeral system giving every nonnegative integer exactly one finite digit string, with no zero digit or leading-zero ambiguity in its positional form.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3460
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Numeral Systems → Mathematics

Core Idea¶

Bijective base-k uses digits one through k and a modified carry rule so positive integers correspond uniquely to nonempty strings, with the empty string commonly representing zero. Eliminating a zero digit shifts place-value recurrence and carry behavior, turning the free monoid of finite digit strings into a one-to-one enumeration of integers. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Counting Without Zero

Most counting uses a zero, like in 10 or 20. Bijective numeration is a way to write numbers without any zero at all. With just the digits 1 and 2, you'd count 1, 2, 11, 12, 21, 22, 111, and so on. Every counting number gets exactly one way to be written, and no two numbers share a spelling.

Zero-Free Number Writing

Bijective numeration is a way of writing numbers without a zero digit. In the base-ten version, you use digits 1 through 9 plus a special digit, say 'A', that stands for ten. So you count 1, 2, …, 9, A, then 11, 12, …, 19, 1A, 21, and so on. Because there's no zero, carrying works a little differently: 10 is written 'A' and 20 is written '1A'. The cool part is that every positive whole number has exactly one way to be written, and every string of these digits stands for exactly one number. Zero is usually written as an empty string with no digits at all.

Zero-Free Positional Notation

In bijective base-k numeration, the digits are 1, 2, …, k instead of 0, 1, …, k−1. A string of digits d_m…d_1d_0 still represents Σ d_i·k^i, but because there is no zero digit, the carry rule shifts: when you add 1 to the digit k, it becomes 1 and you carry. The result is a perfect one-to-one correspondence (a bijection) between positive integers and nonempty digit strings, and the empty string is usually taken to mean zero. In ordinary base k, that's not true, since strings with leading zeros like 007 and 7 name the same number. Proving the system really is bijective requires fixing the digit set, the base, the empty-string convention, and the evaluation rule, then showing each number has exactly one representation.

Bijective base-k numeration (k ≥ 1) uses the digit alphabet {1, …, k} and evaluates a string d_n…d_0 as Σ d_i k^i, equivalently by the recurrence value(s·d) = k·value(s) + d with value(ε) = 0 for the empty string ε. Removing the zero digit changes place-value recurrence and carry behavior: incrementing the digit k yields 1 with a carry, and conversion from an integer N uses a shifted division, taking the digit d ∈ {1,…,k} with d ≡ N (mod k) and continuing with (N − d)/k. The result is a bijection between the free monoid of finite strings over the digit alphabet and the nonnegative integers, with nonempty strings corresponding exactly to positive integers. This differs from standard positional notation, where leading zeros break uniqueness, and the case k = 1 reduces to unary (tally) notation. A claim to be bijective numeration needs the alphabet, base, empty-string convention, evaluation recurrence and a uniqueness proof all fixed; merely using nonzero digits is not enough.

Scope of Application¶

Bijective numeration belongs to numeral systems and is useful where the analyst can specify the typed numeral systems carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the digit alphabet, base, empty-string convention, evaluation recurrence, and uniqueness proof are fixed. The scope is broad within that domain but bounded by the need for the digit alphabet, base, empty-string convention, evaluation recurrence, and uniqueness proof are fixed. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the digit alphabet, base, empty-string convention, evaluation recurrence, and uniqueness proof are fixed the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Bijective numeration can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Bijective numeration. Bijective numeration compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed numeral systems carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the digit alphabet, base, empty-string convention, evaluation recurrence, and uniqueness proof are fixed independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of numeral systems because they reuse the typed numeral systems carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Eliminating a zero digit shifts place-value recurrence and carry behavior, turning the free monoid of finite digit strings into a one-to-one enumeration of integers., and type the carrier, state every parameter and convention in the definition, test that the digit alphabet, base, empty-string convention, evaluation recurrence, and uniqueness proof are fixed, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Bijective numeration Domain-specific

Parents (1) — outgoing typed relations

Bijective numeration is a kind of Bijectivity Prime

What makes it its own entry: the domain-specific identity determined by the digit alphabet, base, empty-string convention, evaluation recurrence, and uniqueness proof are fixed.

Hierarchy paths (3) — routes to 1 parentless root

Bijective numeration → is a kind of Bijectivity → is a kind of Function (Mapping)

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Bijective numeration sits in a crowded region of the domain-specific corpus (9^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Numeral Systems & Integer Sequences (22 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25