Special Degree – Mathematics

Hourly Breakdown

• Introduce the elements of commutative algebra through a study of commutative rings and modules over such rings

• Prove factorization of homomorphisms, Correspondence theorem, the classical isomorphism theorems and their consequences
• Define certain special types of ideals
• Discuss various aspects of certain special types of ideals, by means of proofs and examples
• Prove module isomorphism theorems and other results related to submodules, quotient modules, direct sum and direct product of modules
• Prove certain results related to finitely generated modules, notably Nakayama’s lemma.
• Recall various results regarding exact sequences
• Define Unique Factorization Domains (U.F.D), Principal Ideal Domains(P.I.D) and Euclidean Domains (E.D)
•  Discuss various results regarding U.F.D, P.I.D and E.D, by  means of proofs and examples
• Explain the processes of constructing the rings and modules of fractions
•  Prove certain results related to primary decomposition, notably 1^st and 2^nd uniqueness theorems
• ·Prove certain theorems regarding Noetherian and Artinian modules
•  Discuss various results regarding Noetherian and Artin rings, in particular the Hilbert basis theorem

• Lectures,  Tutorials,  Problem solving, Use of e-resources and Handouts

• In-course Assessments 30%
• End-of-course Examination 70%

• Atiyah, M.G. and MacDonald, G., AnIntroduction to Commutative Algebra, Addison-Wesley,1969
• Dummit, D. S. and Foote, R. M., Abstract Algebra, Wiley, 2006
• Sharp, R. Y., Steps in commutative Algebra, Cambridge University Press, 2001
• Rotman, J.J., Advanced Modern Algebra, JAMS, 2010.

• Provide an introduction to the general topology through a selection of topics

• Define certain notions associated with the topological spaces
• Recall the proofs of certain facts related to bases, subbases , subspaces and quotient spaces
• Prove certain results concerned with continuous functions and homeomorphisms
• Compare the product and box topologies
• Prove various results regarding convergence in the topological spaces
• Prove the Urysohn’s lemma, Urysohn’smetrization theorem, and the Tietze extension theorem
• Reproduce certain fundamental results regarding the compact spaces
• Discuss various aspects of connected, path connected and locally connected spaces

• Topological Spaces and Continuous functions: Definition of topology, bases and subbases, closed sets and limit points, subspaces, continuous functions,  homeomorphisms, the product topology, the weak topology, quotient spaces,
• Convergence: Sequences, nets, ultranets filters, ultra filters.
• Compactness and Connectedness: Compact spaces, finite intersection property, limit point compactness, compactness in the real line, connected spaces, connectedness in the real line, path connectedness, components and local connectedness
• The Separation Axioms and Countability Axioms: space, space,  Hausdorff space, regular space, completely regular space, Tychnoff space, normal space, perfectly normal space, completely normal space,  the countability axioms, Urysohn’s Lemma,Urysohn’smetrizationtheorem, the Tietze Extension theorem.

•  Lectures, Tutorials, Problem solving, Use of e-resources and Handouts.

• In-course Assessments 30%
• End-of-course Examination 70%

• James R. Munkres, Topology, 2^nd Edition, Prentice-Hall, 2000.
• James Dugundji, Topology, University Book stall, 1972.
• Stephen Willard, General Topology, Dove publications, 2004.
• C.Wayne Patty, Foundations of Topology, PWS-Kent publishing Company, 2009.

• Introduce the fundamental concepts of normed linear space and Banach space
• Provide a clear notion of concepts of linear functional and dual space
• Understand the concepts of inner product space and Hilbert space

• Explain the fundamental concepts of normed linear space and Banach space
• Discuss equivalence of norms and its properties
• Examine the convergence and absolute convergence of a series in Banach space
• Recall the concepts of a bounded linear functional and its properties
• Analyze the properties and applications of dual spaces
• Prove Hahn Banach theorems in real and complex normed linear spaces
• Define inner product space and Hilbert space
• Prove Riesz  representation theorem, Bessel’s inequality and Parseval identity
• Make use of separability of a Hilbert space for the existence of orthonormal basis

Linear functionals and Dual spaces: Linear operators and linear functionals, Bounded linear functional, Isometry, Isomorphism, Dual spaces and its applications, Hahn- Banach theorems

