Combinatorial designs and finite group theory form a rich intersection of discrete mathematics and algebra, where structured arrangements of elements are studied alongside the algebraic properties of ...

If f is a nonzero complex-valued function defined on a finite abelian group A and f̂ is its Fourier transform, then |supp(f)|| supp(f̂)| ≥ |A|, where supp(f) and supp(f̂) are the supports of f and f̂.

Group theory - basic properties, permutation groups, finite Abelian groups, cosets, normal subgroups, homomorphism theorems, representation. Ring theory - integral domains and fields, ideals, ...