Déposez votre fichier ici pour le déplacer vers cet enregistrement.
Research talks;Combinatorics;Number Theory
The notion of quasi-random graphs was introduced in 1987 by F. R. K. Chung, R. L. Graham and R. M. Wilson, resp. A. Thomason. It has been shown that there is a strong connection between this notion and the pseudorandomness of (finite) binary sequences. This connection can be utilized for constructing large families of quasi-random graphs by considering graphs defined by a circular adjacency matrix whose first column is a binary sequence with strong pseudo-random properties. Starting out from this construction principle one may extend, generalize and sharpen some definitions and results on quasi-randomness of graphs.
The notion of quasi-random graphs was introduced in 1987 by F. R. K. Chung, R. L. Graham and R. M. Wilson, resp. A. Thomason. It has been shown that there is a strong connection between this notion and the pseudorandomness of (finite) binary sequences. This connection can be utilized for constructing large families of quasi-random graphs by considering graphs defined by a circular adjacency matrix whose first column is a binary sequence with ...
11K45 ; 11K36 ; 11K31 ; 05C80 ; 05Cxx
... Lire [+]
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
- xviii; 512 p.
ISBN 978-0-521-13656-3
Cambridge studies in advanced mathematics , 0105
Localisation : Ouvrage RdC (TAO)
analyse combinatoire # analyse de Fourier # arithmétique additive # théorème de Green-Tao # progression arithmétique # distance de Erdös # évaluation de somme-produit
11-02 ; 05-02 ; 05D10 ; 05D40 ; 11B75 ; 11B13 ; 11N13 ; 11P70 ; 11K31 ; 11P82 ; 28D05 ; 37A45
... Lire [+]
