Details of Courses Fall 2018

Mathematics

1 Course code MTH 310

2 Course Title Group Thoery

3 Credits 4

4 Course Coordinator Ayan Mahalanobis

& participating
faculty(if any)

5 Nature of Course

(Please keep the L&T- Lectures & Tutorials

appropriate one
only)

6 Pre requisites(if any) None

7 Objectives & Objectives: Learn group theory.

Outcomes (goals, Open in sem – BS MS semester 5, 7 and iphd
students for whom semester 1
offered, outcomes Outcomes: Know some group theory, isomorphism
etc) theorems and Sylow’s theorem.

8 Course contents There is only one section – group theory and all
lectures will be on that. We will cover basics of
(section wise listing group theory, subgroups, normal subgroups,
of topics with no. of quotient groups, isomorphism theorem and Sylow
lectures for each) theorem.
9 Evaluation a. End-sem examination- 35%
/assessment
b. Mid-sem examination- 35%
evaluation
components with c. Continuous Assessment – 30%
weightage, Pl keep d. Quiz-
weightage for end
sem exam-30- e. Seminar/Presentations-
40%,mid sem exam-
30-40% &
continuous
assessment-30-40%

10 Suggested Topics in algebra by I.N. Herstein

readings

(full list with

authors, publisher,
year, edn etc. for
each)

1 Course code MTH 311

2 Course Title Analysis

3 Credits 4

4 Course Coordinator Ratna Pal

& participating
faculty(if any)

5 Nature of Course

(Please keep the L&T- Lectures & Tutorials

appropriate one
only)
6 Pre requisites(if any) None

7 Objectives & A serious student of mathematics must master the

Outcomes (goals, epsilon-delta language of “limits”. Familiar ideas
students for whom from calculus, such as continuity, series,
offered, outcomes derivatives, and integrals are all describable in
etc) terms of limits. In this course we strengthen our
analytic technique to the point where we can blend
these ideas gracefully. Full proofs are the norm in
this course. MTH 311 is very much a prerequisite
for courses in the analysis, topology, and applicable
math streams; it is also strongly recommended for
students pursuing theoretical physics.

Open for BS-MS semester 5 and 7 and iphd

semester 1

8 Course contents Real Numbers, least upper bound property,

sequences, convergence, suprema and infima,
(section wise listing Bolzano-Weierstrass theorem, limsup, liminf, limit
of topics with no. of points, subsequences, Infinite series,
lectures for each) rearrangement of series, tests for convergence,
Functions on R, continuous functions, intermediate
value theorem, Heine Borel Theorem, uniform
continuity, Differentiation on R^n, definition of total
derivative, L'Hospital rule, local maxima and
minima, inverse function theorem, implicit function
theorem, Riemann integration, basic properties,
Riemann integrability of continuous functions,
fundamental theorem of Calculus. Pointwise and
uniform convergence of sequences of functions,
uniform convergence and continuity, Weierstrass
approximation theorem, Uniform convergence of
series of functions, Weierstrass M-test,
convergence of integrals and derivatives of
sequences of functions, Introduction to power
series and analyticity.
 No. of lectures for each: To be announced.

9 Evaluation a. End-sem examination- 35%

/assessment
b. Mid-sem examination- 35%
evaluation
components with c. Quiz- 30%
weightage, Pl keep
weightage for end
sem exam-30-
40%,mid sem
exam-30-40% &
continuous
assessment-30-
40%

10 Suggested 1. Analysis I & II: T. Tao, TRIM Series (2006)

readings Hindustan Book Agency

(full list with 2. Principles of Mathematical Analysis: W. Rudin

authors, publisher, (1976) Tata McGraw Hill
year, edn etc. for
each) 3. Mathematical Analysis: T.M. Apostol (1974)
Addison-Wesley

4. Introduction to Real Analysis: R. G. Bartle and D.

R. Sherbert (2011) Wiley 5. Methods of Real
Analysis: Goldberg (1976) Wiley

