Discrete Mathematical Structures by Pearson

List of Symbols L-3

a +

m

b Addition of integers a and b modulo m

a ×

p

b Multiplication of integers a and b modulo p

a ≡ b (mod m) Integer a is congruent modulo m to integer b

α

β

i

i













a

i

and b

i

are permutation of n distinct symbol

(R, +, ·) R is a ring under binary operation of (+) and (·)

(F, +, ·) F is a field under binary operation of (+) and (·)

GLB Greatest lower bound

LUB Least upper bound

Poset Partially ordered set

(L, ∧,∨) lattice under operations

∧ and ∨

x ∨y

x

y

OR gate (x + y)

x

∧

y

x

y

AND gate (x.y)

x

~

x

NOT gate (x′)

G(V,

E ) G is a graph with set of vertices V and edges E

d(v) Degree of vertex v

indeg(v) Indegree of vertex v

outdeg(v) Outdegree of vertex ...