Inner product spaces and Hilbert spaces: Inner products, Hilbert spaces,  Closed subspaces and orthogonal projection, Riesz Representation theorem, Orthonormal system and othonormalization, Bessel’s inequality and Parseval identity, Existence   of orthonormal basis in a separable Hilbert space

• Lectures,  Tutorial discussion,  use of e-resources and Handouts

• In-course assessment                                              30%
• End of course Examination                                    70%

• John B. Conway, A Course in Functional Analysis, Springer, 1997
• Bryan P. Rynne , Martin A. Youngson, Linear Functional Analysis, Springer, 2008
• Walter Rudin, Functional Analysis, McGraw – Hill, 1991
• Erwin Kreyszig, Introductory Functional Analysis with Applications, Wiley1989
• FrigyesRiesz and BelaSz.-Nagy, Functional Analysis, Dover Publications, 1990

Hourly Breakdown

• Understand the numerical methods for solving large systems of linear equations
• Recognize the underlying mathematical concepts of computer aided numerical algorithms
• Understand the iterative methods for computing eigenvalues of large matrices

• Outline the fundamental concepts in numerical linear algebra
• Apply the matrix factorization algorithms to solve system of linear equations
• Determine bounds for relative error in the solution of a system of linear equations
• Examine the convergence of iterative methods for solving system of linear equations
• Apply  iterative methods to solve a system of linear equations
• Examine the convergence of iterative methods for computing the eigenvalues of matrix
• Apply  iterative methods to compute eigenvalues of a matrix
• Apply the Grahm-Schmidt orthogonalization process to a matrix
• Solve the linear systems by using readily available software

Matrix Analysis: Canonical forms and positive definite matrices, Vector and Matrix norms, Spectral radius, Condition of problems and scaling

Norm ReducingMethods: Iterative methods and error bounds, convergence results for special matrices, choice of relaxation parameter, sparce matrix technique, Conjugate gradient method

Similarity Reduction methods:House holders’ method, Eigensystems of Hessenberg matrices and tridiagonal matrices, Jacobi method, Given’s method, LR method and QR method

Power Methods:  Direct power method, Raleigh quotients, Deflation process, Shift of the origin, Inverse iteration

• Lectures,  Tutorials,  Problem solving, Use of e-resources and Handouts

• In-course Assessments           30%
• End-of-course Examination 70%

• Trefethen, N. andBau, D., Numerical Linear Algebra, SIAM, 1997.
• Golub, G. and Charles, V. L., Matrix Computations, John Hopkins University Press, 1996.
• Beilina, L., Karchevskii, E. and Karchevskii, M., Numerical Linear Algebra: Theory and Applications, Springer, 2017.

Hourly Breakdown

• Provide knowledge and skills to build mathematical models of real-world problems, analyze them and make predictions about behavior of problems taken from physics, biology, chemistry, economics and other fields.
• Enable to investigate and apply standard mathematical programming problems.

• Formulate  mathematical models for solving given word problems
• Sketch the qualitative solution of the formulated model problems involving Differential equations
• Modify  simple models for the change of environment
• Solve single species population models
• Discuss interacting two species population models
• Solve deterministic programming problems using dynamic programming algorithm
• Apply solution methods of unconstrained nonlinear extremum problems
• Make use of Lagrangian MultipliersmethodandKarush-Kuhn-Tucker(KKT) conditions to locate local minimizers
• ApplyWolfe’s algorithm for solving quadratic programming problems
• Apply separable programming algorithm to solve nonlinear programming problems

Qualitative solution sketching for first order differential equations: Direction field, solution sketch, convexity phase portrait, equilibrium solutions, stability.

Population models for Single and interacting species: Basic concepts, Exponential growth model, formulation, solution, interpretation and limitations, Compensation and dispensation, Logistic growth model, formulation, solution, interpretation and limitations.  Types of interaction between two species. Lotka-Volterra prey-predator model, formulation, solution, interpretation and limitations. Lotka-Volterra model of two competing species, formulation, solution, interpretation and limitations.

Dynamic programming models: Stage, State, Recursive equation, Developing optimal decision policy, Bellman’s principal of optimality, characteristics of deterministic dynamic programming, solving linear programming problem using dynamic programming approach.

Nonlinear programming fundamentals: Fundamentals of optimization, types of problems, Optimality conditions for unconstrained and constrained problems, Lagrangian Multipliers method and Karush-Kuhn-Tucker conditions.