1 Course code MTH 312

2 Course Title Point Set Topology

3 Credits 4
4 Course Coordinator Dr. Rama Mishra
& participating
faculty(if any)

5 Nature of Course

(Please keep the L&T- Lectures & Tutorials

appropriate one
only)

6 Pre requisites(if any) Basic Real Analysis

7 Objectives & Objectives: To make students understand the

Outcomes (goals, notion of abstract topological spaces and realize
students for whom that we can define continuous function even when
there is no distance on the sets involved.
offered, outcomes
etc) Open in sem – BS-MS Semester 5 and 7, iphd
semester 1
Outcomes: This course serves as a pre-requisite
for some mathematics courses such as: Algebraic
topology, Differential Geometry and Calculus on
manifolds; and also for some Physics courses such
as General relativity etc.
8 Course contents Basic definition and examples. Notion of Base and
sub-base.
(section wise listing
Generating topology using notions like closed sets,
of topics with no. of
closure and interior. Dense and nowhere dense
lectures for each)
sets. Countability axioms. Separation Axioms. Maps
between topological spaces. Urisohn’s lemma and
Tietz’ Extension theorem.
Product and Quotient topology . Compactness and
Connectedness. Para compact spaces .Metrization
theorems.
9 Evaluation a. End-sem examination- 35%
/assessment
b. Mid-sem examination- 35%
evaluation
components with c. Continuous Assessment – 10%
weightage, Pl keep d. Quiz- 20%
weightage for end
sem exam-30-
40%,mid sem
exam-30-40% &
continuous
assessment-30-
40%

10 Suggested Topology, A First Course by J. Munkres.

readings
General Topology- Kelley.
(full list with
authors, publisher, Elementary Topology and Applications- C.R.
year, edn etc. for Borges
each) World Scientific.

1 Course code MTH 314

2 Course Title Statistical Inference

3 Credits 4

4 Course Coordinator Uttara Naik-Nimbalkar

5 Nature of Course L- lectures alone

6 Pre requisites(if MTH 202 (Probability & Statistics)

any)

7 Objectives& The course covers the core of statistical inference;

Outcomes (goals, the mathematical development and application of
students for whom various techniques that are useful in drawing
conclusions about a population based on
offered, outcomes
 etc) information obtained from a sample.
It is useful for students wishing to pursue advanced
mathematical statistics as well as for students
wishing to analyze commonly collected
experimental data in a scientific manner.
Open in sem - BS-MS V / VII iphd semester 1

8 Course contents Reduction of data, sufficient statistics, minimal

sufficient statistics, Neyman factorization theorem,
(section wise listing complete statistics, exponential families. Ancillary
of topics with no. of statistics, Basu’s theorem. (7L)
lectures for each) Estimation of real and vector parameters. Method of
moments & maximum likelihood, Bayes’ estimation.
Methods of evaluating estimators. Cramer-Rao
Inequality, Fisher Information, Rao-Blackwell
theorem, Lehmann‐Scheffe theorem. (11L)
Testing of hypotheses, likelihood ratio tests,
Bayesian tests, error probabilities, P-values, power
function, most powerful tests, Neyman‐Pearson
lemma, uniformly most powerful tests (UMP),
monotone likelihood ratio. (10L)
Confidence intervals, construction of confidence
intervals, onesided confidence intervals and their
relation with UMP tests,Bayesian intervals.
(6L)
On One and two way analysis of variance, F‐
statistics and their null distributions. (6L)
9 Evaluation a. End-sem examination- 35%
/assessment b. Mid-sem examination- 35%
c. Quizzes/Assignments- 30%
10 Suggested 1.Statistical Inference: George Casella & R. L.
readings Berger (2002),
Edn. 2, Duxbury, Cengage Learning.
2. Mathematical Statistics and Data Analysis: John
A. Rice
(2007), Edn. 3, Duxbury, Cengage Learning.
3. Introduction to Mathematical Statistics: R. V.
Hogg , J.
McKean& A. T. Craig (2013), Edn. 7, Pearson
Education, Inc.
4. Computer Age Statistical Inference: B. Efron & T.
Hastie
(2016), Cambridge University Press.
1 Course code MTH 318

