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 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 ...
A long-standing conjecture of Richter and Thomassen states that the total number of intersection points between any n simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same point, is at least ...
Let F-q be a finite field of q elements, where q is a large odd prime power and Q = a(1)x(1)(c1) + ..... + a(d)x(d)(cd) is an element of F-q[x(1) ,...,x(d)], where 2
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/ ...
Let ES(n) denote the minimum natural number such that every set of ES(n) points in general position in the plane contains n points in convex position. In 1935, ErdAs and Szekeres proved that ES. In 1961, they obtained the lower bound , which they conjectur ...
We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set of n points determines o(n) distinct distances, then no line contains Omega(n (7/8)) points of and no circle contains Omega ...
System comprising at least one sensor configured to take a set of images from different viewpoints of a scene; a processor configured to identifying a point source represented in the images of a set of images; computing for each image of the set of images ...
We prove that a general condition introduced by Colombo and Gobbino to study limits of curves of maximal slope allows us to characterize also minimizing movements along a sequence of functionals as curves of maximal slope of a limit functional. ...
Our motivation is the design of efficient algorithms to process closed curves represented by basis functions or wavelets. To that end, we introduce an inner-product calculus to evaluate correlations and L2 distances between such curves. In partic ...
Robust programs with modulated uncertainty sets are problems in which the uncertainty sets are treated as optimization variables. In many applications, these uncertainty sets can be interpreted as reserve capacities for which rewards are offered. One examp ...