About 87,400 results
|Brualdi, R. A., Introductory combinatorics, North Holland 1977. de Bruijn, N. G., |
Generalization of Pólya's fundamental theorem in enumerative combinatorial
analysis, Ind. Math. 21 (1959), pp. 59–69. 7. Nieuw Arch. Wisk. 11 (1963), pp.
|p(y)F(y)dy+ / p(y)(l - F(y))dy (5.35) By Theorem 5.2, we know that distribution |
function F is in the domain of normal attraction of ... 5.3 Extending de Bruijn's
identity 5.3.1 Partial differential equations Recall that the proof of convergence in
|de Bruijn's Theorem de Jonquieres Theorem 675 Every de Bruijn sequence |
corresponds to an EULER- IAN CYCLE on a DE BRUIJN GRAPH. Surprisingly, it
turns out that the lexicographic sequence of LYNDON WORDS of lengths
|The following is a slightly more general version of de Bruijn's theorem: "Suppose |
that an X x Y rectangle (where X and Y are real numbers) is exactly filled with
rectangular tiles, where the tiles may have different sizes, but each tile has at
|His work on combinatorics yielded influential notions and theorems of which we |
mention the de Bruijn-sequences of 1946 and the de Bruijn-Erdos theorem of
1948. De Bruijn's contributions to mathematics also included his work on ...
|26. De. Bruijn–Erd ̋os's. Theorem. and. Its. History. 26.1. De. Bruijn–Erd ̋os's. |
Compactness. Theorem5. They were both young. On August 4, 1947 the 34-year-
old Paul Erd ̋os, in a letter to the 29-year-old Nicolaas Govert de Bruijn of Delft,
|It is easily verified that by taking each H , to be the identity group, and each ^,(w) |
to be x", we arrive at P6lya's theorem as a special case of De Bruijn's theorem.
The sum of the weights is just the configuration-counting series. As an example of
|Solomon W. Golomb used this exact coloring argument to give a proof of de |
Bruijn's Theorem: the only time you can cover an m × n chessboard with pieces of
size 1 × k is in the simple situation when k divides either m or n . The proof
|The diamond property of walks in the de Bruijn representation. 3. The Church-|
Rosser theorem (de Bruijn). 4. Proving that a reduction is the transitive closure of
a walk. 5. Correspondence between the de Bruijn and standard notations.
|In the 1950s, in his PhD thesis  (see also , ), Ronald C. Read |
introduced his 'superposition theorem', which ... Researchers involved included
Herbert Foulkes, N. G. de Bruijn, John Sheehan, and Frank Harary and his co-