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.
Higher Green functions are real-valued functions of two variables on the upper half-plane, which are bi-invariant under the action of a congruence subgroup, have a logarithmic singularity along the diagonal, and satisfy the equation f = k(1−k) f ; here i ...
A recently found local-global principle for quadratic forms over function fields of curves over a complete discretely valued field is applied to the study of quadratic forms, sums of squares, and related field invariants. ...
A Method for nuclear magnetic resonance (NMR) spectroscopy of a sample comprising the following steps: (a) excitation of long lived coherences (LLC) between the singlet state So and the central triplet state To of nuclei of the sample by initiating irradia ...
We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...
Given a sequence of positive integers , let denote the family of all sequences of positive integers such that for all . Two families of sequences (or vectors), , are said to be -cross-intersecting if no matter how we select and , there are at least distinc ...
For positive integers w and k, two vectors A and B from Z(w) are called k-crossing if there are two coordinates i and j such that A[i] - B[i] >= k and B[j] - A[j] >= k. What is the maximum size of a family of pairwise 1-crossing and pairwise non-k-crossing ...
In an earlier work, we constructed the almost strict Morse n-category X which extends Cohen Sz Jones Sz Segal's flow category. In this article, we define two other almost strict n-categories V and W where V is based on homomorphisms between real vector spa ...
Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optim ...
A CMOS image sensor including at least one pixel and one circuit arranged to receive, on a first node of the circuit, an analog signal representative of the luminosity level received by the pixel, the circuit being capable of successively acquiring 2n samp ...
Lattice codes are applied to the two-user Gaussian multiple access channel (MAC) combined with a modified compute-and-forward transmitting scheme. It is shown that non-corner points on the boundary of the capacity region can be achieved by decoding two int ...
