Concept

Représentation adjointe

Publications associées (52)

The U (n) free rigid body: Integrability and stability analysis of the equilibria

A natural extension of the free rigid body dynamics to the unitary group U (n) is considered. The dynamics is described by the Euler equation on the Lie algebra u(n), which has a bi-Hamiltonian structure, and it can be reduced onto the adjoint orbits, as i ...

Elsevier2015

Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

Fabio Nobile, Daniel Kressner, Christine Tobler, Rajesh Kumar

Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...

2015

MATHICSE Technical Report : Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

Fabio Nobile, Daniel Kressner, Christine Tobler, Rajesh Kumar

MATHICSE2014

Integrable G-strands on semisimple Lie groups

Tudor Ratiu, François Gay-Balmaz

The present paper derives systems of partial differential equations that admit a quadratic zero curvature representation for an arbitrary real semisimple Lie algebra. It also determines the general form of Hamilton's principles and Hamiltonians for these s ...

Iop Publishing Ltd2014

Event risk, contingent claims and the temporal resolution of uncertainty

Pierre Collin Dufresne, Julien Hugonnier

We study the pricing and hedging of contingent claims that are subject to Event Risk which we define as rare and unpredictable events whose occurrence may be correlated to, but cannot be hedged perfectly with standard marketed instruments. The super-replic ...

Springer2014

The geometry of algorithms using hierarchical tensors

André Uschmajew

In this paper, the differential geometry of the novel hierarchical Tucker format for tensors is derived. The set HT,k of tensors with fixed tree T and hierarchical rank k is shown to be a smooth quotient manifold, namely the set of orbits of a Lie group ac ...

2013

Brace Bar-Cobar Duality

Justin Robert Young

Using Kadeishvili's formulas with appropriate signs, we show that the classical cobar construction from coalgebras to algebras \Omega: CoAlg -> Alg can be enhanced to a functor from Hopf algebras to E_2 algebras (for a certain choice of E_2 operad) \Omega ...

2013

Patch-based methods for variational image processing problems

Emmanuel D'Angelo

Image Processing problems are notoriously difficult. To name a few of these difficulties, they are usually ill-posed, involve a huge number of unknowns (from one to several per pixel!), and images cannot be considered as the linear superposition of a few p ...

EPFL2013

The Dixmier Map for Nilpotent Super Lie Algebras

In this article we prove that there exists a Dixmier map for nilpotent super Lie algebras. In other words, if we denote by Prim(U(g)) the set of (graded) primitive ideals of the enveloping algebra U(g) of a nilpotent Lie superalgebra g and Ad0 the adjoint ...

2012

RD optimized auxiliary information for inpainting-based view synthesis

Pascal Frossard, Thomas Maugey

Texture and depth maps of two neighboring camera viewpoints are typically required for synthesis of an intermediate virtual view via depth-image-based rendering (DIBR). However, the bitrate overhead required for reconstruction ofmultiple texture and depth ...

2012

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