Publications associées (7)

A higher homotopic extension of persistent (co)homology

Our objective is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of a simplicial set embedded in induces a multiplicative filtration on the dg algebra of simplicial cochains, w ...
2018

Relative Homological Algebra Via Truncations

Jérôme Scherer

To do homological algebra with unbounded chain complexes one needs to first find a way of constructing resolutions. Spal-tenstein solved this problem for chain complexes of R-modules by truncating further and further to the left, resolving the pieces, and ...
FIZ KARLSRUHE-LEIBNIZ-INST INFORMATIONSINFRASTRUKTUR2018

Spectral sequences associated to deformations

Lapin has constructed a multiplicative spectral sequence from a deformation of an -algebra. In particular, as noted by the same author, one can apply this construction to a deformation induced by a filtration of an -algebra. A question that naturally appea ...
2017

Injective Classes of Modules

Jérôme Scherer

We study classes of modules over a commutative ring which allow to do homological algebra relative to such a class. We classify those classes consisting of injective modules by certain subsets of ideals. When the ring is Noetherian the subsets are precisel ...
2013

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

Randomization in the two-parameter optimal stopping problem

Robert Dalang

The motivation to this research is the study of the optimal stopping problem for multiparameter processes : given a random process depending on finitely many parameters t = (t1,…,tn), which if stopped at point t in the parameter set produces a reward Xt, w ...
EPFL1987

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.