Quadratic and Separable programmings: Quadratic programming, Wolfe’s algorithm, Wolfe’s modified simplex method, separable programming, separable function, piece wise linear approximation of separable nonlinear programming problem, separable programming algorithm.

• Lectures,  Tutorials, Problem solving, Use of e-resources and Handouts

• In-course Assessments 30%
• End-of-course Examination 70%

•  Winston, W. L., Introduction of Mathematical Programming Applications and Algorithms, Duxbury press, California, 1995.
• Hillier, F. S. and Lieberman, G.J., Introduction to Operations Research, 7^th edition, McGrawHill, New York, 2001.
• Taha, H. A., Operations Research an Introduction, 8^th edition, Pearson Prentice Hall, New Jersey, 2007.
• Braun, M. ,Coleman, C. S. and Drew,D.A., Vol. 1, Vol. 2 and Vol.3 – Differential Equation Models,Springer-Verlag, New York, 1983.
• Meyer,W.,  Concepts of Mathematical Modeling, McGraw Hill, New York, 1994.

• Provide in depth knowledge of classical number theory through a study of selection of topics.
• Develop an understanding of the core ideas and concepts of fundamental and advanced counting techniques
• Recognize the power of abstraction and generalization, and apply logical reasoning to investigate some combinatorial problems

• Recall certain theorems in the theory of congruences
• Relate various number theoretic functions through  Möbius inversion formula
• Discuss various properties of Euler  function
• Prove various results regarding primitive roots of prime numbers and composite numbers
• Recall Euler’s criterion and its consequences
• Discuss various properties of Legendre symbol, notably quadratic reciprocity law
• Solve various quadratic congruences
• Solve certain non-linear Diophantine equations
• Prove various results regarding certain numbers of special form
• Solve common counting problems using elementary counting techniques involving the multiplication rule, permutations, and combinations
• Apply the Principle of inclusion and exclusion to solve variety of counting problems
• Apply the recurrence relations to model a wide variety of counting problems and solve them
• Make use of generating functions to solve many type of counting problems subject to variety of constraints, and solve recurrence relations
• Identify the best counting technique  for given counting problem

Basic Counting Techniques: Fundamental principles of counting:Sum, product, subtraction, and division rules. Permutations and  combinations, the Binomial Theorem, Pascal’s identity and Triangle, Vandermonde’s Identity, permutations and combinations with limited and unlimited repetition, multinomial theorem and its applications, generating permutations and combinations,The Pigeonhole Principle and some of its interesting applications.

Advanced Counting Techniques: Inclusion-Exclusion: The principle of inclusion-exclusion, an alternative form of inclusion-exclusion, the Sieve of Eratosthenes, derangementsRecurrence Relations:Modeling with recurrence relations,solving linear homogeneous recurrence relations with constant coefficients, linear non-homogeneous recurrence relations with constant coefficients, divide-and-conquer algorithms and recurrence relations.Generating Functions: Extended binomial theorem, counting problems and generating Functions, using generating functions to solve recurrence relations. Exponential generating functions and its applications on solving some permutation problems.

• Lectures,  demonstration, tutorial discussion, problem solving, use of e-resources and handouts

• In course Assessments 30%
• End of course Examination  70%

• Kenneth H. Rosen, Discrete Mathematics and its Applications, 7^th edition, McGraw Hill, 2012.
• Bernard Kolman, Robert C. Busby, S. C. Ross, Discrete Mathematical Structures, 4^th edition, Prentice Hall, 2001
• Grimaldi R.P, Discrete and combinatorial mathematics: an applied introduction, 5^th edition, Pearson education Inc, 2004
• Miklos Bona, Introduction to Enumerative Combinatorics, McGraw Hill (2007).

Hourly Breakdown

Theory

Practical

• Provide an in depth understanding of compactness in the topological spaces
• Introduce the basic concepts of algebraic topology through a selection of topics

• Discuss the processes of one point and  Stone–Cechcompactifications
• Examine the relationship between various types of compactness in the matric space
• Prove the Tychonoff theorem
• Compare the topology of pointwise convergence, topology of compact convergence and compact-open topology in a function space
• Prove various  results concerned with homotopicity of maps
• Identify covering maps and covering spaces for certain topological spaces
• Recall certain results and their proofs about fundamental groups.
• Identifythe fundamental group of
• Prove the  Fundamental theorem of Algebra and theBorsuk-Ulam theorem
• Prove certain facts of the singular homology theory
• Classify various types of knots

