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

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.

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.

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.

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.

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.

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.

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