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 F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...
It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...
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 ...
We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...
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)
This work examines the problem of graph learning over a diffusion network when measurements can only be gathered from a limited fraction of agents (latent regime). Under this selling, most works in the literature rely on a degree of sparsity to provide gua ...
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 ...
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/ ...
The present thesis deals with problems arising from discrete mathematics, whose proofs make use of tools from algebraic geometry and topology. The thesis is based on four papers that I have co-authored, three of which have been published in journals, and o ...
Let B-M : C x C -> C be a bilinear form B-M(p, q) - p(T)Mq, with an invertible matrix M is an element of C-2x2. We prove that any finite set S contained in an irreducible algebraic curve C of degree d in C determines Omega(d)(vertical bar S vertical bar(4/ ...
