webcal
 Month:  Sep 2018 Oct 2018 Nov 2018 Dec 2018 Jan 2019 Feb 2019 Mar 2019 Apr 2019 May 2019 Jun 2019 Jul 2019 Aug 2019 Sep 2019 Oct 2019 Nov 2019 Dec 2019 Jan 2020 Feb 2020 Mar 2020 Apr 2020 May 2020 Jun 2020 Jul 2020 Aug 2020 Sep 2020 Week:  Feb 11 - Feb 15 Feb 18 - Feb 22 Feb 25 - Mar 1 Mar 4 - Mar 8 Mar 11 - Mar 15 Mar 18 - Mar 22 Mar 25 - Mar 29 Apr 1 - Apr 5 Apr 8 - Apr 12 Apr 15 - Apr 19 Apr 22 - Apr 26 Apr 29 - May 3 May 6 - May 10 May 13 - May 17 May 20 - May 24 Year:  2017 2018 2019 2020 2021 2022 2023 2024 Login

## S. Venkitesh (IITB)

 Description: Combinatorics Seminar Title: Lift of Reed-Solomon code with an application to Nikodym sets Speaker: S. Venkitesh (IITB) Date and Time: Feb 14, 2018, 2PM Venue: Ramanujan Hall, Dept. of Mathematics Abstract: We will work over the finite field F_q, q = p^k. The Reed-Solomon code with parameters (q,d), denoted as RS(q,d), is the linear space of all polynomial functions from F_q to F_q with degree atmost d. The Reed-Muller code with parameters (q,m,d), denoted as RM(q,m,d), is the m-variable analog of RS(q,d), defined to be the linear space of all polynomial functions from F_q^m to F_q with total degree atmost d. A nonempty set N in F_q^m is called a Nikodym set if for every point p in F_q^m, there is a line L passing through p such that all points on L, except possibly p, are contained in N. Using the polynomial method and the code RM(q,m,q-2), we can prove the lower bound |N| >= q^m / m!. We will outline this proof. We will then define a new linear code called the m-lift of RS(q,d), denoted as L_m(RS(q,d)), and show that RM(q,m,d) is a proper subspace of L_m(RS(q,d)). We will use this fact crucially, in a proof very similar to the earlier one, to obtain the improved lower bound |N| >= (1 - o(1)) * q^m, when we fix p and allow q to tend to infinity. This result is due to Guo, Kopparty and Sudan. Location: Ramanujan Hall, Department of Mathematics Date: Wednesday, February 14, 2018 Time: 2:00pm IST Access: Public