释义 |
combinatorics, n. pl. (const. as sing.) Math.|ˌkɒmbɪnəˈtɒrɪks| [f. combinatorial a., after G. Kombinatorik: see -ic 2.] The branch of mathematics dealing with combinations of objects belonging to a finite set in accordance with certain constraints, such as those of graph theory; combinatorial analysis.
[1902Science 19 Sept. 469/2 In combinatorial analysis (combinatoric) the German school was contented with the deduction of rules for the writing down of all the combinations and permutations that are possible under given restrictions.] 1941Bull. Calcutta Math. Soc. XXXII. 65 (heading) On a method of finite combinatorics which applies to the theory of infinite groups. 1953Ann. Math. Statistics XXIV. 377 (heading) On some theorems in combinatorics relating to incomplete block designs. 1961Math. Gaz. XLV. 199 (heading) Some problems in combinatorics. 1973Sci. Amer. Apr. 113/1 As a little puzzle in combinatorics, can the reader determine the largest multiplicand one set of Napier's bones will form such that all smaller multiplicands can also be formed by the set? 1981Times 5 Sept. 3/1 Solving the puzzle [sc. Rubik's cube] introduced three-dimensional geometry, general mathematical thought, group theory, combinatorics, and, if it was pulled apart, an introduction to a very clever piece of engineering. |