Concept

Objet libre

Publications associées (20)

Multi-Level Monte Carlo Methods for Uncertainty Quantification and Risk-Averse Optimisation

This work aims to study the effects of wind uncertainties in civil engineering structural design. Optimising the design of a structure for safety or operability without factoring in these uncertainties can result in a design that is not robust to these per ...

EPFL2022

The algebra of Boolean matrices, correspondence functors, and simplicity

Jacques Thévenaz, Serge Bouc

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...

2020

Correspondence functors and lattices

Jacques Thévenaz, Serge Bouc

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. A main tool for this study is the construction of a correspondence functor associated to any finite latt ...

2019

The Homotopy Theory Of Coalgebras Over Simplicial Comonads

Kathryn Hess Bellwald, Magdalena Kedziorek

We apply the Acyclicity Theorem of Hess, Kedziorek, Riehl, and Shipley (recently corrected by Garner, Kedziorek, and Riehl) to establishing the existence of model category structure on categories of coalgebras over comonads arising from simplicial adjuncti ...

INT PRESS BOSTON, INC2019

$A_1$-type subgroups containing regular unipotent elements

Donna Testerman

Let be a simple exceptional algebraic group of adjoint type over an algebraically closed field of characteristic and let be a subgroup of containing a regular unipotent element of . By a theorem of Testerman, is contained in a connected subgroup of of type ...

2019

Correspondence functors and finiteness conditions

Jacques Thévenaz, Serge Bouc

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties wh ...

2018

A necessary and sufficient condition for induced model structures

Kathryn Hess Bellwald, Magdalena Kedziorek

A common technique for producing a new model category structure is to lift the fibrations and weak equivalences of an existing model structure along a right adjoint. Formally dual but technically much harder is to lift the cofibrations and weak equivalence ...

Wiley2017

The representation theory of finite sets and correspondences

Jacques Thévenaz, Serge Bouc

We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties which do not hold for other types of functor ...

2015

Modeling Users' Information Needs in a Document Recommender for Meetings

Maryam Habibi

People are surrounded by an unprecedented wealth of information. Access to it depends on the availability of suitable search engines, but even when these are available, people often do not initiate a search, because their current activity does not allow th ...

EPFL2015

The homotopy theory of coalgebras over a comonad

Kathryn Hess Bellwald

Let K be a comonad on a model category M. We provide conditions under which the associated category of K-coalgebras admits a model category structure such that the forgetful functor to M creates both cofibrations and weak equivalences. We provide concrete ...

2014

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