Concept

Algèbre associative

Publications associées (84)

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

On the Duality between Multiple-Access Codes and Computation Codes

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu

For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess s ...

2017

The algebra of essential relations on a finite set

Jacques Thévenaz, Serge Bouc

Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...

Walter de Gruyter2016

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

Generalized Virasoro algebra: left-symmetry and related algebraic and hydrodynamic properties

Tudor Ratiu

Motivated by the work of Kupershmidt (J. Nonlin. Math. Phys. 6 (1998), 222 -245) we discuss the occurrence of left symmetry in a generalized Virasoro algebra. The multiplication rule is defined, which is necessary and sufficient for this algebra to be quas ...

Taylor & Francis Ltd2016

The monoid algebra of all relations on a finite set

Jacques Thévenaz, Serge Bouc

We classify all the simple modules for the algebra of relations on a finite set, give their dimension, and find the dimension of the Jacobson radical of the algebra. ...

2015

Exponential Kleisli Monoids as Eilenberg-Moore Algebras

Gavin Jay Seal, Dirk Hofmann

Lax monoidal powerset-enriched monads yield a monoidal structure on the category of monoids in the Kleisli category of a monad. Exponentiable objects in this category are identified as those Kleisli monoids with algebraic structure. This result generalizes ...

Springer2015

Embedding functor for classical groups and Brauer–Manin obstruction

Eva Bayer Fluckiger, Ting-Yu Lee

Let K be a global field of characteristic not 2. The embedding problem for maximal tori in a classical group G can be described in terms of algebras with involution. The aim of this paper is to give an explicit description of the obstruction group to the H ...

2015

Left-induced model structures and diagram categories

Kathryn Hess Bellwald, Varvara Karpova, Magdalena Kedziorek

We prove existence results à la Jeff Smith for left-induced model category structures, of which the injective model structure on a diagram category is an important example. We further develop the notions of fibrant generation and Postnikov presentation fro ...

2015

Left-Induced Model Structures and Diagram Categories

Kathryn Hess Bellwald, Varvara Karpova, Magdalena Kedziorek

We prove existence results a la Jeff Smith for left-induced model category structures, of which the injective model structure on a diagram category is an important example. We further develop the notions of fibrant generation and Postnikov presentation fro ...

Amer Mathematical Soc2015

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