06.09.2021 Views

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Index 203<br />

sequence<br />

degree, 50<br />

series<br />

arithmetic, 40<br />

geometric, 40, 79<br />

set<br />

colorings of action of a group<br />

on, 116<br />

sets<br />

disjoint, 4<br />

mutually disjoint, 4<br />

simple graph, 165<br />

space of polynomials, 61<br />

spanning tree, 45<br />

cost of, 46<br />

minimum cost, 46<br />

species, 158<br />

exponential generating function<br />

for, 159<br />

standard notation for a coloring, 117<br />

Stirling Number<br />

first kind, 62<br />

second kind, 58, 97<br />

Stirling’s formula for n!, 19<br />

Stirling’s triangle<br />

first kind, 62<br />

second kind, 58<br />

strong double induction, 35<br />

strong principle of mathematical<br />

induction, 32<br />

structure, 158<br />

pair, 159<br />

using a set, 158<br />

subgroup, 111<br />

sum principle, 5, 6, 93<br />

for multisets, 121<br />

surjection, 10, 134<br />

surjections<br />

number of, 97<br />

symmetric, 140<br />

symmetric group, 106<br />

transitive, 140<br />

tree, 43<br />

spanning, 45<br />

cost of, 46<br />

minimum cost, 46<br />

Twentyfold Way, 52<br />

two row notation, 107<br />

type vector for a partition of an<br />

integer, 64<br />

type vector of a partition of a set, 59<br />

union of multisets, 121<br />

uses<br />

a structure using a set, 158<br />

vertex, 26, 41, 135<br />

degree of, 42<br />

of a complete graph, 26, 135<br />

walk, 43<br />

Young diagram, 64

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!