2 Course Title Combinatorics

3 Credits 4

4 Course Coordinator Uday Bhaskar Sharma

& participating
faculty(if any)

5 Nature of Course L&T- Lectures & Tutorials

(Please keep the

appropriate one
only)

6 Pre requisites(if any) Nil

7 Objectives & Objectives: To give a fair idea of what

Outcomes (goals, combinatorics is about, and why it’s done, and how
students for whom useful it can be for several counting related
problems.
offered, outcomes
etc) Open in sem – BS-MS semester 5,7 and iphd
semester 1
Outcomes:
8 Course contents Permutations and Combinations of multisets (3
lectures)
(section wise listing
Pigeonhole Principle (2 lectures)
of topics with no. of
lectures for each) Partially Ordered sets, chains, and lattices (4
lectures)
Inclusion-Exclusion method, Mobius inversion( 5
lectures)
Recurrence Relations, Generating Functions (4
lectures)
Polya’s Counting Theorem, Burnside’s theorem (4
lectures)
Symmetric Functions and Ferrer Diagrams (3
 lectures)

9 Evaluation a. End-sem examination- 35%

/assessment
b. Mid-sem examination- 35%
evaluation
components with c. Quizzes and Assignments- 30%
weightage, Pl keep
weightage for end
sem exam-30-
40%,mid sem
exam-30-40% &
continuous
assessment-30-
40%

10 Suggested Introductory Combinatorics by Richard A. Brualdi

readings (Pearson, 5th Edition, 2010)

(full list with Enumerative Combinatorics, volumes 1 and 2,

authors, publisher, Richard Stanley (Cambridge University Press,
year, edn etc. for 2011)
each)

1 Course code MTH 315

2 Course Title Numerical Analysis
3 Credits 4
4 Course Coordinator Anindya Goswami
(include
participating
faculty)
5 Pre requisites (also Linear algebra, Calculus I, Calculus II
mention if this is
pre-requisite for a
later course)
6 Objectives (goals, This course aims at teaching various methods and
type of students for their theoretical aspects for solving problems from
whom useful, calculus and linear algebra numerically. Although
outcome etc) this course does not aim to teach how to write a
code for solving a numerical problem, but
acquaintance of flow chart is essential. It
emphasizes on examining the quality of
approximation and the estimation of errors for a
given numerical scheme. Many problems demand a
clear understanding of these, irrespective of using a
self-written code or some mathematical software.
Therefore, it is useful for all those who wish to
pursue a carrier in a quantitative study which
involves computations.

Open for BS-MS semesters 5,7 and iphd semester

1
7 Course contents Significant digits, round-off errors. Finite
computational processes and computational errors.
Propagation of errors, condition number. Loss of
significant digits. Numerical solution of nonlinear
equation in one variable: Improvement of the initial
solution using methods of bisection, convergence
and error analysis, Newton-Raphson method, order
of convergence and degree of precision,
comparison between the two methods. Interpolation
with one variable: Newtonian methods, Horner's
algorithm, divided differences, Lagrange form,
Vandermonde matrix, error estimate. Cubic splines,
existence and uniqueness, Gershgorin circle
theorem. Numerical integration: Newton-Cotes;
composite trapezoidal, composite Simpson rule,
error estimate. Numerical differentiation:
Richardson extrapolation, order of convergence,
loss of significance.

Computation in Linear Algebra: Numerical solution

