Kissing number¶

The maximum number of nonoverlapping congruent spheres that can simultaneously touch one congruent central sphere in a specified space or dimension.

Version: v2 · 2026-09-19 · History
Domain-specific #: 5196
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Discrete Geometry → Mathematics
Aliases: Newton number, Contact number

Core Idea¶

Dimension, norm and congruence convention are constitutive, local contact number in one packing need not attain the global maximum and proofs combine constructions with upper bounds.^[1] Touching unit spheres have centers on a radius-two sphere around the center, while nonoverlap imposes minimum angular separation; maximizing the resulting spherical code gives the kissing number. 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.

The load-bearing residual is not the broad topic of discrete geometry. It is the domain-specific identity fixed by the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Kissing number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

How Many Balls Can Touch

Put one ball on the table. Now see how many balls of the same size you can make touch it at the same time, without any balls squishing into each other. The most you can ever fit is called the kissing number.

The Touching Spheres Count

Imagine one ball in the middle and lots of identical balls around it, each touching the middle ball, with none overlapping. The kissing number is the biggest number of balls that can all touch the middle one at once. The answer depends on the space you are in, for example flat circles on paper versus balls in 3D. To know the true answer, mathematicians have to do two things: build an arrangement that reaches the number, and prove that no arrangement can do better. One arrangement where a ball happens to have a certain number of neighbors doesn't prove that's the biggest possible number.

Maximum Tangent Sphere Count

In discrete geometry, the kissing number asks how many non-overlapping unit spheres can touch one central unit sphere in a given dimension. Each touching sphere's center lies at distance 2 from the central center, so all those centers sit on a sphere of radius 2. Not overlapping means any two of them must be separated by at least a minimum angle. So the problem becomes placing as many points as possible on a sphere with that minimum angular spacing, which is called a spherical code. Finding the kissing number takes two parts: a construction showing an arrangement exists, and an upper-bound proof showing nothing beats it. You must also say which version you mean. The best lattice arrangement can differ from the best unrestricted one, and the number of contacts in one particular packing need not be the maximum.

The kissing number of a space is the maximal number of nonoverlapping unit spheres tangent to a central unit sphere. Its definition depends on declared conventions: ambient dimension, metric, and sphere radii. Tangency places the surrounding centers on a sphere of radius two around the central center, and nonoverlap forces a minimum angular separation between centers, so the problem reduces to finding the largest spherical code with that minimum angle. Establishing a value requires both a candidate configuration achieving a contact count and an upper-bound argument ruling out more. Several distinctions must be kept explicit: the local contact number in a given packing versus the global maximum, and the lattice kissing number versus the unrestricted one. Keeping definition, proof evidence, and downstream use separate prevents applying the result beyond its assumptions.

Structural Signature¶

Carrier: the typed discrete geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets
Inputs or antecedent state: the exact discrete geometry carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Kissing number
Constitutive operation: Touching unit spheres have centers on a radius-two sphere around the center, while nonoverlap imposes minimum angular separation; maximizing the resulting spherical code gives the kissing number.
Invariant: the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit
Recognition test: type the carrier, state every parameter and convention in the definition, test that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Kissing number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of discrete geometry. The field contains many questions and methods that do not instantiate Kissing number.
It is not its most familiar example. A canonical instance directly demonstrates that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Sphere packing density. Packing density maximizes occupied volume globally; kissing number maximizes the local contact count around one sphere.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Kissing number must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside discrete geometry, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Kissing number belongs to discrete geometry and is useful where the analyst can specify the typed discrete geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit. The scope is broad within that domain but bounded by the need for the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact discrete geometry carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Kissing number are converted, constrained, or organized by Touching unit spheres have centers on a radius-two sphere around the center, while nonoverlap imposes minimum angular separation; maximizing the resulting spherical code gives the kissing number..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Kissing number must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Kissing number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit 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 Kissing number can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact discrete geometry carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Kissing number, the structure counts as Kissing number exactly when the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

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 Kissing number. Kissing number 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.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Kissing number. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed discrete geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit, infer recognizing and comparing instances of Kissing number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Kissing number must control the decision and an object that resembles Kissing number in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of discrete geometry because they reuse the typed discrete geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Touching unit spheres have centers on a radius-two sphere around the center, while nonoverlap imposes minimum angular separation; maximizing the resulting spherical code gives the kissing number., and type the carrier, state every parameter and convention in the definition, test that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Kissing number, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit. The example exposes the carrier and directly tests that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed discrete geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets; the operative rule is Touching unit spheres have centers on a radius-two sphere around the center, while nonoverlap imposes minimum angular separation; maximizing the resulting spherical code gives the kissing number.; the invariant is the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit; and the result supports recognizing and comparing instances of Kissing number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit destroys the classification.

Mapped back: the typed discrete geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets → Touching unit spheres have centers on a radius-two sphere around the center, while nonoverlap imposes minimum angular separation; maximizing the resulting spherical code gives the kissing number. → the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit → recognizing and comparing instances of Kissing number, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Kissing number, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Kissing number, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from discrete geometry and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, Touching unit spheres have centers on a radius-two sphere around the center, while nonoverlap imposes minimum angular separation; maximizing the resulting spherical code gives the kissing number., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Kissing number, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Kissing number, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in discrete geometry.

This entry is a kind of Optimization.

It remains its own entry because its identity is fixed by the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions.

Relationships to Other Abstractions¶

Current abstraction Kissing number Domain-specific

Parents (1) — outgoing typed relations

Kissing number is a kind of Optimization Prime

It remains its own entry because its identity is fixed by the ambient dimension and metric, central and surrounding sphere radii, tangency and nonoverlap constraints, center-point spherical-code reduction, candidate configuration and contact count, upper-bound argument and local versus global and lattice versus unrestricted distinctions.

Hierarchy path (1) — routes to 1 parentless root

Kissing number → is a kind of Optimization

Neighborhood in Abstraction Space¶

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

Family — Euclidean & Geometric Structures (25 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

Sphere packing density. Packing density maximizes occupied volume globally; kissing number maximizes the local contact count around one sphere.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Kissing number. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Kissing number. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Hans D Mittelmann, Frank Vallentin, 'High accuracy semidefinite programming bounds for kissing numbers', [[Experimental Mathematics (journal), 2010, doi:10.1080/10586458.2010.10129070. registry ↩a ↩b

[2] M. V Marathe, H Breu, H. B Hunt, S. S Ravi, D. J Rosenkrantz, 'Simple heuristics for unit disk graphs', Networks, 1995, doi:10.1002/net.3230250205. registry ↩a ↩b

[3] John H Conway, Neil J.A. Sloane, 'Sphere Packings, Lattices and Groups', Springer-Verlag, 1999. registry ↩