A
B
C
D
E
F
G
H
I
K
L
M
N
O
- Ordered partition of a set
- Orthogonal design
- Complex orthogonal design
- Quaternion orthogonal design
P
Q
- q-analog
- q-binomial theorem—see Gaussian binomial coefficient
- q-derivative
- q-series
- q-theta function
- q-Vandermonde identity
R
S
- Schröder number
- Search algorithm
- Sequences with zero autocorrelation function
- Series-parallel networks problem
- Set cover problem
- Shuffling puzzle
- Small set (combinatorics)
- Sparse matrix, Sparse array
- Sperner family
- Sperner's lemma
- Stable marriage problem
- Steiner system
- Stirling number
- String algorithm
- Straddling checkerboard
- Subsequence
- Subset sum problem
- Symmetric functions
- Szemerédi's theorem
T
U
- Union-closed sets conjecture
- Urn problems (probability)
V
W
Y
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.