---
title: D(n)-Pairs in Number Theory and Geometry
url: https://www.emergentmind.com/topics/d-n-pairs
type: topic
---

# D(n)-Pairs in Number Theory and Geometry

A D(n)-pair is a concept with several distinct, well-established meanings in the mathematical literature, depending on context. The most prominent usages are (1) in Diophantine tuple theory, where D(n)-pairs are sets of integers with prescribed pairwise quadratic properties, and (2) in discrete geometry, where “double-normal pairs” (sometimes denoted D(n)-pairs) quantify the extremal geometry of finite point configurations in Euclidean spaces. Below, the definitions, main theorems, methodologies, and connections for both primary senses are detailed.

## 1. D(n)-Pairs in Diophantine Tuple Theory

A **D(n)-pair** consists of two distinct positive integers $\{a, b\}$ such that $ab + n$ is a perfect square. More generally, a **D(n)-m-tuple** is a set $\{a_1,\ldots,a_m\}$ of positive integers such that for every $1 \leq i < j \leq m$ the number $a_i a_j + n$ is a perfect square [1610.04415, 2001.04160, 2304.01775, 2512.22902].

### Key Properties and Examples

- For $n = 1$, the classical example is D(1)-quadruple $\{1,3,8,120\}$, as all pairwise products plus 1 yield perfect squares.
- For $n = -1$, a correct D($-1$)-triple is $\{1,8,15\}$.
- For $n = 0$, D(0)-m-tuples are simply sets of integers whose pairwise products are squares, e.g., $\{1,4,9\}$ [1610.04415].

### Algebraic Structure and Connection to Quadratic Forms

Given a D(n)-pair $\{a, c\}$, one associates the integral binary quadratic form $E_{ac}(x, y) = a x^2 + (2b) x y + c y^2$ with discriminant $4n$, where $ab+n=b^2$ for some $b \in \mathbb{Z}$. This embeds D(n)-pairs into the proper $\operatorname{SL}_2(\mathbb{Z})$-equivalence classes of binary quadratic forms with discriminant $4n$. Asymptotically, D(n)-pairs are equidistributed among these equivalence classes for fixed content [2512.22902].

### Asymptotic Enumeration

Let $D_{2,n}(N)$ be the number of D(n)-pairs $\{a,b\}$ with $1 \leq a<b \leq N$. For $n=q$ prime, $D_{2,q}(N)$ exhibits linear growth:
\[
D_{2,q}(N) = \frac{L(1,\chi_q)}{\zeta(2)}\,N + o(N)
\]
where $\chi_q$ is the Kronecker symbol and $L(1, \chi_q)$ is the Dirichlet L-function [2304.01775]. In general, the asymptotics are governed by analytic properties of Dirichlet L-functions and the class number $h(4n)$ of the discriminant [2512.22902].

#### Table: Asymptotic Regimes for D(n)-pair Count (max $|a|,|c|\leq X$)

| $n$             | Growth Rate                   | Leading Constant (informal)                       |
|-----------------|------------------------------|---------------------------------------------------|
| $n < 0$         | $\sim K_n X$                 | $12/(\pi |n|^{1/2} h(d_0)...)$                   |
| $n > 0$ square  | $\sim \frac{12}{\pi^2} X\log X$   | $12/\pi^2$                                        |
| $n > 0$ non-sq. | $\sim K_n X\log X$           | $12\log(\epsilon_{d_0}h(d_0))/(\pi^2 n^{1/2} ...)$ |

Constants depend on discriminant factorization, divisor sums, fundamental units, and auxiliary invariants [2512.22902].

### Extending D(n)-Pairs

A central Diophantine problem is to determine when D(n)-pairs can be extended to D(n)-triples or quadruples.
- For $n=-8k^2$, the pair $\{8k^2, 8k^2+1\}$ has the property that any D($-8k^2$)-quadruple containing it must be of the form $\{8k^2, 8k^2+1,1,32k^2+1\}$, and no further extension is possible [1610.04415].
- For $n=-k$, the natural D($-k$)-pair $\{k,k+1\}$ cannot be extended beyond a quadruple where the additional element is $1$; any attempt to adjoin $c>1$ forces the fourth element to be $1$ [2001.04160].

These results rely heavily on the analysis of associated Pell equations and recurrence sequences.

### Generalizations and Open Problems

Investigation continues on parametric families of D(n)-pairs for various choices of $n$, relationships to negative Pell and generalized Pell equations, rigidity of possible extensions, and higher m-tuple analogues. Open problems include explicit classification for certain $n$, determining maximal tuple size $M_n$ as a function of $n$, and resolving uniqueness phenomena in the spirit of the folklore D(1)-triple conjecture [1610.04415, 2001.04160].

## 2. D(n)-Pairs as Double-Normal Pairs in Discrete Geometry

In combinatorial and discrete geometry, a **double-normal pair** (sometimes labeled as D(n)-pair in this context) for a set $V \subset \mathbb{R}^d$ of $n$ points is a pair $\{p, q\} \subset V$ such that all of $V$ lies within the closed slab bounded by two parallel hyperplanes passing through $p$ and $q$ and orthogonal to the segment $pq$ [1412.4405, 1404.0419].

### Extremal Enumeration and Turán-Type Results

