(redirected from combinatorics)
Also found in: Dictionary, Thesaurus, Encyclopedia, Wikipedia.


Describes any system using a random assortment of components at any positions in the linear arrangement of atoms; that is, a combinatorial library of mutations could contain positions where all four bases have been randomly inserted.
Farlex Partner Medical Dictionary © Farlex 2012
References in periodicals archive ?
If [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] have the same combinatorics, then any homeomorphism h : ([T.sup.1], [D.sub.o] + [D.sup.1]) [right arrow] ([T.sup.2], [D.sub.o] + [D.sup.2]) with h([D.sub.o]) = [D.sub.o] induces a map [h.sub.[sharp]] : []([D.sub.o], [D.sup.1]) [right arrow] []([D.sub.o], [D.sup.2]), where [T.sup.i] is a tubular neighborhood of [D.sub.o] + [D.sup.i] for i = 1,2.
In the following section we briefly present the renormalization group flow equation and show that equations of such type have already been successfully used in combinatorics. The third section defines matroids, as well the Tutte polynomial for matroids and the matroid Hopf algebra defined in Schmitt (1994).
Offering much more than recreation, though, combinatorics has computer science and optimization applications.
VALLEE, An average-case analysis of the Gaussian algorithm for lattice reduction, Combinatorics, Probability and Computing, 6, (1997), 397-433.
Key words: combinatorics, technical creativity, morphology, history of technical sciences.
However, other sequences are sometimes encountered, especially in combinatorics and number theory, which have application to several areas of computer science, and which often have an intriguing physical analogy.
Some of the most fundamental, surely, are that thinking is a computational process, that computational processes involve combining symbols, that computation can be made mechanical, and that the mathematics of computation involves combinatorics. All of these ideas have their origin, so far as we know, in the work of an eccentric 13th century Spanish genius, Ramon Lull (1232-1316).
His research interests include algorithm design, combinatorics, operations research and parallel computation.
The activities cover numbers as geometric shapes, combinatorics, Fibonacci numbers, Pascal's triangle, area, and selected warmup and challenging problems.
Reporting on research at the University of Bayreuth into constructive combinatorics based on the use of finite groups actions, the book describes, extends, and applies methods of computer chemistry and chemoinformatics that can be used in generating molecular structure, elucidating structure, combinatorial chemistry, quantitative structure-property relations (QSPR), generating chemical patent libraries, and other applications.