Videolibrary
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Video Library
Archive
Most viewed videos

Search
RSS
New in collection






Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2018
November 21, 2018 14:30–14:45, Moscow, Steklov Mathematical Institute of RAS, Conference Hall (8 Gubkina)
 


On subgraphs of random Cayley sum graphs

S. V. Konyagin, I. D. Shkredov
Video records:
MP4 380.0 Mb
MP4 172.6 Mb

Number of views:
This page:216
Video files:47
Youtube Video:

S. V. Konyagin, I. D. Shkredov
Photo Gallery


Видео не загружается в Ваш браузер:
  1. Проверьте с Вашим администратором, что из Вашей сети разрешены исходящие соединения на порт 8080
  2. Сообщите администратору портала о данной ошибке



Abstract: Let $G$ be a finite sufficiently large additive group and $A$ be a random subset of $G$ such that any element of $A$ belongs to $A$ with probability $1/2$. Mrazovic showed recently that with the probability tending to one the set $A$ does not contain all sums $B+C$ of subsets of $G$ with $|B|, |C| \ge (\log |G|)^{2+o(1)}$. S. V. Konyagin and I. D. Shkredov improved the last result showing that the bound can be refined to $\log |G| (\log \log |G|)^C$ for a certain absolute $C>0$. Moreover under these conditions just a half of sums of $B+C$ belongs to $A$ and up to ($\log \log |G|)^C$ factors the result is tight.

Related articles:

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021