• Compactness: compactness in metric spaces, sequential compactness, Heine-Borel Property, total boundedness, complete metric spaces, the TychonoffTheorem,local compactness, one point and Stone-Cechcompactification, pointwise and compact convergence, compact-open topology
• The Fundamental group and Covering Spaces: homotopy of paths, the fundamental group, covering spaces, fundamental group of the circle, the fundamental theorem of algebra, antipodes, the Borsuk-Ulam theorem, retractions and fixed points, deformation  retracts and homotopy type

• Homology Theory:  standard – simplex, boundary operator, – cycles, homology groups, induced homomorphism.
• Introduction to Knots: types of knots, preliminary results.

• Lectures, Tutorials, Problem solving, Use of e-resources and Handouts.

•  In-course Assessments 30%
• End-of-course Examination 70%

• James R. Munkres, Topology, 2^nd Edition, Prentice-Hall, 2000.
•  B.K.Lahiri, A First course in Algebraic Topology, Narosa, 2000.
• C.Kosniowski,  A First course in Algebraic Topology, Cambridge University press, Cambridge , 2008
• A.Hatcher, Algebraic topology, Cambridge University press, Cambridge, 2002.
• SashoKalajdzievski,  Topology and Homotopy,  CRC press, 2015.

Hourly Breakdown

• Introduce the fundamental concepts of Lebesgue measure spaces and abstract measure spaces
• Develop clear ideas on the concept of Lebesgue measurable functions, integrals, and their convergence properties
• Discussthe fundamental connection between differentiation, and integration

• Construct Lebesgue measures on the real line
• Define abstract measure space
• Illustrate the properties of abstract measure space
• Discuss the properties of measurable functions and the convergence of sequence of measurable functions
• Explain the simple function approximation of measurable functions
• Formulate integrals in a measure space
• Discuss the convergence of integrals
• Extend the measures from algebras/semialgebra to σ-algebras
• Formulateproduct measures
• Prove Fubini’s theorem, and Tonelli’s theorem
• Discuss the fundamental connection between differentiation, and integration

Measurable Functions:  Basic properties of measurable functions, Examples, Borel measurable functions, Approximation Theorem; Littlewoods’s three principles: Egoroff’s theorem.

Integration:Integral of nonnegative functions, Integrability of a nonnegative function, Fatou’s Lemma, Monotone convergence theorem, Lebesgue Convergence Theorem, Generalized Convergence Theorem.

Extension of Measure:Measure on an algebra, Extension of measures from algebras to σ-algebras, Carathéodory’s theorem, and Lebesgue-Stieltjes integral.

Product Measure:Measurable rectangle, Semialgebra, Construction of product measures, Fubini’s theorem, and Tonelli’s theorem

Differentiation and Integration:Differentiation of monotone functions: Vitali’s lemma, Functions of bounded variations; Differentiation of an integral: Indefinite integral, and Absolutely continuous functions.

• Lectures, Tutorials, Handouts, Problem solving, Use of e-resources

• In-course Assessments         30%
• End-of-course Examination 70%

• Halsey Royden, Patrick Fitzpatrick, Real Analysis,4^th Edition, 2010
• Walter Rudin, Real and Complex Analysis, 3^rd Edition, 1986
• G De Barra, Measure theory and Integration, 2^nd Edition, 2003
• Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, 2nd Edition, 2007

Hourly Breakdown

• Prove the orbit-stabilizer theorem, Cauchy’s theorem, the class equation and other related results
• Define Sylow-p-subgroup
• Prove the Sylow-theorems
• Examine the simplicity of groups by means of Sylow theorems
• Prove the fundamental theorem of finite abelian groups
• Discuss the simplicity of Alternative Group A_n
• Construct a group that is free on a given non-empty set
• Analyse the presentations of certain groups, in particular the dihedral groups and the quaternion groups
• Prove the Zassenhaus lemma, theorems of Schreier and Jordan-Holder and certain other results related to the chain conditions
• Discuss various properties of the Frattini subgroup of a given group
• Define nilpotent group, soluble group, supersoluble group and residually nilpotent group
• Examine various properties of nilpotent groups, soluble groups, supersoluble groups and residually nilpotent groups

