webcal
 Month:  Apr 2018 May 2018 Jun 2018 Jul 2018 Aug 2018 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 Week:  Sep 10 - Sep 14 Sep 17 - Sep 21 Sep 24 - Sep 28 Oct 1 - Oct 5 Oct 8 - Oct 12 Oct 15 - Oct 19 Oct 22 - Oct 26 Oct 29 - Nov 2 Nov 5 - Nov 9 Nov 12 - Nov 16 Nov 19 - Nov 23 Nov 26 - Nov 30 Dec 3 - Dec 7 Dec 10 - Dec 14 Dec 17 - Dec 21 Year:  2016 2017 2018 2019 2020 2021 2022 2023 Login

## Anand Srivastav Kiel University Germany

 Description: One-Sided Multicolor Discrepancy of Hyperplanes over Finite Fields Anand Srivastav Kiel University Germany Abstract: We investigate the multicolor discrepancy and the one-sided multicolor discrepancy of linear hyperplanes in the finite vector space $F_{q}^{r}$. We show that the one-sided discrepancy is bounded from below by $\Omega_{q}\left(\sqrt{n/c}\right)$, $c$ the number of colors, using Fourier analysis on $\mathbb{F}_{q}^{r}$. We also show an upper bound of of $O_{q}(\sqrt{n\log c})$. The upper bound is derived by the $c$--color extension of Spencer's six standard deviation theorem and is also valid for the one-sided discrepancy. Thus, the gap between the upper and lower bound for the one-sided discrepancy is a factor of $\sqrt{c\log c}$ and the bounds are tight for any constant $c$ and $q$. For large $c$, more precisely for $c\geq qn^{1/3}$, we reduce this gap to a factor of $\sqrt{\log c}$. All together this exhibits a new example of a hypergraph with (almost) sharp discrepancy bounds. Location: Ramanujan Hall, Department of Mathematics Date: Tuesday, November 28, 2017 Time: 11:00am-12:00pm IST Duration: 1 hour Access: Public