Evènement pour le groupe
GT Graphes et Applications
Date | 2013-11-22 15:15-16:15 |
Titre | Maximal cliques in Paley graphs |
Résumé | For infinitely many primes p = 4k + 1 we give a slightly improved upper bound for the maximal cardinality of a set B subset Z_p such that the difference set B − B contains only quadratic residues. Namely, instead of the ”trivial” bound |B| ≤ sqrt{p} we prove |B| ≤sqrt{p} − 1, under suitable conditions on p. The new bound is valid for approximately three quarters of the primes p = 4k + 1.
Joint result with C. Bachoc and I. Z. Ruzsa. |
Lieu | Salle 178 |
Orateur | Mate Matolcsi |
Aucun document lié à cet événement.
RetourRetour à l'index