Direct products, group acting on sets, p-groups, the Sylow theorems, finite abelian groups, symmetric groups, simplicity of A_n,  free groups, presentations of groups, series of subgroups, composition series, chain conditions, Frattini subgroup, nilpotent groups, soluble groups, super soluble groups, residually nilpotent groups.

• Lectures,  Tutorials, Handouts, Problem solving, Use of e-resources

• n-course Assessments 30%
• End-of-course Examination 70%

• Abstract algebra, Joha A Beachy William D Blair, 4^th edition, Waveland, 2019.
• Contemporary Abstract Algebra Joseph.A.Gallian, 9^th edition, Cengage, 2016.
•  Abstract Algebra, David S Dummit,Richard M. Foote,4^th edition, Wiley, 2018.
•  A course in the theory of groups – Derek.J.S.Robinson 2^nd edition, Springer, 1995.

• Introduce the fundamental theorems for normed and Banach spaces

• Provide a clear notion of concepts of  compact linear operators and adjoint operators on Normed spaces

• Acquaint with the concepts of spectral theory of bounded self adjoint linear operators in Normed spaces

• Demonstrate uniform boundedness principle
• Prove open mapping theorem, bounded inverse theorem and closed graph theorem
• Define reflexive normed linear spaces
• Discuss the strong and weak convergence of sequence in a normed space
• Prove Banach fixed point theorem
• Define Self adjoint, Unitary, Normal and Compact linear operators
• Develop  Resolvent and spectrum
• Discuss the spectral properties of bounded linear operators
• Construct the spectral family of a bounded self-adjoint linear operator
• Extend the spectral theorem to continuous functions

Compact linear operators and Adjoint operators on Normed spaces: Hilbert-Adjoint Operator , Self-adjoint, Unitary and Normal operators,  Compact linear operators on normed Spaces and its properties

Spectral theory of bounded self adjoint linear operators in Normed Spaces : Resolvent and spectrum of linear operator, Spectral theory in finite dimensional normed spaces,  Spectral properties of bounded operators and self-adjoint  operators , Spectral properties of Compact linear operators ,Positive operators, Spectral family of a bounded self-adjoint linear operator, Extension of the spectral theorem to continuous functions.

• Lectures,  Tutorial discussion, Handouts and use of e-resources

• In-course assessment                                              30%
• End of course Examination                                    70%

• John B. Conway, A Course in Functional Analysis, Springer, 1994
• Bryan P. Rynne , Linear Functional Analysis, Springer, 2007
• Walter Rudin, Functional Analysis, Mac Graw – Hill, 1977
• Erwin Kreyszig, Introductory Functional Analysis with Applications, Wiley, 1989

• Provide a rigorous treatment of holomorphic and meomorphic  functions
• Acquaint with the concepts of conformal mapping and analytic continuation

• Recall the definition and results related to functions representable by power series
• Prove Cauchy’s  theorem, Cauchy’s formula, Morera’ s theorem, residue theorem, open mapping theorem and global  Cauchy’s  theorem
• Discuss various properties of Poisson’s kernel
• Establish Harnack’s theorem and mean value property
• Examine the maximum modulus theorem for unbounded regions
• Define the notion of a conformal mapping and conformal equivalence
• Construct explicit conformal equivalences between specified complex regions
• Prove Schwarz’s lemma and Riemann mapping theorem.
• Define an infinite product and give product formulas for standard mathematical functions.
• Construct entire functions with specified zero sets
• Develop automorphisms with specified behaviour.
• Discuss the Schwarz reflection principle as a form of analytic continuation
• Find analytic continuation of given function along a given curve
• Prove Monodromy theorem

Harmonic functions: Cauchy-Riemann equations, Poisson integral, Mean value property, Boundary behavior of Poisson integrals ,Representation theorems

Maximum modulus principle: Schwarz lemma, Phragmen-Lindelof method, An interpolation theorem, Converse of  the maximum modulus theorem

 Conformal mapping :Preservation of angles, Linear fractional transformation, Normal families, Riemann mapping theorem, Continuity at the boundary, Conformal mapping of an annulus

Zeros of Holomorphic functions: Infinite products, Weierstrass factorization theorem, An interpolation theorem, Jensen’s formula, Blaschke products, Muntz-Szasz theorem

