pairwise-independent classes
21Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… …
22Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list …
23Structural Classification of Proteins — The Structural Classification of Proteins (SCOP) database is a largely manual classification of protein structural domains based on similarities of their amino acid sequences and three dimensional structures. Originally published in 1995cite… …
24Tetrahedron — For the academic journal, see Tetrahedron (journal). Regular Tetrahedron (Click here for rotating model) Type Platonic solid Elements F = 4, E = 6 V = 4 (χ = 2) Faces by s …
25Preference — (also called taste or penchant ) is a concept, used in the social sciences, particularly economics. It assumes a real or imagined choice between alternatives and the possibility of rank ordering of these alternatives, based on happiness,… …
26Packing problem — Part of a series on Puzzles …
27List of mathematical examples — This page will attempt to list examples in mathematics. To qualify for inclusion, an article should be about a mathematical object with a fair amount of concreteness. Usually a definition of an abstract concept, a theorem, or a proof would not be …
28Dowling geometry — In combinatorial mathematics, a Dowling geometry, named after Thomas A. Dowling, is a matroid associated with a group. There is a Dowling geometry of each rank for each group. If the rank is at least 3, the Dowling geometry uniquely determines… …
29Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… …
