Danzer's configuration

In mathematics, Danzer's configuration is a self-dual configuration of 35 lines and 35 points, having 4 points on each line and 4 lines through each point.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, Danzer's configuration is a self-dual configuration of 35 lines and 35 points, having 4 points on each line and 4 lines through each point. It is named after the German geometer Ludwig Danzer and was popularised by Branko Grünbaum.

The Levi graph of the configuration is the Kronecker cover of the odd graph O 4 , and is isomorphic to the middle layer graph of the seven-dimensional hypercube graph Q 7 . The middle layer graph of an odd-dimensional hypercube graph Q 2n+1 (n,n+1) is a subgraph whose vertex set consists of all binary strings of length 2n + 1 that have exactly n or n + 1 entries equal to 1, with an edge between any two vertices for which the corresponding binary strings differ in exactly one bit.

Every middle layer graph is Hamiltonian. Danzer's configuration DCD(4) is the fourth term of an infinite series of (\tbinom {2n-1}{n}_n) configurations DCD(n), where DCD(1) is the trivial configuration (1 1 ), DCD(2) is the trilateral (3 2 ) and DCD(3) is the Desargues configuration (10 3 ).

In configurations DCD(n) were further generalized to the unbalanced (\tbinom {n}{d}_d, \tbinom {n}{d-1}_{n-d+1}) configuration DCD(n,d) by introducing parameter d with connection DCD(n) = DCD(2n-1,n). DCD stands for Desargues-Cayley-Danzer. Each DCD(2n,d) configuration is a subconfiguration of the (2^{2n}_{2n+1}) Clifford configuration.…

In mathematics, Danzer's configuration is a self-dual configuration of 35 lines and 35 points, having 4 points on each line and 4 lines through each point. It is named after the German geometer Ludwig Danzer and was popularised by Branko Grünbaum.

The Levi graph of the configuration is the Kronecker cover of the odd graph O 4 , and is isomorphic to the middle layer graph of the seven-dimensional hypercube graph Q 7 . The middle layer graph of an odd-dimensional hypercube graph Q 2n+1 (n,n+1) is a subgraph whose vertex set consists of all binary strings of length 2n + 1 that have exactly n or n + 1 entries equal to 1, with an edge between any two vertices for which the corresponding binary strings differ in exactly one bit.

Every middle layer graph is Hamiltonian. Danzer's configuration DCD(4) is the fourth term of an infinite series of (\tbinom {2n-1}{n}_n) configurations DCD(n), where DCD(1) is the trivial configuration (1 1 ), DCD(2) is the trilateral (3 2 ) and DCD(3) is the Desargues configuration (10 3 ).

In configurations DCD(n) were further generalized to the unbalanced (\tbinom {n}{d}_d, \tbinom {n}{d-1}_{n-d+1}) configuration DCD(n,d) by introducing parameter d with connection DCD(n) = DCD(2n-1,n). DCD stands for Desargues-Cayley-Danzer. Each DCD(2n,d) configuration is a subconfiguration of the (2^{2n}_{2n+1}) Clifford configuration.

While each DCD(n,d) admits a realisation as a geometric point-line configuration, the Clifford configuration can only be realised as a point-circle configuration and depicts the Clifford's circle theorems.

See also

Miquel configuration Reye configuration

Bibliography

. . . .

Text derived from https://en.wikipedia.org/w/index.php?oldid=1328088021 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001328088021 · captured 2025-12-17 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “Danzer's configuration”, snapshot enwiki-001328088021. https://encyclopegia.org/a/danzer-s-configuration

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.