Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
It is well-known that a finite group possesses a universal central extension if and only if it is a perfect group. Similarly, given a prime number p, we show that a finite group possesses a universal p′-central extension if and only if the p′-part of its a ...
The Weil-Barner explicit formula is applied to the prime counting function and to the problem of numerical partial verification of the Riemann hypothesis. ...
We prove that the Kloosterman sum changes sign infinitely often as runs over squarefree moduli with at most 10 prime factors, which improves the previous results of Fouvry and Michel, Sivak-Fischler and Matomaki, replacing 10 by 23, 18 and 15, respectively ...
Different combinations of forward and backward masking as well as interocular suppression have been used extensively to render stimuli invisible and to study those aspects of visual stimuli that are processed in the absence of conscious experience. Althoug ...
Let k be an algebraically closed field of characteristic p, where p is a prime number or 0. Let G be a finite group and ppk(G) be the Grothendieck group of p-permutation kG-modules. If we tensor it with C, then Cppk becomes a C-linear biset functor. Recall ...
We revisit a recent bound of I. Shparlinski and T. Zhang on bilinear forms with Kloosterman sums, and prove an extension for correlation sums of Kloosterman sums against Fourier coefficients of modular forms. We use these bounds to improve on earlier resul ...
Factoring-based public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off process ...
Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and ev ...
Institute of Electrical and Electronics Engineers2013
Let k be a field of characteristic p, where p is a prime number, let pp_k(G) be the Grothendieck group of p-permutation kG-modules, where G is a finite group, and let Cpp_k(G) be pp_k(G) tensored with the field of complex numbers C. In this article, we fin ...
Responses to a target can be sped up or slowed down by a congruent or incongruent prime, respectively. Even though presentations are rapid, the prime and the target are thought to activate motor responses in strict sequence, with prime activation preceding ...
Association for Research in Vision and Ophthalmology2013
