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.
We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation x2 + y2 + z2 = xyz modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short cycles in these gr ...
Homomorphic encryption, which enables the execution of arithmetic operations directly on ciphertexts, is a promising solution for protecting privacy of cloud-delegated computations on sensitive data. However, the correctness of the computation result is no ...
The paper presents a low-power transmitter (TX) as a part of a fully integrated 57-66 GHz FMCW radar system. The TX path includes a BPSK modulator and it is optimized for short-range operation with 0 dBm output power. A band-tuning technique is used for co ...
We show that mixed-characteristic and equicharacteristic small deformations of 3-dimensional canonical (resp., terminal) singularities with perfect residue field of characteristic p>5 are canonical (resp., terminal). We discuss applications to arithmetic a ...
We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure ('length') of nodal intersections against a smooth 2-dimensional toral sub-manifold ('surface'). A prior result of ours pr ...
We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...
Without resorting to complex numbers or any advanced topological arguments, we show that any real polynomial of degree greater than two always has a real quadratic polynomial factor, which is equivalent to the fundamental theorem of algebra. The proof uses ...
A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer k and every δ>0 there exists n such that every subset of ${1, ...
Abelian varieties are fascinating objects, combining the fields of geometry and arithmetic. While the interest in abelian varieties has long time been of purely theoretic nature, they saw their first real-world application in cryptography in the mid 1980's ...
We confirm, for the primes up to 3000, the conjecture of Bourgain-Gamburd-Sarnak and Baragar on strong approximation for the Markoff surface modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some natural graphs constructed fro ...