Concept

Loop space

Related publications (33)

A counter-example to a conjecture of Felix

If X is a simply connected space of finite type, then the rational homotopy groups of the based loop space of X possess the structure of a graded Lie algebra, denoted L-x. The radical of L-x, which is an important rational homotopy invariant of X, is of fi ...

Elsevier2011

Noetherian loop spaces

Jérôme Scherer

The class of loop spaces of which the mod p cohomology is Noetherian is much larger than the class of p-compact groups (for which the mod p cohomology is required to be finite). It contains Eilenberg-Mac Lane spaces such as ℂP∞ and 3-connected covers of co ...

2011

The loop group and the cobar construction

Kathryn Hess Bellwald

We prove that for any 1-reduced simplicial set X, Adams' cobar construction, on the normalised chain complex of X is naturally a strong deformation retract of the normalised chains CGX on the Kan loop group GX, opening up the possibility of applying the to ...

2010

Purcell-Factor-Enhanced Scattering from Si Nanocrystals in an Optical Microcavity

Tobias Kippenberg

Scattering processes in an optical microcavity are investigated for the case of silicon nanocrystals embedded in an ultra-high-Q toroid microcavity. Using a novel measurement technique based on the observable mode splitting, we demonstrate that light scatt ...

2009

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

François Ingelrest

We present a minimum spanning tree based energy aware multicast protocol (MSTEAM), which is a localized geographic multicast routing scheme designed for ad hoc and sensor networks. It uses locally-built minimum spanning trees (MST) as an efficient approxim ...

2008

Some applications of symmetries in differential geometry and dynamical systems

Oana Mihaela Dragulete

This thesis deals with applications of Lie symmetries in differential geometry and dynamical systems. The first chapter of the thesis studies the singular reduction of symmetries of cosphere bundles, the conservation properties of contact systems and their ...

EPFL2007

Orthogonal Neighborhood Preserving Projections: A projection-based dimensionality reduction technique

Effrosyni Kokiopoulou

This paper considers the problem of dimensionality reduction by orthogonal projection techniques. The main feature of the proposed techniques is that they attempt to preserve both the intrinsic neighborhood geometry of the data samples and the global geome ...

2007

Ultrafast photonic crystal nanocavity laser

Hatice Altug

Spontaneous emission is not inherent to an emitter, but rather depends on its electromagnetic environment. In a microcavity, the spontaneous emission rate can be greatly enhanced compared with that in free space. This so-called Purcell effect can dramatica ...

2006

Orthogonal Neighborhood Preserving Projections

Effrosyni Kokiopoulou

Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the data samples and the global geometry. The proposed technique constructs a weight ...

IEEE2005

Structural analysis of the jet TAE antenna

Ambrogio Fasoli, Duccio Testa

In this paper the mechanical design of the new active MHD antennas for JET is described and the structural/mechanical analysis for the antennas is presented. These new antennas replace the existing n = 1 or 2 saddle coils with a set of eight smaller antenn ...

2005

Graph Chatbot

Chat with Graph Search

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.