of system of linear equations and matrix inversion:
Gaussian elimination, L-U decomposition, Cholesky
decomposition, Inversion of tridiagonal matrix.
Iterative methods: Richardson, Jacobi, Gauss-
Seidel. Numerical computation of eigenvalues and
eigenvectors: power method. Numerical solution of
ordinary differential equations: one step method,
Euler's, Taylor series, Runge-Kutta's methods,
errors and accuracy. Second order boundary value
 problem, shooting method, finite difference method.
Numerical parabolic PDE: Explicit, implicit and
Crank-Nicolson implicit method, stability. Multigrid
method for differential equations.
8 Evaluation End-sem examination- 35 %
/assessment Mid-sem examination -35%
(evaluation Quiz- 30%
components with
weightage)
9 Suggested 1. G Shanker Rao & Shanker G. Rao - Numerical
readings Analysis, New Age International, 2006.
2. Hohmann, A.- Numerical analysis in modern
scientific computing: An Introduction, Springer
2003.
3. Kincaid, D.- Numerical analysis: Mathematics of
scientific computing, AMS 2002.
4. Biswal, Purna Chandra - Numerical analysis, PHI
learning
1 Course code MTH 410

2 Course Title Galois Theory

3 Credits 4

4 Course Coordinator Rabeya Basu

& participating
faculty(if any)

5 Nature of Course L- lectures alone /

(Please keep the L&T- Lectures & Tutorials
appropriate one
only)

6 Pre requisites(if MTH 310, MTH 320

any)

7 Objectives & Objectives: In this course we shall study basics of

Outcomes (goals, field theory, and Galois Theory. These are standard
students for whom basic algebra which is needed for higher study in
pure mathematics.
offered, outcomes
etc) Open in BS-MS semester 7 and iphd semesters 1, 3
8 Course contents Field Extensions: finite, algebraic and
(section wise listing transcendental extensions; adjunction of roots;
of topics with no. of degree of a finite extension.
lectures for each) Ruler and compass constructions. Algebraically
closed fields.
Existence and uniqueness of algebraic closure.
Without proof.

Splitting Fields and Normal Extensions. Separable

Extensions.Finite fields.
Galois extensions. Automorohism Groups and Fixed
Fields.

Fundamental Theorem of Galois Theory and

Applications.

Cyclic Extensions. Cyclotomic Polynomials.

Solvability by radicals. Constructibility of regular n-
gon.
9 Evaluation a. End-sem examination- 40%
/assessment b. Mid-sem examination- 30%
evaluation c. Continuous Assessment – 10%
components with d. Quiz-20%
weightage, Pl keep
weightage for end
sem exam-30-
40%,mid sem
exam-30-40% &
continuous
assessment-30-
40%

10 Suggested Abstract Algebra by Dummit and Foote.

readings Basic Abstract Algebra by Bhattacharya, Jain and
(full list with Nagpal.
authors, publisher,
year, edn etc. for
each)
1 Course code MTH412

2 Course Title Algebraic Topology

3 Credits 4

4 Course Coordinator Tejas Kalelkar

& participating
faculty(if any)

5 Nature of Course L- lectures alone

(Please keep the

appropriate one
only)

6 Pre requisites(if any) Point-set Topology (MTH312), Group Theory

(MTH310)

7 Objectives & Objectives: This course is aimed at students who

Outcomes (goals, have covered point-set topology and basic group
students for whom theory and wish to study topology deeper using
algebraic objects like the fundamental group and
offered, outcomes
homology.
etc)
Open in sem – VII/Int PhD 1,3
Outcomes: To develop techniques to solve
topological/geometric problems using algebra.
8 Course contents Paths and homotopy, fundamental groups,
fundamental group of a circle, free groups and free
(section wise listing products, Van Kampen Theorem, application to CW
of topics with no. of complexes, covering spaces, lifting criteria, deck
lectures for each) transformations, Introduction to homology theory,
definition of singular homology, Hurewicz
isomorphism, Axioms of homology, homology
groups of spheres, Applications of homology:
Brouwer fixed point theorem, Invariance of domain
theorem.
9 Evaluation a. End-sem examination- 30%
/assessment
b. Mid-sem examination- 30%
evaluation
components with c. Homework- 20%
weightage, Pl keep d. Quiz- 20%
weightage for end
sem exam-30-
40%,mid sem
exam-30-40% &
continuous
assessment-30-
40%

