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 some new cases of the Grothendieck-Serre conjecture for classical groups. This is based on a new construction of the Gersten-Witt complex for Witt groups of Azumaya algebras with involution on regular semilocal rings, with explicit second residue ...
We study correlation functions involving generalized ANEC operators of the form integral dx-x-n+2T--x -> in four dimensions. We compute two, three, and ...
In this text, we will show the existence of lattice packings in a family of dimensions by employing division algebras. This construction is a generalization of Venkatesh's lattice packing result Venkatesh (Int Math Res Notices 2013(7): 1628-1642, 2013). In ...
In this article, we prove that double quasi-Poisson algebras, which are noncommutative analogues of quasi-Poisson manifolds, naturally give rise to pre-Calabi-Yau algebras. This extends one of the main results in [11], where a correspondence between certai ...
In this thesis, we study interactions between algebraic and coalgebraic structures in infinity-categories (more precisely, in the quasicategorical model of (infinity, 1)-categories). We define a notion of a Hopf algebra H in an E-2-monoidal infinity-catego ...
In this thesis, we give a modern treatment of Dwyer's tame homotopy theory using the language of ∞-categories.We introduce the notion of tame spectra and show it has a concrete algebraic description.We then carry out a study of ∞-operads and ...
This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...
We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...
We give a direct construction of a specific central idempotent in the endomorphism algebra of a finite lattice T. This idempotent is associated with all possible sublattices of T which are totally ordered. A generalization is considered in a conjectural fa ...
The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous difficulties, wher ...
