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.
The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. We determine exactly which simple correspondence functors are projective. We also determine which simple ...
During an earthquake, frictional rupture fronts mainly propagate at subshear speedalong tectonic faults. However, evidences of supershear propagation have been re-ported in several occasions. Contrarily to subshear, supershear rupture results in highstress ...
We show that for m points and n lines in R-2, the number of distinct distances between the points and the lines is Omega(m(1/5)n(3/5)), as long as m(1/2)
Given n continuous open curves in the plane, we say that a pair is touching if they have finitely many interior points in common and at these points the first curve does not get from one side of the second curve to its other side. Otherwise, if the two cur ...
In the context of dynamic fracture propagation along an heterogeneous domain, it has been shown in [1] how the presence of small-scale heterogeneities can impact the rupture dynamics of a crack. In the particular case of a mode-II crack propagating along a ...
In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer n≥3, we define e(n) to be the minimum positive integer such that an ...
We show that any set of n points in general position in the plane determines n(1-o(1)) pairwise crossing segments. The best previously known lower bound, Omega(root n), was proved more than 25 years ago by Aronov, Erdos, Goddard, Kreitman, Krugerman, Pach, ...
Globalization's intertwining of culturally and linguistically diverse peoples is empowered and reflected by an unprecedented worldwide lingua franca. This current state of affairs seems unproblematic if, following a simple utilitarian view, language merely ...
Let S be a set of n points in R-2 contained in an algebraic curve C of degree d. We prove that the number of distinct distances determined by S is at least c(d)n(4/3), unless C contains a line or a circle. We also prove the lower bound c(d)' min{m(2/3)n(2/ ...