Analytic continuation: Regular points and singular points, Schwarz reflection principle, Continuation along curves, Monodromy theorem, Construction of modular function, Picard theorem

• Lectures,  Tutorial discussion, Handouts and use of e-resources

• In-course assessment                                              30%
• End of course Examination                                    70%

• Walter Rudin , Real and Complex Analysis, McGraw-Hill, 1987
• John B. Conway,Functions of one complex variable, Springer,1994
• Bruce P. Palka, An Introduction to Complex function theory, Springer-Verlag, 1991
• Robert E. Greene, Steven G. Krantz,  Function Theory of One Complex Variable,American  Mathematical  Society, 2006
• Wilhelm Schlag, A Course in Complex Analysis and Riemann Surfaces, American  Mathematical  Society,2014

Hourly Breakdown

• Introduce the central concepts and principles in quantum mechanics, such as the Schrödinger equation, the wave function and its statistical interpretations.
• Develop a theory of continuum mechanics and understand fundamental concepts of stress and strain.
• Familiarize the fundamental principles of the general theory of relativity.
• Describe the properties and dynamics of charged particles and electromagnetic fields.

• Explain the basic principles of quantum mechanics.
• Solve the Schrodinger equation to obtain wave functions for some basic, physically important types of potential in one dimension.
• Explain the operator formulation of quantum mechanics.
• Obtain the Heisenberg’s uncertainty principle in quantum mechanics.
• Describe motion, velocity and acceleration using spatial and material descriptions.
• Define the concepts of strain and stress measures for finite deformations.
• Solve specific technical problems of displacement, strain and stress in continuous materials.
• Obtain the equations of motion and conservation laws for continuum materials.
• Define the properties of isotropic linear elastic materials.
• Explain the fundamental concepts of special relativity.
• Derive the Lorentz transformations.
• Explain the concepts of length contraction and time dilation.
• Define the relativistic notation for 4-vectors.
• Recall the important laws and principles of electric, magnetic, and electromagnetic fields.
• Solve problems in electrostatic, magnetostatic, and electromagnetic fields
• Construct the necessary equations related to Faraday‘s law, induced electromotive force and Maxwell‘s equations.
• Apply Maxwell‘s equations to solutions of problems relating to transmission lines and uniform plane wave propagation

Continuum mechanics:  Strain: Lagrangian tensor, Eulerian tensor, small strain, shearing, volume deformation, strain vector. Stress: force, stress tensor, stress vector, conservation of mass, balance of linear momentum, balance of angular momentum, conservation of energy.

Relativity: Galilean relativity, inertial frames, Galilean transforms, Newtonian relativity, Constancy of speed of light, simultaneity, space-time diagrams, proper time, Lorentz transforms, length-contraction and time-dilation, transformation of velocities. 4- vectors: displacement, velocity, acceleration, frequency, Conservation of 4- momentum, mass-energy equivalence.

Electromagnetism: Charge, Coulomb’s law, electric field and potential, Electric flux and density, Electro dynamics, Magnetostatics fields, Faradays law, Displacement current, Time-varying potentials, Derivation of Maxwell’s equations, Electromagnetic wave propagation.

• Lectures,  Tutorials, Handouts, Problem solving, Use of e-resources

• In-course Assessments         30%
• End-of-course Examination 70%

• F. Schwabl, Quantum Mechanics. Springer-Lehrbuch, Heidelberg, 2002.
• J. J. Sakurai, Modern Quantum Mechanics. Addison Wesley Longman, 1994.
• R. Chatterjee, Mathematical Theory of Continuum Mechanics, Narosa Pub, 2019
• C.S. Jog, Continuum Mechanics, (3rd edition), Cambridge-IISc Press, 2015.
• J. B. Hartle, Gravity: An Introduction to Einstein’s General Relativity, Addison-Wesley, 2003.
•  B. Schutz: A First Course in General Relativity, Cambridge University Press, 2009.
• D.J.R. Griffiths,.,Introduction to Electrodynamics (4^th  ed.),Cambridge University Press, 2017.
•  D. Fleisch, A Student’s Guide to Maxwell’s Equations, Cambridge University Press, 2008.
• R.K.Wangsness, Electromagnetic Fields (2^nd ed.), Wiley, 2007.

Hourly Breakdown

