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

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

arXiv:2004.07558. Weisstein, Eric W. "Klarner's Theorem". MathWorld. Weisstein, Eric W. "de Bruijn's Theorem". MathWorld. Wikimedia Commons has media related...

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

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

Carathéodory's theorem (convex geometry) Cauchy's theorem (geometry) Classification of Platonic solids (geometry) de Bruijn's theorem (discrete geometry)...

fixed. Circle packing in a rectangle Square packing in a square De Bruijn's theorem: packing congruent rectangular bricks of any dimension into rectangular...

references are shown with arrows. De Bruijn indices are commonly used in higher-order reasoning systems such as automated theorem provers and logic programming...

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

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

number Linear-feedback shift register n-sequence BEST theorem Superpermutation de Bruijn (1946). de Bruijn (1975). Brown (1869); Stein (1963); Kak (2000); Knuth...

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

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

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

polyomino tiling, including the mutilated chessboard problem and De Bruijn's theorem that a rectangle tiled by smaller 1 × n {\displaystyle 1\times n}...

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

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

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

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

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

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

Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving...

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

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

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

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

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

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

("automating mathematics") is a formal language, devised by Nicolaas Govert de Bruijn starting in 1967, for expressing complete mathematical theories in such...

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