MSC
MSC
On
2 year M.Sc. (Mathematics)
&
M.Sc. (Mathematics & Computing) Programs
Department of Mathematics
Indian Institute of Technology Hyderabad
Yeddumailaram 502205, Andhra Pradesh, INDIA
Semester II
Semester
IV
Semester III
Analysis of
Functions of
3
Several Variables
Advanced
Course-I
Elements of
Groups and
Rings
Functional
Analysis
Advanced
Course-II
Measure
and
Integration
Partial Differential
3
Eqns
Elective III 3
Probability
Theory
Combinatori
cs and
Graph
Theory
Elective II
Elective
IV
Basics of
Programming
Elective I
Thesis I
Thesis II
Total
15
Linear Algebra
Ordinary
Differential
Eqns
4 Core + 1 Lab
Complex
Analysis
15
4 Core + 1
Elec
18
3 Core + 1 Elec +
1 Thesis
18
2 Core +
2 Elec + 1
Thesis
Polynomial,
Cayley-Hamilton
References:
Sheldon Axler, Linear Algebra Done Right, University Press, 2010.
K. Hoffman and R. Kunze, Linear Algebra, PHI Learning, Second Edition,
2009.
Gilbert strang, Linear algebra and its applications, Thomson Brooks/Cole,
Fourth Edition 2006.
Friedberg H. Stephen, Insel J. Arnold, Spence E. Lawrence, Linear Algebra
PHI Learning, Fourth Edition 2009.
A.R. Shastri, Basic Complex Analysis of one variable, Mc Millan, New Delhi,
2011.
MA 4070: Elements of Groups and Rings
Binary operation and its properties, Definition of Groups, Examples and basic
properties. Subgroups, Coset of a subgroup, Lagranges theorem. Cyclic groups.
Normal subgroups, Quotient group. Homomorphisms, Isomorphism theorems.
Permutation groups, Cayleys theorems. Direct and semidirect product of groups.
Group actions and Sylow theorems.
Definition of Rings, Examples and basic properties, Zero divisors, Integral domains,
Fields, Characteristic of a ring, Quotient field of an integral domain. Subrings, Ideals,
Quotient rings, Isomorphism theorems. Ring of polynomials. Prime, Irreducible
elements and their properties, Unique Factorization Domains, Principal Ideal
Domains, and Euclidean domains. Prime ideal, Maximal ideal, Prime avoidance
theorem, Chinese remainder theorem.
References:
D. S. Dummit and R. M. Foote, Abstract Algebra, John Wiley & Sons Inc,
3rd Edition. 2004.
I. N. Herstein, Topics in Algebra, Wiley India Pvt Ltd, 2nd Edition, 2006.
Artin, M., Algebra, Prentice Hall of India, 1994.
Jacobson, N., Basic Algebra I, Hindustan Publishing Corporation, 2nd
Edition, 1991.
W. Rudin, Real and complex analysis. Third edition. McGraw-Hill Book Co.,
New York, 1987.
K. R. Parthasarathy, Introduction to Probability and Measure, TRIM Series,
Vol .33, Hindustan book agency, New Delhi, 2005.
Krishna B.Athreya and S. Lahiri, Measure theory and probability theory.
Springer Texts in Statistics, Springer Verlag, 2006.
Prerequisite: MA 4010
Functions of several-variables, Directional derivative, Partial derivative, Total
derivative, Jacobian, Chain rule and Mean-value theorems, Interchange of the order
of differentiation, Higher derivatives, Taylor's theorem, Inverse mapping theorem,
Implicit function theorem, Extremum problems, Extremum problems with constraints,
Lagrange's multiplier method.
Multiple integrals, Properties of integrals, Existence of integrals, iterated integrals,
change of variables. Curl, Gradient, div, Laplacian cylindrical and spherical
coordinate, line integrals, surface integrals, Theorem of Green, Gauss and Stokes.
References:
Apostol T.M., Mathematical Analysis; Narosa Book Distributors Pvt Ltd, 2000 .
Jerrold E. Marsden, Anthony Tromba, Alan Weinstein, Basic multivariable
analysis, Springer Verlag 1993.
Ghorpade, Sudhir R.; Limaye, Balmohan V. A course in multivariable calculus
and analysis.Undergraduate Texts in Mathematics. Springer, New York,
Springer International Edition, New Delhi, 2010.
Fleming,
Wendell
Functions
of
several
variables.
Second
edition.
References:
B.V. Limaye, Functional Analysis, Second edition, New Age International,
New Delhi, 1996.
J. B. Conway, A Course in Functional Analysis, Second edition, Graduate
Texts in Mathematics, Vol. 96, Springer, 1990.
E. Kreyszig, Introductory Functional Analysis with Applications. John Wiley &
Sons, 1978.
P. D. Lax, Functional Analysis. Wiley-Interscience, 2002.
B. Bollabas, Linear Analysis,
Mathematical Textbooks, 1990.
An
Introductory
Course.
Cambridge
List of Electives
MA 5040: Topology
Definition of Topologies in terms of open sets, neighborhood system, closed sets
and closure operations and their equivalence, points of accumulation, interior,
exterior and boundary points.
Base and subbase of a topology, subspace, product space, quotient space,
continuous, open and closed maps, homeomorphism convergence of sequence and
nets.
Separation axioms, Urysohns Lemma, Tietze extension theorem, separability.
Compactness, local compactness, sequential and countable
Tychonoffs theorem, Lindelof space. One point compactification
compactness,
References:
References:
Bhatia, Rajendra. Fourier series. Texts and Readings in Mathematics.
Hindustan Book Agency, New Delhi, 1993.
Chandrasekharan, Komaravolu. Classical Fourier transforms. Universitext.
Springer-Verlag, Berlin, 1989.
Katznelson, Yitzhak. An introduction to harmonic analysis. Third edition.
Cambridge Mathematical Library. Cambridge University Press, Cambridge,
2004.
Stein, Elias M.; Shakarchi, Rami. Fourier analysis. An introduction. Princeton
Lectures in Analysis, 1. Princeton University Press, Princeton, NJ, 2003.
MA 5120: Numerical Linear Algebra
Prerequisites: MA 4020
Gaussian elimination and its variants. Sensitivity of system of linear systems.
QR factorization and The least squares. The singular value decomposition.
Computing Eigenvalues and Eigenvectors. Iterative methods for linear systems.
References:
lloyd N. Trefethen, David Bau III, "Numerical Linear algebra", SIAM, 1997.
Gene H. Golub, Charles F. Van Loan, "Matrix computations", Hindustan Book
Agency, 3rd edition, 2007.
Alston S. Householder, The theory of matrices in Numerical Analysis", Dover
1964.
J. W. Demmel, "Numerical Linear Algebra", SIAM, 1996.
MA 5130: Theory of Computation
Regular Languages: Finite Automata, Non-determinism, Regular Expressions,
Nonregular Languages.
Context-Free Languages: Context-free Grammars, Pushdown Automata, Noncontext-free Languages
The Church-Turing Thesis: Turing Machines and Variants.
Decidability: Decidable Languages, The Halting Problem.
Reducibility: Undecidable Problems, Example, Mapping Reducibility
Time Complexity: Measuring Complexity, The classes of P and NP.
References:
Michael Sipser, Theory of Computation, Cengage Learning, 2007.
J. E. Hopcroft, R. Motwani, J. D. Ullman, Introduction to Automata Theory,
Languages, and Computation, Addison Wesley, 2000.
P.Linz, Introduction To Formal Languages And Automata, Narosa Pub. 1997.
Gyorgy E Revesz, Introduction To Formal Languages, Mcgraw-Hill Book Co.,
1985.