•  Familiarize theunderlying theoretical concepts in differential equations
•  Understand the Analytical Aspects of the solutions of differential equations

• Outline the analytical concepts in differential equations
• Prove Gronwall’s inequality
• Prove the existence and uniqueness of the solution of the first order differential equation
• Determine the   solution of a first order ordinary differential equation
• Construct the Wronksian for a higher order ordinary differential equation
• Elaborate the linear independenceness of the solutions
• Construct linear independent solution using reduction of order
• Define various types of  equilibriums
•  Classify the equlibria of a ordinary differential equation
• Make use of Routh-Hurwitz condition to determine the equilibria of a system of ordinary differential equation
• Formulate the nullclines of a system of ordinary differential equations
• Build a phase plane diagram   for a system of ordinary differential equations
• Construct the solution for a first order partial differential equation
• Analyze the continuity of the solution of a first order partial differential equation
• Classify a second order partial differential equation into hyperbolic, parabolic and elliptic
• Formulate the canonical form of the second order partial differential equation
• Establish the De Alembert’s solution of a second order partial differential equation
• Prove the uniqueness of the solution of a second order partial differential equation
• Formulate the solution of a second order partial differential equation
• Apply Green’s theorem
• Show the symmetry of Green’s function

Linear System of Ordinary Differential Equations: First order Scalar equations, Linear ordinary differential equations with constant coefficients, Linear independence and the Wronskian, Inhomogeneous equations, Variation of parameters, Matrix notations, Linear ordinary differential equations with variable coefficient. Series solutions, Legendre equations, equations with regular singular points, Bessel equations, Boundary Value problems and Green’s function

Stability Analysis of Ordinary Differential equations:  Autonomous  systems, linearization, Linear systems, Routh Hurwitz criterion, classification of equilibria, Phase plane analysis, Poincare-Bendixon theorem, Lyapunov stability

First order Partial Differential Equations: First order quasi linear scalar equations, method of characteristics, systems of equations, concepts of order and dimension

Second order Linear Partial Differential Equations: Classification of equations, canonical forms of hyperbolic, parabolic and elliptic equations, Boundary conditions, the Laplacian, wave equation and heat equation, Poisson’s equation, uniqueness and the maximum principal, integral transform solutions, application of Laplace transform, and Fourier transforms, Hankel Transforms.

• Lectures,  Tutorials, Handouts, Problem solving, Use of e-resources

• In-course Assessments           30%
• End-of-course Examination 70%

• D. P. Andrei, F. Z. Valentin, Handbook of Ordinary Differential Equations: Exact Solutions, Methods and Problems, CRC Press, 2018
• E. A. Coddington, An introduction to Ordinary Differential Equations, Dover Publications, 1961
• S. Ahmad, A. Ambrosetti, A textbook on Ordinary Differential Equations, Springer, 2014
• P. Hartman, Ordinary Differential Equations, SAIM, 2002
• L. C. Evans, Partial Differential Equations, AMS, 2010
• M. Renardy, R. C. Rogers, An introduction to partial differential equations, Springer, 2004
• Y. pinchover, J. Rubinstein, An introduction to partial differential equations, Cambridge University Press, 2005

Hourly Breakdown

·         Familiarize the underlying mathematical concepts of computer aided numerical algorithms

·         Acquaint with the stability theory concepts of the methods

• Illustrate the fundamental concepts involving norms and matrix inequalities
• Apply implicit and explicit Euler methods
• Estimate the error bounds for the solutions obtained using Euler methods
• Recall the order, consistency, stability, convergence and the characteristic polynomials associated with a linear multistep method
•  Prove the relationships among the order, consistency, stability,  convergence and the characteristic polynomials of a linear multistep method
• Examine the consistency, stability and convergence of a linear multistep method
• Outline various types of predictor-corrector methods
• Apply a given predictor-corrector method to solve a differential equation
• Demonstrate the stability of a predictor-corrector method
• Illustrate Runge-Kutta method
• Recall the order, consistency, stability and convergence of Runge-Kutta method
• Construct Runge-Kutta method using order conditions
• Define various types of stability associated with the Runge-Kutta method
• Interpret the relationships among various types of stabilities
• Determine a difference formula to solve a boundary value problem
• Construct  Finite difference methods applied to boundary value problems
• Estimate the truncation error for a finite difference method
• Apply finite difference methods to solve a boundary value problem

