Concept

Spectre d'anneau

Publications associées (44)

Almost cyclic regular semisimple elements in irreducible representations of simple algebraic groups

Let G be a simple linear algebraic group defined over an algebraically closed field of characteristic p ≥ 0 and let φ be a nontrivial p-restricted irreducible representation of G. Let T be a maximal torus of G and s ∈ T . We say that s is Ad-regular if α(s ...

2023

Indole Alkaloids, Macrocycles and Heterocycles

Cyril Piemontesi

An enantioselective total synthesis of (-)-terengganensine A, a heptacyclic monoterpene indole alkaloid, was performed. A short sequence allowed to obtain the enantio-enriched target in good overall yield. The synthesis featured a key asymmetric transfer h ...

EPFL2018

Exact diagonalization of SU( N ) Heisenberg and Affleck-Kennedy-Lieb-Tasaki chains using the full SU( N ) symmetry

Frédéric Mila, Pierre Marcel Nataf, Kianna Wan

We present a method for the exact diagonalization of the SU(N) Heisenberg interaction Hamiltonian using Young tableaus to work directly in each irreducible representation of the global SU(N) group. This generalized scheme is applicable to chains consisting ...

2017

The Hochschild complex of a twisting cochain

Kathryn Hess Bellwald

Given any twisting cochain t:C→A , where C is a connected, coaugmented chain coalgebra and A is an augmented chain algebra over an arbitrary commutative ring R, we construct a twisted extension of chain complexes Full-size image (1 K) of which both the wel ...

Elsevier2016

Waldhausen K-theory of spaces via comodules

Kathryn Hess Bellwald

Let X be a simplicial set. We construct a novel adjunction be- tween the categories RX of retractive spaces over X and ComodX+ of X+- comodules, then apply recent work on left-induced model category structures [5], [16] to establish the existence of a left ...

Academic Press Inc Elsevier Science2016

A parametric augmented Lagrangian algorithm for real-time economic NMPC

Colin Neil Jones, Jean-Hubert Hours, Harsh Ambarishkumar Shukla

In this paper, a novel optimality-tracking algorithm for solving Economic Nonlinear Model Predictive Control (ENMPC) problems in real-time is presented. Developing online schemes for ENMPC is challenging, since it is unclear how convexity of the Quadratic ...

IEEE2016

Kan spectra, group spectra and twisting structures

Marc Stephan

Kan spectra provide a combinatorial model for the stable homotopy category. They were introduced by Dan Kan in 1963 under the name semisimplicial spectra. A Kan spectrum is similar to a pointed simplicial set, but it has simplices in negative degrees as we ...

EPFL2015

MATHICSE Technical Report : Efficient model reduction of parametrized systems by matrix discrete empirical interpolation

Andrea Manzoni, Federico Negri

In this work, we apply a Matrix version of the so-called Discrete Empirical Interpolation (MDEIM) for the efficient reduction of nonaffine parametrized systems arising from the discretization of linear partial differential equations. Dealing with affinely ...

MATHICSE2015

Efficient model reduction of parametrized systems by matrix discrete empirical interpolation

Andrea Manzoni, Federico Negri

Elsevier2015

Homotopy completion and topological Quillen homology of structured ring spectra

Kathryn Hess Bellwald

Working in the context of symmetric spectra, we describe and study a homotopy completion tower for algebras and left modules over operads in the category of modules over a commutative ring spectrum (eg structured ring spectra). We prove a strong convergenc ...

Geometry & Topology Publications2013

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