Concept

Foncteur représentable

Publications associées (62)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The Leaf Space Of A Multiplicative Foliation

Madeleine Jotz

We show that if a smooth multiplicative subbundle S subset of T G on a groupoid G P is involutive and satisfies completeness conditions, then its leaf space G/S inherits a groupoid structure over the space of leaves of TP boolean AND S in P. As an applicat ...

Amer Inst Mathematical Sciences2012

Iron-Catalyzed [3+2] Annulation of Aminocyclopropanes with Aldehydes: Stereoselective Synthesis of Aminotetrahydrofurans

Jérôme Waser, Fides Benfatti, Florian Patrick Marie Daniel De la Barre De Nanteuil

The first method for the [3 + 2] annulation of donor acceptor aminocyclopropanes with aldehydes is reported. The reaction is catalyzed by iron trichlorlde on alumina in yields up to 99% and with excellent cis selectivities (up to >20:1) and represents a st ...

American Chemical Society2012

Complete genome sequence of the sulfate-reducing Firmicute Desulfotomaculum ruminis type strain (DLT)

Rizlan Bernier-Latmani

Desulfotomaculum ruminis Campbell and Postgate 1965 is a member of the large genus Desulfotomaculum which contains 30 species and is contained in the family Peptococcaceae. This species is of interest because it represents one of the few sulfate-reducing b ...

Genomic Stand Consort2012

Homotopic Descent over Monoidal Model Categories

The starting point for this project is the article of Kathryn Hess [11]. In this article, a homotopic version of monadic descent is developed. In the classical setting, one constructs a category D(𝕋) of coalgebras in the Eilenberg-Moore category of ...

EPFL2011

Chemistry and Biology of Natural Products

Jean-Yves Wach

This thesis is divided in four independent parts related to four different research projects. Each chapter describes one of the multiple aspects covered by organic chemistry, such as the generation of functional interfaces, understanding of biological proc ...

EPFL2011

Every graph admits an unambiguous bold drawing

János Pach

Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a b ...

Springer-Verlag Berlin2011

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

A Tighter Analysis of Work Stealing

Nicolas Gabriel Gast, Denis Trystram

Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost for managing a single centralized list becomes prohibitive. The objective of this wor ...

Springer Berlin Heidelberg2010

Categorical Foundations for K-theory

Nicolas Mathieu Michel

K-Theory was originally defined by Grothendieck as a contravariant functor from a subcategory of schemes to abelian groups, known today as K0. The same kind of construction was then applied to other fields of mathematics, like spaces and (not necessarily c ...

EPFL2010

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010