Dr. Szendrei's research interests include the structure theory of finite algebras, commutator theory, classification results using clone theory, and applications of these techniques and results to problems in computer science.
MATH 3140 - Abstract Algebra 1
Primary Instructor
-
Spring 2021
Studies basic properties of algebraic structures with a heavy emphasis on groups. Other topics, time permitting, may include rings and fields.
MATH 3170 - Combinatorics 1
Primary Instructor
-
Fall 2018 / Fall 2019 / Fall 2020
Covers basic methods and results in combinatorial theory. Includes enumeration methods, elementary properties of functions and relations, and graph theory. Emphasizes applications.
MATH 3210 - Euclidean and Non-Euclidean Geometry
Primary Instructor
-
Spring 2020
Axiomatic systems; Euclid's presentation of the elements of geometry; Hilbert's axioms; neutral, Euclidean and non-Euclidean geometries and their models.
MATH 4000 - Foundations of Mathematics
Primary Instructor
-
Fall 2018
Focuses on a complete deductive framework for mathematics and applies it to various areas. Presents Goedel's famous incompleteness theorem about the inherent limitations of mathematical systems. Uses idealized computers to investigate the capabilities and limitations of human and machine computation. Same as MATH 5000.
MATH 5000 - Foundations of Mathematics
Primary Instructor
-
Fall 2018
Focuses on a complete deductive framework for mathematics and applies it to various areas. Presents Goedel's famous incompleteness theorem about the inherent limitations of mathematical systems. Uses idealized computers to investigate the capabilities and limitations of human and machine computation. Department enforced prerequisites: MATH 2130 and MATH 3140. Same as MATH 4000.
MATH 6130 - Algebra 1
Primary Instructor
-
Fall 2019
Studies group theory and ring theory. Department enforced prerequisite: MATH 3140. Instructor consent required for undergraduates.
MATH 6730 - Set Theory
Primary Instructor
-
Spring 2019 / Spring 2021
Presents cardinal and ordinal arithmetic, and basic combinatorial concepts, including stationary sets, generalization of Ramsey's theorem, and ultrafilters, consisting of the axiom of choice and the generalized continuum hypothesis. Department enforced prerequisites: MATH 4000 or MATH 5000 and MATH 4730 or MATH 5730. Instructor consent required for undergraduates.