Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper we discuss the use of the sum-factorization for the calculation of the integrals arising in Galerkin isogeometric analysis. While introducing very little change in an isogeometric code based on element-by-element quadrature and assembling, th ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
Given a system with n>3t+1 processes, where t is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in O(t) expected running time. This improves the O(n2) expected running ...
