University of North Carolina at Greensboro · Courses
MAT
131 courses with the subject MAT, each shown exactly as we captured it from the college's catalog, with every element we hold. Where the wording looks broken, that is our reading of the catalog, not the college's text.
MAT 105Exploring Mathematics 3
Introduction to modern mathematics through accessible tours of various topics, how they impact the real world, and how they are applied in a wide range of career paths. Example topics include fractals, data visualization, knot theory, and network science. Utilizing campus resources will also be covered.
Introductory topics in mathematics, including set theory and reasoning in mathematical systems. Contemporary applications may include algorithms, consumer mathematics, cryptography, and geometry.
Algebraic expressions, exponents, radicals, factoring, solving equations and inequalities, graphing, polynomial and rational functions. Designed to prepare students for MAT 190.
Introductory survey of differential calculus with emphasis on techniques and applications related to business and the social sciences. This course does not serve as a prerequisite for MAT 292 (Calculus II). This is a terminal course and not adequate preparation for MAT 292.
Elementary mathematics topics with emphasis on applications in biology, including quantities and units, algebraic operations, linear equations, nonlinear equations, simultaneous equations, graphs and functions, basic trigonometry.
This course covers essential prerequisites for calculus. Topics include functions and graphs, equations and inequalities, polynomial and rational functions, trigonometry, functions of trigonometric, exponential, and logarithmic type.
A rigorous introduction to discrete mathematical structures, proof techniques, and programming. Topics include sets, functions, sequences, relations, induction, propositional and predicate logic, modular arithmetic, and mathematical programming.
Integral calculus of algebraic and transcendental functions of one variable, techniques of integration, applications of integration, infinite sequences and series, conic sections, and calculus in polar coordinates.
Axiomatic systems, logic and proof, incidence geometries, absolute geometries, Euclidean geometry, and an introduction to non-Euclidean geometries and transformational geometry.
First order differential equations and linear equations of finite order, Laplace transforms, undetermined coefficients, variation of parameters, applications, numerical methods.
Supervised pre-approved work experience in which students apply mathematics and statistics to solve real world problems. Students discuss progress and experiences with peers in regular meetings with the instructor.
Subject
MAT
Type
course
Repeatable
May be repeated for up to a total of six (6) credits.
MAT 405Foundations of Mathematics for Teaching I 3
Capstone survey of topics including functions; calculus concepts; geometry; probability; data analysis; and discrete mathematics. Special teaching problems and procedures for secondary education topics in relation to their mathematical foundations.
MAT 406Foundations of Mathematics for Teaching II 4
Capstone survey of topics including functions; calculus concepts; geometry; probability; data analysis; and discrete mathematics. Special teaching problems and procedures for secondary education topics related to their mathematical foundations, including 50-hour internship in secondary math classroom.
An introductory course to both multiplicative and additive number theory. Divisibility, prime numbers, congruencies, linear and nonlinear Diophantine equations (including Pell's equation), quadratic residues, number-theoretic functions, and other topics.
Formal languages, recursion, compactness, and effectiveness. First-order languages, truth, and models. Soundness and completeness theorems. Models of theories.
Rings, integral domains, fields, division algorithm, factorization theorems, zeros of polynomials, greatest common divisor, formal derivatives, prime polynomials, Euclidean domains, the fundamental theorem of algebra.
Elementary properties of groups and homomorphisms, quotients and products of groups, the Sylow theorems, structure theory for finitely generated abelian groups.
Transformation groups and projective, affine and metric geometries of the line, plane, and space. Homogeneous coordinates, principles of duality, involutions, cross-ratio, collineations, fixed points, conics, models, and Euclidean specializations.
Number systems and errors, solutions of non-linear and linear systems, interpolation, numerical differentiation and integration, solution of differential equations. Implementation of numerical methods using a high-level programming language.
This course is an introduction to linear programming and optimization including: the simplex method, degeneracy, efficiency, duality theory, convex analysis, game theory, financial applications, network flow problems, integer programming, quadratic programming.
Exact computations with mathematical structures. Topics include complexity analysis, multi precision arithmetic, matrix normal forms, graphs and networks, and fast Fourier transforms.
This course covers persistent homology and topological data analysis. Topics include persistence modules, bar codes, stability, and the use of statistics and machine learning in topological data analysis.
This course is for students to build up a solid mathematical foundation in order to thrive in the rapidly growing field of data science. Students will learn essential mathematical topics in data science, including linear algebra, matrix decomposition, probability, stochastic process, analysis, optimization, geometry, and algebraic topology.
Selected well-known machine learning algorithms will be studied in great mathematical detail in order for students to understand the mathematics behind them. General topics may include Regression, Dimension Reduction, Density Estimations, and Classification. Advanced topics may include Google PageRank algorithm, Manifold Learning, and the Mapper algorithm.
MAT 465Student Teaching and Seminar-Secondary Mathematics 12
Supervised student teaching in senior high school under direction of university supervisor. Observation, participation, and appropriate classroom teaching experience on full-time teaching assignment for full semester with weekly seminar.
Measurement of interest, present and accumulated value, amortization, sinking funds, bonds, duration, immunization, and an introductory analysis of financial derivatives. Intended to help prepare for the FM/2 actuarial exam.
Investigates the nature of problem solving, covers procedures involved in problem solving, develops individual problem solving skills, and collects a set of appropriate problems. Required for middle grades mathematics concentration.
Primarily for students seeking teacher certification. Includes logic and axiom systems, history, plane and solid Euclidean geometry, proof strategies, introduction to non-Euclidean geometries, and transformational geometry.
MAT 505Foundations of Mathematics for Teaching I 3
Capstone survey of topics including functions, calculus concepts, geometry, probability, data analysis, and discrete mathematics. Special teaching problems and procedures for secondary education topics related to their mathematical foundations.
MAT 506Foundations of Mathematics for Teaching II 3
Capstone survey course of mathematics topics including functions, calculus concepts, geometry, probability, data analysis, and discrete mathematics. Includes special teaching problems and procedures for secondary education topics related to their mathematical foundations.
Introduction to software and utilities for students in computational mathematics. Students implement algorithms, use software to compute mathematical objects, organize large computational tasks, and select the appropriate software to perform a given task.
Practicum in teaching mathematics at the college/university level. Topics include course design, class materials, exams, grading, syllabus, choosing textbooks, dealing with difficult matters, and mathematical typesetting.
An introductory course to both multiplicative and additive number theory. Divisibility, prime numbers, congruencies, linear and nonlinear Diophantine equations (including Pell's equation), quadratic residues, number-theoretic functions, and other topics.
Rings, integral domains, fields, division algorithm, factorization theorems, zeros of polynomials, greatest common divisor, formal derivatives, prime polynomials, Euclidean domains, the fundamental theorem of algebra.
Elementary properties of groups and homomorphisms, quotients and products of groups, the Sylow theorems, structure theory for finitely generated abelian groups.
Transformation groups and projective, affine and metric geometries of the line, plane, and space. Homogeneous coordinates, principles of duality, involutions, cross-ratio, collineations, fixed points, conics, models, and Euclidean specializations.
Number systems and errors, solutions of non-linear and linear systems, interpolation, numerical differentiation and integration, solution of differential equations. Implementation of numerical methods using a high-level programming language.
This course is an introduction to linear programming and optimization including: simplex method, degeneracy, efficiency, duality theory, convex analysis, game theory, financial applications, network flow problems, integer programming, and quadratic programming.
Exact computations with mathematical structures. Topics include complexity analysis, multi precision arithmetic, matrix normal forms, graphs and networks, and fast Fourier transforms.
The first half of a year long sequence in Stochastic Processes. Markov processes, Markov reward processes, queuing, decision making, graphs, and networks. Applications to performance, reliability, and availability modeling.
The second half of a year long sequence in Stochastic Processes. Markov processes, Markov reward processes, queuing, decision making, graphs, and networks. Applications to performance, reliability, and availability modeling.
This course covers persistent homology and topological data analysis. Topics include persistence modules, bar codes, stability, and the use of statistics and machine learning in topological data analysis.
This course is for students to build up a solid mathematical foundation in order to thrive in the rapidly growing field of data science. Students will learn essential mathematical topics in data science, including linear algebra, matrix decomposition, probability, stochastic process, analysis, optimization, geometry, and algebraic topology.
Based on the specialty of the instructor, selected well-known machine learning algorithms will be studied in great mathematical detail. General topics may include Regression, Dimension Reduction, Density Estimations, and Classification. Advanced topics may include Google PageRank algorithm, Manifold Learning, and the Mapper algorithm.
Topics vary according to interest and demand, and include algebra, applied mathematics, combinatorics, dynamics, mathematical logic, topology, and other topics.
Measurement of interest, present and accumulated value, amortization, sinking funds, bonds, duration, immunization, and an introductory analysis of financial derivatives. Intended to help prepare for the FM/2 actuarial exam.
The first half of a year-long sequence in algebra. Topics include quotients and products of groups, the Sylow theorems, and structure theory for finitely generated abelian groups, representations of groups, and the basic theory of rings.
The second half of a year-long sequence in algebra. Topics include integral domains, ideals, factorization, polynomial rings, quotient rings, finite fields, field extensions, and Galois theory.
Mathematics of cryptography with emphasis on public key systems. Applications of elliptic and hyperelliptic curves and lattice theory in attacking and evaluating the security of cryptographic systems.
Functional analytic treatment of computation, approximation, optimization, interpolation, smoothing equations, linear systems, differential equations. Emphasis on the mathematical development and analysis of numerical techniques.
Introduce the fundamental concepts of the finite element method for approximating solutions to boundary and initial boundary value problems. Topics include modeling, mathematical formulations, convergence analysis, and computer implementation.
An introduction to vector spaces over general fields. Topics include linear transformations, dual spaces, inner product spaces, orthogonality, spectral theory, and Jordan normal form.
An introduction to numerical linear algebra. Topics include conditioning and stability, matrix factorizations, eigenvalue solvers, least-squares problems, and iterative methods as well as the implementation of various computational methods using a high-level programming language.
Existence and uniqueness theorems for initial value problems, theory of linear equations, nonlinear equations, stability theory, boundary value problems.
Derivation of partial differential equations (PDE) models and applications, linear first order PDE's, elliptic equations and Green's function, PDE's of parabolic and hyperbolic type.
Topological spaces, point set topology, product and quotient spaces, embedding and metrization, uniform spaces, function spaces, homotopy theory, simplicial complexes and homology, more algebraic topology, general homology theories.
The first half of a year-long sequence in algebra. Topics include basic group and ring theory: quotients and products of groups, group actions, the Sylow theorems, structure theory for finitely generated abelian groups, domains, ideals, factorization, and polynomial rings.
The second half of a year-long sequence in algebra. Topics include basic module and field theory: quotient modules, tensor products, exact sequences, structure theory for finitely generated modules over a PID, extension of scalars, finite fields, algebraic field extensions, and Galois theory.
A constructive introduction to algebraic number theory. Topics include algebraic number fields, integral bases, ideal factorization, system of fundamental units, and the class group.
Lebesque measure; the Lebesque integral; differentiation and integration, the classical Banach spaces; metric spaces, topological spaces, compact spaces; Banach spaces, measure and integration, measure and outer measure; the Daniell integral; mappings of measure spaces.
An introduction to basic subjects in computational algebra. Topics include fast arithmetic, algorithms for finite fields, matrix normal forms over rings, polynomial factorization, and lattice basis reduction.
This course covers the underlying mathematical theory behind common machine learning methods: support vector machines, kernel methods, decision trees, nearest neighbor, clustering, stochastic gradient descent, and neural networks.
This is an advanced course in topological data analysis. After covering persistent homology, bar codes, and stability, the course will move into research level topics drawn from recent papers.
Individual work on a dissertation research problem, which could also include original research or a review of current literature leading to a dissertation proposal.