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.
Let P be a set of n > d points in for d >= 2. It was conjectured by Zvi Schur that the maximum number of (d-1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P, is n. We prove this statement under the condition that any ...
Founders benefit from identifying with their founding teams because identification facilitates cooperation in the team, aligns founders' actions with the norms and interests of the team, and, ultimately, enhances team performance. High identification with ...
We investigate the extent to which the class of Dirac materials in two-dimensions provides general statements about the behavior of both fermionic and bosonic Dirac quasiparticles in the interacting regime. For both quasiparticle types, we find common feat ...
We discovered a mistake in Eqs. (7) and (10) of Saglia et al. (2010, A&A, 524, A6), which propagates to Tables 8 and 9 and Fig. 25. We revise the tables, the figure and the affected statements in the paper. As a result, the reduction in the luminosity evol ...
Bayesian estimation problems involving Gaussian distributions often result in linear estimation techniques. Nevertheless, there are no general statements as to whether the linearity of the Bayesian estimator is restricted to the Gaussian case. The two comm ...
The performance of programs written in languages following the dataflow model of computation (MoC) largely depends on the configuration (partitioning, mapping, scheduling, buffer dimensioning) chosen during the synthesis stages. Furthermore, this programmi ...
There is a classical "duality" between homotopy and homology groups in that homotopy groups are compatible with homotopy pullbacks (every homotopy pullback gives rise to a long exact sequence in homotopy), while homology groups are compatible with homotopy ...
A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...
We prove a lower bound on the number of ordinary conics determined by a finite point set in R-2. An ordinary conic for S subset of R-2 is a conic that is determined by five points of S and contains no other points of S. Wiseman and Wilson proved the Sylves ...
Currently used methods for the description of thermodynamics of ferroelectric thin films (Landau theory or ab initio based Monte Carlo simulations) are based on an energy expansion in terms of internal degrees of freedom. It was shown that these methods ca ...