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.
We prove that the category of systems of sesquilinear forms over a given hermitian category is equivalent to the category of unimodular 1-hermitian forms over another hermitian category. The sesquilinear forms are not required to be unimodular or defined o ...
Vision systems built around conventional image sensors have to read, encode and transmit large quantities of pixel information, a majority of which is redundant. As a result, new computational imaging sensor architectures were developed to preprocess the r ...
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if logr/logs is irrational and X and Y are ×r- and ×s-invariant subsets of [0,1], respectively, then $\dim_\text{ ...
We prove the existence of an affine paving for the three-step flag Hilbert scheme that parametrizes flag of three 0-dimensional subschemes of length, respectively, n, n+1 and n+2 that are supported at the origin of the affine plane. This is done by showing ...
In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...
Background: Global analyses of gene expression during development reveal specific transcription patterns associated with the emergence of various cell types, tissues, and organs. These heterogeneous patterns are instrumental to ensure the proper formation ...
This paper presents an extension of the graphic-statics-based framework called Combinatorial Equilibrium Modelling (CEM). CEM allows for the generation of topologically and combinatorially different spatial equilibrium solutions in the early explorative de ...
2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. We investigate upper bounds on the product of the number of facets and the number ...
This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C ava ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial version of the Borsuk-Ulam theorem). We show how this method can be applied to obtain a related recent result of Simonyi and ev ...