10 Suggested Algebraic Topology, by Allen Hatcher

readings
Topology, by James Munkres
(full list with
authors, publisher,
year, edn etc. for
each)

1 Course Code MTH413

2 Course Title Algorithms

3 Credits 4

4 Course Coordinator Dr. Soumen Maity

5 Nature of Course Lecture

6 Pre requisites Graph Theory

7 Objectives (goals, To provide a solid foundation in algorithm design

type of students for and analysis. Specifically, the student learning
whom useful, outcomes include: ability to understand and design
algorithms using greedy strategy, divide and
outcome etc)
conquer approach, dynamic programing; ability to
analyze asymptotic runtime complexity of
 algorithms including formulating recurrence
relations; basic knowledge of computational
complexity and randomized algorithms.

Open in BS-MS semester 7 and iphd semesters 1,

3

8 Course contents Asymptotic order of growth: big O notation and its

relatives. Divide and Conquer and Recurrences:
The master theorem, application to the complexity
of recursive algorithms, stable matching

Data Structures: Stacks, queues, priority queue,

heaps, binary search trees.

Basic Algorithms: breadth first search, depth first

search, DAGs (directed acyclic graphs) and
topological ordering, strongly connected
components

Greedy Algorithms: interval scheduling, Dijkstra's

algorithm for finding shortest paths in a graph,
minimum spanning trees, Huffman codes for data
compression

Dynamic Programming: weighted interval

scheduling, subset sums and knapsacks.
Introduction to NP-completeness.

9 Evaluation d. End-sem examination- 35 %

/assessment e. Mid-sem examination- 35 %
f. Class Test- 30%

10 Suggested 1. H. Cormen, C. E. Leiserson, Ronald L.

readings Rivest, Clifford Stein, Introduction to
Algorithms, 2/e, MIT Press
2. J. Klienberg and Eva Tardos: Algorithm
Design. 1st Edition. Addison Wesley, 2005.
ISBN 0-321-2
3. S. Dasgupta,C. H.Papadimitriou,and U. V.
Vaziran, Algorithms, McGraw-Hill Higher
Education, 2006.
1 Course code MTH 415

2 Course Title Probability

3 Credits 4

4 Course Coordinator Chandrasheel Bhagwat

5 Nature of Course L- lectures alone

 Analysis (MTH 311) or an equivalent undergraduate

6 Pre requisites analysis course or a prior consent of instructor
 Some basic knowledge of Complex Analysis is
useful but not mandatory.
 Attending Measure theory and Integration (MTH
421) course side-by-side will be helpful for this
course but it is not mandatory.

Objectives: An introduction to the measure theoretic

foundation of Probability Theory ( à la Kolmogorov),
generalizing some of the notions learnt in elementary
probability courses e.g. density and distribution, mean,
variance, learning some new concepts like
Objectives & convergence of random variables, conditional
7 Outcomes expectations and martingales,

Open in semesters: BS-MS Semester 7 and iphd

Semester 1, 3

Outcomes: After taking this course, you are expected

to get a familiarity with the general theoretical aspects
of probability spaces and random variables with a good
working knowledge of some concrete examples. This
course will lay a good foundation for the course
‘Stochastic Processes’ which will be offered in Spring
2019 (this course is a prerequisite for it.)
  Measure theoretic preliminaries: σ-algebras,
Probability spaces and probability measures:
Examples and properties, Random Variables,
Integration of a random variable on a probability
space, Product of probability spaces, Various
notions of convergence (L^2, almost surely etc.) of
a sequence of random variables
…(8-10 lectures)
8 Course contents
 Basics of probability spaces and random variables:
