Applied combinatorial mathematics |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
INTRODUCTION | 1 |
TECHNIQUES FOR SIMPLIFYING LOGICAL | 32 |
PART IB COUNTING AND ENUMERATION | 65 |
Copyright | |
17 other sections not shown
Other editions - View all
Common terms and phrases
algebra amino acids application assigned atoms barycentric coordinates block design bonds boundary Brouwer fixed-point theorem Chapter circuit coefficient column combinatorial complete computational configurations consider coordinates corresponding crystal cycle index defined denote determined diffraction digraphs dimer directed dynamic programming electrons elements enumeration equal equations equivalent example factors finite flip-flop function given go to step graphs Hadamard matrix Hence input integers labeled Latin squares lattice points linear mapping Math mathematical matrix method minimal molecule n-sequence n-simplex nodes nonnegative number of patterns objects obtained operation optimal oriented orthogonal pair parameters partition permutation group Pfaffian phase Polya's polygon polynomial positive possible probability proof protein quantum relation result schema sequence simplex solution Sperner's lemma Steiner triple system stopping-rule problem structure subdivision subset symmetry Table theorem theory total number trajectory unit cell variables vector vertex vertices