Category:Discrete mathematics

A

• [+] Automata theory (1 C, 32 P)

C

• [+] Coding theory (4 C, 85 P)
• [+] Combinatorics (19 C, 146 P)

D

• [+] Discrete geometry (3 C, 64 P)

F

• [+] Factorial and binomial topics (2 C, 79 P)
• [+] Finite differences (21 P)
• [+] Finite geometry (4 P)

G

• [+] Graph theory (20 C, 139 P)

N

• [+] Number theory (20 C, 237 P)

P

• [+] Permutations (3 C, 64 P)

S

• [+] Symmetric functions (33 P)

• Outline of discrete mathematics

*

• Discrete mathematics
• Portal:Discrete mathematics

A

• Abacus logic
• Algorithm
• André plane
• Appell sequence
• Asynchronous logic (algebra)
• Attribute domain

C

• Characteristic sequence
• Collaboration graph
• Combinational logic
• Combinatorics
• Covering code

D

• DIMACS
• Damerau–Levenshtein distance
• Decision mathematics

D cont.

• Decision theory
• Desarguesian plane
• Digital geometry
• Discrete Laplace operator
• Discrete Mathematics (journal)
• Dual graph

F

• Faulhaber's formula
• Finite set
• Finite topological space
• First-order logic

G

• Graph (mathematics)

H

• Hamming distance

I

• Indicator function
• Information theory

K

• Kendall tau distance

L

• Lee distance
• Levenshtein distance

L cont.

• Levenshtein automaton

M

• McCarthy 91 function
• Moufang plane

N

• Non-Desarguesian plane
• Nondeterministic algorithm
• Number theory

P

• Partial equivalence relation
• Plane partition
• Pooling design
• Power graph analysis

R

• Relational model

S

• Sequential logic
• Sparse ruler
• Summation by parts

Z

• Z-transform