Distribution of a random variable, Examples of
various discrete / continuous distributions on real
line, Markov’s inequality, Chebyshev’s inequality,
Characteristic function and Moment generating
function of a random variables
…(8-10 lectures)

 Weak convergence and other limit theorems: Weak

convergence of a sequence of random variables,
Independence and convolution, Weak law of large
numbers, Strong law of large numbers, Central limit
theorem for i.i.d. random variables
…(6-8 lectures)

Dependent random variables, martingales and Markov

chains: Conditional expectation , Conditional
Probability, Martingales: Definition and examples,
properties, Martingale convergence theorem, Doob
decomposition theorem, Stopping times, Up-crossing
inequality, Markov chains: Definition and examples,
random walks on real line and plane, Stationary
distribution …(10-
12 lectures)

Evaluation  End-sem examination

/assessment 30%
evaluation  Mid-sem examination
9 components with 30%
weight  Continuous Assessment
 Quizzes
30%
 Reading project and presentation
10%
 Suggested readings Main text book: Probability Theory by S. R. S.
10 Varadhan, Courant Lecture Notes , Published by AMS,
Indian edition 2014

Other readings: Will be communicated later.

1 Course code MTH 417

2 Course Title Ordinary Differential Equations

3 Credits 4

4 Course Coordinator & Diganta Borah

participating faculty(if
any)

5 Nature of Course Lectures only

(Please mark or tick

the appropriate one)

6 Pre requisites Calculus and linear algebra

7 Objectives (goals, This course intends to offer an introduction to

type of students for ordinary differential equations (ODEs) with an
whom useful, outcome emphasis on dynamical systems. In the first half of
the course we will deal with linear systems of ODEs
etc)
and in the second half we will study qualitative theory
of nonlinear systems.

Open in BS-MS semester 7 and iphd semesters 1, 3

8 Course contents Linear systems of ODEs, planar linear systems,
phase portraits for planar systems, classification of
(details of topics
/sections with no. of planar systems, higher-dimensional linear systems,
lectures for each) nonautonomous linear systems (18 Lec)

Nonlinear systems of ODEs, dynamical systems,

existence and uniqueness theorem, continuous
dependence of solutions, variational equations,
nonlinear sinks and sources, linearization, saddles,
stable curve theorem, stability of equilibria, Liapunov
stability, gradient systems, Hamiltonian systems,
closed orbits and limit sets, the Poincare map,
Poincare-Bendixson theorem (18 Lec)

9 Evaluation Endsem 30%

/assessment Midsem 30%
Quizzes 40%
(evaluation
components with
weightage, Pl keep
equal weightage for
end sem and mid
sem exams)

10 Suggested readings 1. Morris W. Hirsch, Stephen Smale, Robert L.

Devaney, Differential equations, dynamical
(with full list of systems, and an introduction to chaos,(2004)
authors, publisher, Elsevier Academic Press
year, edn etc.)

2. George F. Simmons, Differential equations with

applications and historical notes, (1991) McGraw
Hill

1 Course code MTH 421

2 Course Title Measure Theory and Integration

3 Credits 4

4 Course Coordinator & Debdip Ganguly

participating faculty(if
any)

5 Nature of Course

(Please keep the L&T- Lectures & Tutorials

appropriate one only)

6 Pre requisites(if any) Basic Real analysis

7 Objectives & Objectives: This is one of the basic course in

Outcomes (goals, Analysis. The main objective is to develop problem
students for whom solving skill.
offered, outcomes
etc) Open in sem - Integrated PhD semesters 1,3 and
VII semester BS-MS students.

Outcomes:
8 Course contents As given in the curriculum

(section wise listing of

topics with no. of
lectures for each)

9 Evaluation a. End-sem examination- 30%

/assessment
b. Mid-sem examination- 30%
evaluation
components with c. Continuous Assessment – 30%
weightage, Pl keep d. Quiz-10
weightage for end
sem exam-30-
40%,mid sem exam-
30-40% & continuous
 assessment-30-40%