Linear multistep methods: General methods, order of the methods, error constant, convergence of the method, consistency of the method, stability of the method, Construction of a linear multistep method, Predictor-Corrector methods

Runge-Kutta methods: General Runge-kutta methods, implicit and explicit methods, local and global truncation errors, order of the method, order conditions, derivation of the method

Stability: A- stability, B – stability, algebraic stability

Boundary Value Problems: FiniteDifference methods, Shooting methods, truncation error estimation, Convergence of the method, Stability of the method

• Lectures,  Tutorials, Handouts, Problem solving, Use of e-resources

• In-course Assessments           30%
• End-of-course Examination 70%

• M. H. Holmes, Introduction to Numerical Methods in Differential Equations, Springer-Verlag NewYork, 2007
• D. Griffiths and D. J. Higham,  Numerical Methods for Ordinary Differential Equations, Springer-Verlag London, 2010
• K. Atkinson, W. Han and D. E. Stewar, Numerical Solution of Ordinary Differential Equations, Wiley, 2009
• J. W. Thomas, Numerical Partial Differential Equations: Finite Difference Methods, Springer-Verlag NewYork, 1995

Hourly Breakdown

• Provide an introduction to category theory, as a language of unification with an emphasis on applications.

• Define the Category, Functor, Natural transformations, Limits and Colimits, adjoints and monads
• Construct  various examples of category  and other concepts in category theory such as   Functor, Natural transformations, Limits and Colimits, adjoints and monads
• Analyze the properties of special types of objects and morphisms
• Prove Yoneda Lemma,
• Construct initial algebra and final colgebra by means of the Adamek’s theorem and Bar’s theorem respectively.
• Explain the notions of sources, sinks and generalized limits and colimits.
• Solve problems using category theoretic concepts.

Categories and Functors:- Categories,  examples, commutative diagrams, Definitions , duality Principle, isomorphisms,  Fuctors, examples of Functors, Composition of functors, Hom-sets, Subcategory, Equivalences of categories.

Natural transformations:- Natural transfromation between two functors, Naturality condition, Examples of Natural transformations,   Functor categories, Representable functor, Composition of natural transformations, The category of small categories,  Yoneda Lemma

Objects and Morphisms:- Initial Object and Final Object, separator and coseparator, sections, retraction, monomorphismsm, epimorphisms, regular and extremalepimorphism, equalizer, coequalizer,

Limits and Colimits :- Products and Coproducts, Sinks and Sources, pullback and pushout, Limit and Colimit of functors, preservation of Limits, Lifting of Limits

Applications :- Algebras and  Coalgebras:-Category of algebras and coalgebras, Initial algebras and final coalgebras, applications to computer science.

Optional Topics:- Adjoints and Monads (according to the avaliblity of time)

• Lectures, tutorial discussions and e-learning

• In-course assessment                                              30%
• End of course Examination                                    70%

• Adámek, Jiří, Horst Herrlich, and George E. Strecker. “Abstract and concrete categories. The joy of cats.”,2004.
• Awodey, Steve. Category Theory. Oxford University Press, 2010.
• An Invitation to Applied Category Theory, Online version:-https://arxiv.org/abs/1803.05316
• Crole, Roy L. Categories for types. Cambridge University Press, 1993.
• Spivak, David I. “Category theory for scientists.” arXiv preprint arXiv:1302.6946,2013.

Hourly Breakdown

• Identify a research question, problem, or design through a literature survey.
• Apply basic principles and knowledge found in the literature related to the research problem
• Demonstrate appropriate research methodologies
• Identify relevant theory and concepts, relate these to appropriate methodologies
• Develop a research proposal to address or resolve a specific research question or problem
• Demonstrate the research findings in written and verbal forms

• Guided independent study, Discussion with the supervisor, Use of e-resources.

• Presentation         30%
• Project Report     70%

• Lianghuo Fan,Luc Trouche,Chunxia Qi,Sebastian Rezat,Jana Visnovska, Research on Mathematics Textbooks and Teachers’ Resources: Advances and Issues,  Springer International Publishing,  2018.
• Robert Gerver, Writing Math Research Papers: A Guide for Students and Instructors, 2^th Edition, Information Age Publishing, Inc, 2014.
• George Grätzer, More Math Into LaTeX 5th Edition,Springer International Publishing, 2016