Concept

Groupe abélien

Publications associées (226)

Quasi-hereditary property of double Burnside algebras

In this short note, we investigate some consequences of the vanishing of simple biset functors. As a corollary, if there is no non-trivial vanishing of simple biset functors (e.g., if the group G is commutative), then we show that kB(G,G) is a quasi-heredi ...

Elsevier2015

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

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

The xi-stability on the affine grassmannian

Zongbin Chen

We introduce a notion of xi-stability on the affine grassmannian (SIC) for the classical groups, this is the local version of the xi-stability on the moduli space of Higgs bundles on a curve introduced by Chaudouard and Laumon. We prove that the quotient ( ...

Springer Heidelberg2015

Equivalences between blocks of p-local Mackey algebras

Baptiste Thierry Pierre Rognerud

Let G be a finite group and (K, O, k) be a p-modular system. Let R = O or k. There is a bijection between the blocks of the group algebra and the blocks of the so-called p-local Mackey algebra mu(1)(R)(G). Let b be a block of RG with abelian defect group D ...

Elsevier2015

Sur quelques foncteurs de bi-ensembles

Rosalie Françoise Chevalley

This thesis is in the context of representation theory of finite groups. More specifically, it studies biset functors. In this thesis, I focus on two biset functors: the Burnside functor and the functor of p-permutation modules. For the Burnside functor we ...

EPFL2015

A totally unimodular view of structured sparsity

Volkan Cevher, Marwa El Halabi

This paper describes a simple framework for structured sparse recovery based on convex optimization. We show that many interesting structured sparsity models can be naturally represented by linear matrix inequalities on the support of the unknown parameter ...

2015

Diophantine properties of nilpotent Lie groups

A finitely generated subgroup F of a real Lie group G is said to be Diophantine if there is beta > 0 such that non-trivial elements in the word ball B-Gamma(n) centered at 1 is an element of F never approach the identity of G closer than broken vertical ba ...

London Mathematical Society, Cambridge2015

Torsion-free endotrivial modules

Jacques Thévenaz, Nadia Mazza

Let G be a finite group and let T(G) be the abelian group of equivalence classes of endotrivial kG-modules, where k is an algebraically closed field of characteristic p. We investigate the torsion-free part TF(G) of the group T(G) and look for generators o ...

Elsevier2014

Infinite Presentability Of Groups And Condensation

Luc Guyot

We describe various classes of infinitely presented groups that are condensation points in the space of marked groups. A well-known class of such groups consists of finitely generated groups admitting an infinite minimal presentation. We introduce here a l ...

Cambridge University Press2014

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