This course is intended to familiarize the students with the types of mathematical reasoning found in theoretical research on computing and communications. The course contains a broad set of intermediate and advanced level topics in Algebra, Combinatorics, Probability and Graph Theory.

**Goal**: By the end of the course, students should be able to read and understand research papers with algebraic/combinatorial reasoning. They should should be able to write concise and clear proofs.

**Prerequisites**: Students are expected to have already attended Discrete Maths, Linear Algebra and Probability courses some time in their career. Though we will be revising these in a few lectures, the course will quickly move on to advanced topics.

**Acknowledgements**: This course is loosely based on a similar course offered by Jaikumar Radhakrishnan (http://www.tcs.tifr.res.in/~jaikumar/Courses/MathStructures/Autumn06/) at TIFR, Mumbai.

Assignment Tests: 20%

- Practice problems will be given after each lecture.
- There will be a test based on practice problems (5 in total) with 5 marks each. The best 4 marks will be used for grading.

Quiz 1, Quiz 2: 10% each

MidSem: 25%

EndSem: 35%

Bonus Marks: 5% (for 90% attendance or solve some hard problem that will be given).

**Lec 1: Operator | Associativity | Groups | Subgroups | Integer Subgroups | Cyclic Groups***Read*: [MA] Chapter 2, Section 1,2. [TJ] Chapter 3, 4*Solve*:- Prove that there is a unique Identity element for any group.
- [MA] Chapter 2 Exercies, Section 1 Question 5, Section 2 (Page 70) Question 10
- [TJ] Section 3.4: Problems 2, 10

**Lec 2: Burnside / Pólya Counting***Read*: [JM] Chapter 22, 23. Alon Frieze’s Slides*Solve*: [JM] 23.4 Exercises (Lecture 23), 1, 3

**Lec 3: Isomorphisms | Homomorphisms | Cosets | Legrange’s Theorem | Fermat Little Theorem | FLT Proof using Polya Counting***Read*: [MA] Chapter 2, Section 3, 4, 5, 6. For FLT Proof using Polya Counting see the blog post*Solve*:- If $G$ has no proper subgroups then show that $G$ is cyclic of order $p$, where $p$ is a prime number.
- If $G$ is not a cyclic group then show that $G$ has a proper subgroup (ie not ${0}$ or $G$ itself).
- A group is called Abelian if the operation is also commutative. Prove that
- Every finite cyclic group has to be an Abelian Group
- Give an example of a finite Abelian Group that is not cyclic.

- $\mathbb{Z}_p\times \mathbb{Z}_q$ is the product of the two sets with $pq$ elements. Addition is defined coordinate wise. Prove that:
- $\mathbb{Z}_p\times \mathbb{Z}_q$ is a group.
- Show that if $p, q$ is coprime (ie has gcd = 1) then $\mathbb{Z}_p \times \mathbb{Z}_q$ is isomorphic to $\mathbb{Z}_{pq}$.

Let $p$ be a prime and $n, k$ positive integers, $F = \left\{ f:\mathbb{Z}_p^k \rightarrow [n] \right\}$ (the set of all functions from $\mathbb{Z}_p^k$ to $[n]$.). For a function $f \in F$, and $a \in \mathbb{Z}_p^k$, the translation of $f$ by $a$ is the function $g(x) = f(x + a)$ (addition is defined coordinate-wise modulo $p$).

- Define a group and a group action of that group on $F$ that captures translations, which could be used to count the number of distinct functions with translation symmetry (ie. $f(x)$ and $g(x) = f(x + a)$ is in the same orbit).
- Let $a \in \mathbb{Z}^k_p \setminus \{ 0^k \}$ . What is the number of cycles in the permutation corresponding to the translation by $a$?
- Use above to show that $p^k$ divides $n^{p^k} - n^{p^{k-1}}$.

[Hint] This is the strict generalization of the example we did in class: the proof of FLT theorem. For getting that result, substitute $k=1$ and $n = a$.

A function $f:[m]^k \rightarrow [n]$ is symmetric if for all $x, y \in [m]^k$ such that $y$ can be obtained by permuting $x$ (using a permutation in $S_k$), $f(x) = f(y)$. For example the sum and product functions ($f(x) = \sum_{i\in [k]} x_i \mod n$ and $g(x) = \prod_{i\in [k]} x_i \mod n$ correspondingly) are symmetric. The Max, Min functions are also symmetric. Find the number of symmetric functions in terms of $m, n, k$. [Hint] Requires some ball and bins counting.

Let $k$ be prime and $\mathcal F = \left\{ f:[m]^k\rightarrow [n] \right\}$ (set of all functions from $[m]^k$ to $[n]$). $g$ is a cyclic reordering of $f$, if $\exists i \in [k]$ such that $g(x) = f(\sigma^i(x))$ where $\sigma^i(x) = x_i \cdots x_n x_1 \cdots x_{i-1}$. Find the number of distinct functions in $\mathcal F$ if cyclic reorderings are considered the same. Use this to show that $k$ divides $n^{m^k} - n^t$ where $t = \frac{m^k - m}{k} + m $.

**Lec 4: Counting | 12 fold way of Counting Balls and Bins***Read*: [CoCo] Sections 1 - 1.5.2*Solve*:- Let $k_1, k_2, …., k_n$ be numbers such that $ \sum_{i=1}^n i \cdot k_i = n$. Find the number of permutations of $[n]$, with $k_1$ cycles of length $1$, $k_2$ cycles of length $2$, $\cdots$, $k_n$ cycles of length $n$.
- Find a generating set of size $2$ for $S_n$. (Need to prove why your set generates $S_n$).

**Lec 5: 12 fold way of Counting Balls and Bins | Permutations | Inversions | Cycle Structure | Transpositions***Read*: [CoCo] Sections 1.5.2 - 1.7

**Lec 6: Cycle Structure | Parity of Permutation | Derangements | Inclusion Exclusion***Read*: [CoCo] Sections 1.7.1, 1.7.2, 1.7.3, Section 2 - 2.1.1.*Solve*:- Show that the set of even parity permutations form a subgroup of $S_n$ of size $n!/2$. Show that the set of odd partiy permutations is a coset of this subgroup.
- Let $A_1, \cdots, A_k \subseteq [n]$. For $S \subseteq [k]$, let $A_S = \cap_{s \in S} A_s$ and $A_\emptyset = [n]$. Then for $0 \leq r \leq k$, show that:
- For odd $r$, $$ \left| \overline{ \cup_{i \in k} A_k } \right| \geq \sum_{S \subseteq [k]: |S| \leq r } (-1)^{|S|} | A_S |$$
- For even $r$, $$ \left| \overline{ \cup_{i \in k} A_k } \right| \leq \sum_{S \subseteq [k]: |S| \leq r } (-1)^{|S|} | A_S | $$

**Tutorial 1****Test 1 | Lec 7: Inclusion Exclusion Examples***Read*: [CoCo] Section 2.*Solve*:- Consider the set of all functions from $[2n]$ to $[2n]$.
- Find the number of functions having size of the range to be exactly $k$.
- Find the number of functions for which the range is exactly the set of even numbers in $[2n]$.

- Consider the set of all functions from $[2n]$ to $[2n]$.

**Lec 8: Inclusion Exclusion | Proof using Linear Algebra***Read*:- [CoCo] Sections 2.1.2, 2.2.
- For Linear Algebra proof read RP Stanley pages 223-225.

*Solve*:Let $n \geq 2$ be a positive integer. The Euler totient function is defined by $\phi(n) = \left| \{ m: m < n \text{ and } \text{gcd}(m,n) = 1 \} \right|$. If the prime factorization of $n$ is $n = p_1^{e_1}\cdot p_2^{e_2} \cdots p_k^{e_k}$. Show using inclusion exclusion that: $$\phi(n) = n \prod_{i=1}^k \left(\frac{p_i - 1}{p_i}\right).$$

[Hint] Choose sets $A_1, \cdots, A_k$ that can easily be counted such that $\phi(n) = \left| \overline{A_1 \cup \cdots \cup A_k} \right|$.

**Office Hrs 1****Quiz I****Lec 9: Answer Discussion***Solve*:- Let $\mathcal B_n = \left\{ f:\{0,1\}^n \rightarrow \{0,1\} \right\}$ (the set of all Boolean functions). A function $f\in \mathcal B_n$, depends on $i$th coordinate ($i \in [n]$) if $\exists x_1, \cdots, x_{i-1}, x_{i+1}, \cdots, x_n \in \{0,1\}$ such that for $y = x_1 \cdots x_{i-1}0x_{i+1} \cdots x_n$, $y’ = x_1 \cdots x_{i-1}1x_{i+1} \cdots x_n$, $f(y) \neq f(y’)$. Find the number of functions which depends on all the coordinates in $[n]$.
- Let $k \geq r$. Prove Lec 6, Problem 2 by first showing that:
- For odd $r$, $$ {k \choose 0} - {k \choose 1} + \cdots + (-1)^r { k \choose r } \leq 0$$
- For even $r$, $$ {k \choose 0} - {k \choose 1} + \cdots + (-1)^r { k \choose r } \geq 0$$

**Lec 10: Families of Sets: Sperner’s Theorem | Intersecting Families | Hall’s Theorem (SDR)***Read*: [PJC] Chapter 7. [DG] Section 1.7 for Sperner’s Thm. Chapter 4 for SDR.*Solve*:- Let $n = 2k$. Show that there are $2^{2k−1 \choose k−1}$ intersecting families of $k$-element subsets of $[n]$ having the maximum number${2k−1 \choose k−1}$ of members.
- Show that, for every non-empty subset $A$ of $[n]$, there is an intersecting family $\mathcal{F}$ of subsets of $[n]$ of size $2^{n−1}$ with $A\in \mathcal F$. Show further that any two subsets $A,B$ with $A\cap B \neq \phi$ are contained in a family with these properties. What about three pairwise intersecting sets?

**Lec 11: System of Distinct Representatives | Erdős-Ko-Rado Theorem***Read*: [PJC] Chapter 7 (Appendix for Erdos-Ko-Rado). Chapter 4 for SDR.

**Lec 12: Rings, Fields and Vector Spaces I***Read*: [ADS] Chapter 16. [TJ] Chapter 16.

**Lec 13: Rings, Fields and Vector Spaces II**Mid Sem Exam

**Lec 14: Probability and Computing | PIT | Min Cut | Erdős Ko Rado***Read*- Min Cut: http://faculty.cs.tamu.edu/klappi/cpsc411s09/minimum_cut.pdf
- Probability Basics and EKR (Section 2.3): http://www.cs.cmu.edu/~15850/handouts/matousek-vondrak-prob-ln.pdf

*Solve*Suppose $A$ is a randomized algorithm for a decision problem ($0,1$ output) which takes $x \in \{0,1\}^n$ (where $n$ is a fixed number say $100$; we are not interested in all inputs which are infinite in number but only the $2^n$ inputs of length $n$) as input. Also suppose we provide all the randomness that the algorithm requires by giving it a string $r \in \{0,1\}^m$ which is chosen uniformly at random. You are told that for all inputs $x \in \{0,1\}^n$, the algorithm is correct with probability $1-\frac{1}{2^{n+1}}$. That is $$ \forall x \in \{0, 1\}^n, \Pr_{r \in \{0, 1\}^m}\left[A(x,r) \text{ is correct}\right] \geq 1 - \frac{1}{2^{n+1}}.$$ Then show that there is a fixed string $r \in \{0,1\}^m$ such that for every input $x\in \{0,1\}^n$, $A(x,r)$ is correct. That is $$ \exists r \in \{0,1\}^m, \forall x \in \{0,1\}^n, A(x,r) \text{ is correct}.$$

Let $p(x_1,x_2,\cdots,x_n)$ be a nonzero polynomial of total degree $d$ (maximum value among all monomials of the sum of degrees of each variable) on $n$ variables with coefficients from a finite field $\mathbb F$. Let $\alpha_1,\cdots, \alpha_n$ be chosen uniformly and independently from $\mathbb F$. Show that: $$ \Pr\left[p(\alpha_1,\cdots, \alpha_n) = 0 \right] \leq \frac{d}{|\mathbb F|}.$$ Hint: Use induction on number of variables $n$. Decompose the polynomial according to powers of $x_1$. Condition on appropriate event and upperbound the probability.

Suppose you have a fair coin (equal probability of heads and tails). You can use the coin to choose one among four options uniformly at random by tossing it twice and assigning the four outcomes to the four options.

- Can you use the fair coin to choose one among three options uniformly at random? Can it be done using a finite number of tosses?
- Can it be done using infinite number of tosses? If so, can you give a general method for uniformly choosing one among $k$ options (for any number $k$)?
- Using a finite number of tosses, can you choose one among three options “almost” or “approximately” uniform way? When would you say a distribution is almost uniform among three options (what is the mathematical definition of almost uniform)?
- Suppose you are given an unfair coin with probability of heads being $p<\frac{1}{2}$. Can you use the unfair coin to simulate a fair coin exactly or even approximately (that is choose 1 among 2 options uniformly)?

**Lec 15: Probabilistic Method***Read:*- [AZ] Proofs from the Book, Chapter 35

*Solve:*- Let $\sigma$ be a uniformly random permutation chosen from $S_n$. What is the expected number of fixed points ($i$ such that $\sigma(i)=i$) in $\sigma$? What about the expected number of cycles of length $2$? What about the expected number of cycles?
- Let $G$ be a random graph on $n$ nodes. That is each of the ${n \choose 2}$ edges is independently chosen with probability $\frac{1}{2}$. What is the expected number of simple cycles of length less than $\ell$?

**Lec 16: Probabilistic Method | Random Graphs***Read:*- 3SAT
^{7}⁄_{8}algorithm: https://i.cs.hku.hk/~hubert/teaching/c8601_2011/notes1.pdf - Method of conditional expectations: https://i.cs.hku.hk/~hubert/teaching/c8601_2011/notes2.pdf
- Large girth, large chromatic number graphs:
- [AZ] Proofs from the Book, Chapter 35.
- [AS] Page 38.

- 3SAT

**Lec 17: Tail Bounds | Chebyshev | Chernoff***Read:*- http://math.mit.edu/~goemans/18310S15/chernoff-notes.pdf
- We also used Chernoff’s Bound to amplify the probability of a weak algorithm to obtain a strong algorithm using Chebyshev and Chernoff’s Bounds.

**Lec 18: Introduction to Spectral Graph Theory***Read:*

**Lec 19: Random Walks, Eigen Values and Expanders**Quiz 2

**Error Correcting Codes | Reed Solomon Codes: 3 lecs (by Prof. Prasad)****Welsh Berelekamp Decoding Algorithm (Polynomial Method): 2 lecs (by Prof. Prasad)****Expanders | Codes | Hashing (2 lecs)**

There is no single book covering all the topics. For different lectures, we will be following material from different sources, which will be posted at the course page. Some of the sources that will be used often are:

[AZ] Proofs from the Book. Aigner and Ziegler

[AS] The Probabilistic Method. Alon and Sipser

[MA] Algebra by M Artin, Prentice-Hall India.

[TJ] Abstract Algebra: Theory and Applications Thomas W. Judson pdf

[ADS] Applied Discrete Structures, Al Doerr, Ken Levasseur pdf

[CoCo] Lecture Notes, Combinatorics Lecture by Torsten Ueckerdt (KIT) pdf

[JM] Permutation Puzzles: A Mathematical Perspective. Jamie Mulholland pdf

[PJC] Notes on Combinatorics Peter J. Cameron pdf

[DG] An Introduction to Combinatorics and Graph Theory David Guichard. pdf