¶¡ÏãÔ°AV

A survey of graduate group and/or ring theory. Possible topics include generators and relations, composition series, Sylow theory, permutation groups, abelian groups, p-groups, nilpotent and solvable groups, aspects of simple groups, representation theory, group algebras, chain conditions, Jacobson radical, Chevalley-Jacobson density theorem, Wedderburn-Artin theorems.

An introduction to algebraic geometry with supporting commutative algebra. Possible topics include Hilbert basis theorem, Hilbert's Nullstellensatz, Groebner bases, ideal decomposition, local rings, dimension, tangent and cotangent spaces, differentials, varieties, morphisms, rational maps, non-singularity, intersections in projective space, cohomology theory, curves, surfaces, homological algebra.

Algebraic graph theory, extremal graph theory, coloring problems, path and cycle structure of graphs, application of graphs, hypergraphs, and current research topics.

An introduction to the theory of incidence structures (finite geometries, block designs) and their relation to linear codes. Algebraic techniques - finite group actions, orbit enumeration, generation of orbit representatives. Exact and asymptotic enumeration of labelled and unlabelled structures.

Review of Galois theory, integrality, rings of integers, traces, norms, discriminants, ideals, Dedekind domains, class groups, unit groups, Minkowski theory, ramification, cyclotomic fields, valuations, completions, applications.

Arithmetical functions, distribution of prime numbers, theory of Dirichlet characters, Dirichlet series, theory of Riemann Zeta functions and Dirichlet L-functions, exponential sums, character sums, Diophantine equations, Diophantine approximations, applications.

An introduction to the subject of modern cryptography. Classical methods for cryptography and how to break them, the data encryption standard (DES), the advanced encryption standard (AES), differential and linear cryptanalysis. RSA and EIGamal public key cryptosystems, digital signatures, secure hash functions and pseudo-random number generation. Algorithms for computing with long integers including the use of probabilistic algorithms. Elliptic curve cryptography. Post-quantum cryptography. Students with credit for either MACM 442 or MATH 742 may not take this course for further credit.

Computing with long integers, polynomials, and mathematical formulae. Topics include computing polynomial greatest common divisors, the Fast Fourier Transform, Hensel's Lemma and p-adic methods, differentiation and simplification of formulae, polynomial factorization. Integration of rational functions and elementary functions, Liouville's principle, the Risch algorithm. Students will use a computer algebra system such as Maple for calculations and programming. Students who have credit for either MACM 401 or MATH 701 may not take this course for further credit.

Convex geometry, the simplex method and duality, pivot rules, degeneracy, decomposition and column generation methods, the complexity of linear programming and the ellipsoid algorithm, interior point methods for linear programming.

Theory and algorithms of non-linear programming with an emphasis on modern computational considerations. Topics may include: optimality conditions for unconstrained and constrained optimization, gradient methods, conjugate direction methods, Newton method, quasi-Newton methods, penalty and barrier methods, augmented Langrangian methods and interior point methods.

An intensive study of Lebesque measure, integration and the Lebesque convergence theorems together with the treatment of such topics as absolute continuity, the fundamental theorem of calculus, the Lp-spaces, comparison of types of convergence in function spaces, the Baire category theorem.

Infinite dimensional vector spaces, convergence, generalized Fourier series. Operator Theory; the Fredholm alternative. Application to integral equations and Sturm-Liouville systems. Spectral theory.

A project leading to research in mathematics completed under the supervision of a faculty member. The project will consist of a written report and a public presentation. This course can only be used for credit towards the MSc project course option.

Theory and algorithms of non-linear programming with an emphasis on modern computational considerations. Topics may include: optimality conditions for unconstrained and constrained optimization, gradient methods, conjugate direction methods, Newton method, quasi-Newton methods, penalty and barrier methods, augmented Langrangian methods and interior point methods.

Held jointly with MATH 408-3. See description for MATH 408-3. Students may not take a 700 division course if it is being offered in conjunction with a 400 division course which they have taken previously.

Convex geometry, the simplex method and duality, pivot rules, degeneracy, decomposition and column generation methods, the complexity of linear programming and the ellipsoid algorithm, interior point methods for linear programming.