Let $N_d(n)$ denote the maximal number of double-normal pairs determined by any $n$-point set in $\mathbb{R}^d$. The principle result is that
\[
N_d(n) = \frac{1}{2}\left(1 - \frac{1}{k(d)}\right) n^2 + o(n^2)
\]
where $k(d)$ is the largest integer such that a balanced $k(d)$-partite graph $K_{k(d)}(r)$ can be realized as the double-normal graph in $\mathbb{R}^d$ [1412.4405, 1404.0419].

#### Table: Known Bounds for $k(d)$

| Dimension $d$ | $\lceil d/2\rceil \leq k(d) \leq d-1$ | Exact Value (low $d$) |
|---------------|--------------------------------------|-----------------------|
| 3             | 2                                    | 2                     |
| 4             | 2                                    | 2                     |
| 5             | 3                                    | 3                     |
| 7             | —                                    | 4                     |

As $d\to\infty$, $k(d) = d - (1+o(1)) \log_2 k(d)$, and extremal configurations approach Turán-type distributions [1412.4405].

### Geometry and Angle Problems

The structure of double-normal pairs is tightly linked to classical results in extremal combinatorics and angle bounds in point configurations (cf. Danzer–Grünbaum theorem). The upper bound $k(d)+\lceil \log_2 k(d) \rceil \leq d$ arises via orthogonality arguments in Euclidean space and methodologies bridging geometric Ramsey theory and extremal graph methods [1412.4405].

### Planar Case

For $d = 2$ the exact value is
\[
N_{2}(n)=N'_{2}(n)=3\,\lfloor n/2 \rfloor
\]
where $N_{2}(n)$ and $N'_{2}(n)$ count all and strict double-normal pairs respectively [1404.0419]. Extremal sets consist of two parallel lines carrying approximately half the points each, with all vertical and adjacent diagonal pairs included.

### Connections and Broader Significance

Double-normal pair statistics encode extremal intersection phenomena, form a geometric analogue to D(n)-tuple enumeration, and connect with graph-theoretic Turán densities, Ramsey-type constructions, and the combinatorics of acute and non-obtuse sets in metric geometry [1412.4405, 1404.0419].

## 3. D(n)-Pairs in Algebraic and Combinatorial Structures

Several additional contexts feature the D(n)-pair notion:
- In $\mathbb{Z}_n$, a gcd-pair is a D(n)-pair if $\gcd(a,b)\mid n$, relating pairwise divisibility to the structure of associated graphs and number-theoretic tilings [2206.01847].
- In abelian group theory, particularly in the study of complementing pairs, $(T,S)$ is a D(n)-pair in $(\mathbb{Z}_{\geq 0})^n$ if $T\oplus S = (\mathbb{Z}_{\geq 0})^n$, with a full tree-based classification available for primitive pairs [2005.09204].
- In group cohomology, the terminology appears in Poincaré duality (PD(n)-pair), where a group pair $(G,S)$ is a PD(n)-pair if it admits the cap-product isomorphisms mimicking Poincaré duality for manifolds [1812.10577].

## 4. Analytic and Algorithmic Methods

D(n)-pair enumeration and extension results heavily utilize analytic number theory (Dirichlet series, L-functions, Tauberian theorems), recurrence sequences arising from Pell and negative Pell equations, congruence argumentation, and, in geometric settings, extremal graph theory and Ramsey-type orthogonality constructions [2304.01775, 2512.22902, 1412.4405, 1610.04415].

Algorithmic approaches exist for enumerating D(n)-pairs in finite rings (e.g., $\mathbb{Z}_n$), relying on divisor criteria and gcd computations, with time complexities $O(n^2 \log n)$ for naive enumeration and optimizations based on algebraic structure [2206.01847].

## 5. Open Problems and Research Directions

Areas of ongoing research include:
- Full characterization of maximal D(n)-m-tuples for negative and special forms of $n$, particularly with respect to extendibility and uniqueness.
- Connections between D(n)-tuple structures, class group statistics, and the distribution of quadratic forms.
- Finer asymptotic results for D(n)-pair distributions, error terms, and secondary fluctuations.
- Algorithmic complexity of enumeration and recognition in large-scale combinatorial settings.
- Expansion of geometric and algebraic frameworks (e.g., to higher-rank homogeneous spaces, non-abelian groups, or other ground rings) [1610.04415, 2512.22902, 1412.4405, 2005.09204, 1812.10577].

## References

- "On the extension of $D(-8k^2)$-pair $\{8k^2, 8k^2+1\}$" [1610.04415]
- "The extension of the $D(-k)$-pair $\{k,k+1\}$ to a quadruple" [2001.04160]
- "Asymptotics of $D(q)$-pairs and triples via $L$-functions of Dirichlet characters" [2304.01775]
- "Equidistribution of Diophantine pairs among the equivalence classes of quadratic forms" [2512.22902]
- "Number of double-normal pairs in space" [1412.4405]
- "Double-normal pairs in space" [1404.0419]
- "gcd-Pairs in $\mathbb{Z}_{n}$ and their graph representations" [2206.01847]
- "Characterization of complementing pairs of $({\mathbb Z}_{\geq 0})^n$" [2005.09204]
- "A Combination Theorem for PD(n)-Pairs" [1812.10577]

Source: https://www.emergentmind.com/topics/d-n-pairs