of the three-dimensional case of de Bruijn's theorem, based on the algebra of polynomials. The third of de Bruijn's results is that, if a brick is not...
8 KB (1,166 words) - 11:42, 18 August 2023
The De Bruijn–Erdős theorem may refer to: De Bruijn–Erdős theorem (incidence geometry) De Bruijn–Erdős theorem (graph theory) This disambiguation page...
164 bytes (52 words) - 06:06, 28 December 2019
arXiv:2004.07558. Weisstein, Eric W. "Klarner's Theorem". MathWorld. Weisstein, Eric W. "de Bruijn's Theorem". MathWorld. Wikimedia Commons has media related...
22 KB (2,676 words) - 07:08, 25 April 2025
has media related to Nicolaas Govert de Bruijn (mathematician). Nicolaas Govert de Bruijn's obituary Bruijn N.G. de Archived 2012-03-04 at the Wayback Machine...
8 KB (708 words) - 21:20, 30 March 2025
De Bruijn notation, a syntax for terms in the λ calculus De Bruijn's theorem, a theorem regarding the packing of bricks into boxes Bruijn De Bruyn De...
2 KB (377 words) - 06:31, 27 December 2022
Carathéodory's theorem (convex geometry) Cauchy's theorem (geometry) Classification of Platonic solids (geometry) de Bruijn's theorem (discrete geometry)...
78 KB (6,296 words) - 20:31, 6 July 2025
fixed. Circle packing in a rectangle Square packing in a square De Bruijn's theorem: packing congruent rectangular bricks of any dimension into rectangular...
7 KB (949 words) - 22:09, 19 June 2025
references are shown with arrows. De Bruijn indices are commonly used in higher-order reasoning systems such as automated theorem provers and logic programming...
13 KB (1,596 words) - 14:07, 26 June 2025
Mutilated chessboard problem (redirect from Gomory's theorem)
puzzle with the clues 1 in one corner and 64 in the opposite corner. De Bruijn's theorem concerns the impossibility of packing certain cuboids into a larger...
30 KB (2,878 words) - 16:35, 22 May 2025
In graph theory, the De Bruijn–Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs. It states that,...
27 KB (3,632 words) - 18:28, 11 April 2025
number Linear-feedback shift register n-sequence BEST theorem Superpermutation de Bruijn (1946). de Bruijn (1975). Brown (1869); Stein (1963); Kak (2000); Knuth...
32 KB (3,550 words) - 05:56, 18 June 2025
The BEST theorem is due to van Aardenne-Ehrenfest and de Bruijn (1951), §6, Theorem 6. Their proof is bijective and generalizes the de Bruijn sequences...
5 KB (545 words) - 13:41, 20 June 2025
Riemann hypothesis (redirect from Critical line theorem)
hypothesis is true, then the theorem is true. If the generalized Riemann hypothesis is false, then the theorem is true. Thus, the theorem is true!! Care should...
127 KB (16,781 words) - 22:34, 19 June 2025
with multiplicity) is b. Theorem: For any non-trivial PBD, v ≤ b. This result also generalizes the Erdős–De Bruijn theorem: For a PBD with λ = 1 having...
4 KB (512 words) - 00:18, 28 February 2024
polyomino tiling, including the mutilated chessboard problem and De Bruijn's theorem that a rectangle tiled by smaller 1 × n {\displaystyle 1\times n}...
7 KB (796 words) - 21:02, 25 August 2024
provide nontrivial lower bounds for the Furstenberg–Sárközy theorem. The Moser–de Bruijn sequence obeys a property similar to that of a Sidon sequence:...
18 KB (2,428 words) - 16:36, 5 January 2025
In incidence geometry, the De Bruijn–Erdős theorem, originally published by Nicolaas Govert de Bruijn and Paul Erdős in 1948, states a lower bound on the...
4 KB (407 words) - 01:34, 27 June 2024
compactness, such as the De Bruijn–Erdős theorem stating that every minimal k-chromatic graph is finite, and the Curtis–Hedlund–Lyndon theorem providing a topological...
15 KB (2,102 words) - 06:46, 13 December 2024
In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map...
49 KB (6,278 words) - 09:23, 4 July 2025
version of Dilworth's theorem, every finite subset S of P has a w-colorable incomparability graph. Therefore, by the De Bruijn–Erdős theorem, P itself also has...
18 KB (2,445 words) - 18:06, 31 December 2024
mathematician. She is known for her contributions to De Bruijn sequences, low-discrepancy sequences, and the BEST theorem. Tatyana Ehrenfest was born in Vienna in...
5 KB (430 words) - 22:46, 23 June 2025
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving...
29 KB (2,933 words) - 22:11, 19 June 2025
{\displaystyle n} different lines. This result is known as the De Bruijn–Erdős theorem. As a base case, the result is clearly true for n = 3 {\displaystyle...
41 KB (5,243 words) - 13:09, 24 June 2025
non-trivial PBD, v ≤ b. This result also generalizes the famous Erdős–De Bruijn theorem: For a PBD with λ = 1 having no blocks of size 1 or size v, v ≤ b...
33 KB (4,367 words) - 20:46, 16 May 2025
de Bruijn–Erdős theorem (graph theory) de Bruijn–Erdős theorem (incidence geometry) Davenport–Erdős theorem Erdős–Anning theorem Erdős–Beck theorem...
3 KB (229 words) - 20:42, 6 February 2025
the Hesse configuration. A related result is the de Bruijn–Erdős theorem. Nicolaas Govert de Bruijn and Paul Erdős proved the result in the more general...
27 KB (3,319 words) - 17:55, 18 May 2025
Equidistributed sequence (redirect from Weyl equidistribution theorem)
sequence is countable, so f is zero almost everywhere. In fact, the de Bruijn–Post Theorem states the converse of the above criterion: If f is a function such...
21 KB (2,394 words) - 15:08, 20 March 2025
Torus (section de Bruijn torus)
same color. (Contrast with the four color theorem for the plane.) In combinatorial mathematics, a de Bruijn torus is an array of symbols from an alphabet...
40 KB (5,169 words) - 14:24, 31 May 2025
Automath (redirect from Automath theorem prover)
("automating mathematics") is a formal language, devised by Nicolaas Govert de Bruijn starting in 1967, for expressing complete mathematical theories in such...
2 KB (290 words) - 21:07, 18 March 2021
leave out "Hausdorff" we get a theorem equivalent to the full axiom of choice. In graph theory, the de Bruijn–Erdős theorem is another equivalent to BPI...
15 KB (2,256 words) - 13:54, 6 April 2025