10 Suggested readings 1. Real Analysis: H. L. Royden (1997) Prentice-Hall.

2. Real and Complex Analysis: W. Rudin (2006)
(full list with authors, McGraw Hill.
publisher, year, edn
etc. for each)

1 Course code MTH 414

2 Course Title Representation theory of Compact Lie Groups

3 Credits 4

4 Course Coordinator A. Raghuram

5 Nature of Course L- lectures alone

6 Pre requisites(if any) Linear Algebra, Multivariable Calculus (Core

courses); one of Analysis, Topology or Calculus on
manifolds; Group theory.

(A student not meeting some of these pre-reqisites

may talk to me to see if they have enough
mathematical maturity to take such a course.)
7 Objectives & Outcomes Objectives: This course concerns some beautiful
(goals, students for mathematics which is at the confluence of two of the
whom offered, most important theories: Representation Theory,
which studies the action of groups on vector spaces,
outcomes etc)
and Lie Theory, the Cartan—Weyl classification of
Lie groups (these being groups that are also smooth
manifolds) is considered one of the crowning
achievements of 20th century mathematics.
Representation theory of Lie groups is a subject
relevant to both mainstream pure mathematics and
theoretical physics; it’s a very active and fertile area
of research. This course will introduce an advanced
undergraduate student to the very basics of these
subjects.
Open in sem: VII semester BS-MS, and 1 or 3
semester iPhD.
8 Course contents The syllabus will include the topics listed below; the
lectures need not be in the same order.
(section wise listing of
topics with no. of Elementary representation theory of a compact
lectures for each) topological group (including finite groups): conjugacy
classes, irreducible representations, induced
representations, character theory, Schur’s
orthogonality relations, Peter-Weyl theory.
Very basic Lie theory: the dictionary between Lie
groups and Lie algebras. Lots of examples about
classical Lie groups such as GL(n), SL(n), U(n),
SO(n), Sp(n), etc., and their corresponding Lie
algebras.
The representation theory of the Lie algebra
sl(2,C).
Maximal tori in compact Lie groups and highest
weight theory. (The depth to which this topic will be
covered depends on time and mood of the class, as
it is an advanced topic.)
Examples of finite groups or compact (Lie)
groups:

 Dihedral groups (symmetries of an n-gon).

 Permutation groups S_n, and alternating

 groups, A_n (esp., for small n).

 GL(2,F_q) for a finite field F_q, which is an

example of a Lie group of finite type.

 Compact Lie groups: SO(n), SU(n) (esp., for

small n). (Comparing SU(2) with SO(3) will
play an important role in the course.)

 SL(1,D) for a division algebra D over a locally

compact field.

 Galois groups, and profinite groups.

Note: The emphasis will be on computations with
low-dimensional examples. During the course, we
will pick up the relevant (multi-)linear algebra and
smooth manifold theory that will be needed. The
student should gain an appreciation for the idea that
the same basic principles apply to a wide variety of
examples as listed in the last bulleted item above.
Such an appreciation is a big part of one’s maturing
into an active mathematician. One need not know
everything about something to get started in
research, rather, one needs to grasp some basic
principles and see how to apply them across a wide
spectrum of seemingly different contexts.

9 Evaluation a. End-sem examination - 35%

/assessment
b. Mid-sem examination - 35%

c. Continuous Assessment - 30%

10 Suggested readings Representations of Compact Lie groups, by

Theodor Bröcker and Tammo tom Dieck, Springer
(full list with authors, GTM, Vol. 98. 1995. (Chapters 1, 2 and 3.)
publisher, year, edn
etc. for each) Lie groups beyond an introduction, by Anthony
Knapp, Birkhaüser, PM 140, 1996. (Chapter 4.)
Representation Theory, by William Fulton and Joe
Harris, Springer GTM, Vol. 129, 1991. (Parts I and
II.)