Concept

Groupe fini

Publications associées (284)

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

Equivalences between blocks of cohomological Mackey algebras

Baptiste Thierry Pierre Rognerud

Let G be a finite group and (K, O, k) be a p-modular system “large enough”. Let R = O or k. There is a bijection between the blocks of the group algebra RG and the central primitive idempotents (the blocks) of the so-called cohomological Mackey algebra coμ ...

Springer Verlag2015

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

Trace maps for Mackey algebras

Baptiste Thierry Pierre Rognerud

Let G be a finite group and R be a commutative ring. The Mackey algebra μR(G) shares a lot of properties with the group algebra RG however, there are some differences. For example, the group algebra is a symmetric algebra and this is not always the case fo ...

Elsevier2015

The torsion group of endotrivial modules

Jacques Thévenaz

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 determine, in terms of the structure of G, the kernel of the restriction map from T ...

Mathematical Science Publ2015

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

Small Spectral Radius And Percolation Constants On Non-Amenable Cayley Graphs

Motivated by the Benjamini-Schramm non-unicity of percolation conjecture we study the following question. For a given finitely generated nonamenable group Gamma, does there exist a generating set S such that the Cayley graph (Gamma, S), without loops and m ...

American Mathematical Society2015

A Tale of Two Quasi-Polynomial Algorithms

Robert Granger

In 2013 the Discrete Logarithm Problem in finite fields of small characteristic enjoyed a rapid series of developments, starting with the heuristic polynomial-time relation generation method due to Gologlu, Granger, McGuire and Zumbragel, and culminating w ...

2015

On Convergence Of The Maximum Block Improvement Method

André Uschmajew

The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is rel ...

Siam Publications2015

Cryogenic Spectroscopy and Quantum Molecular Dynamics Determine the Structure of Cyclic Intermediates Involved in Peptide Sequence Scrambling

Ursula Röthlisberger, Thomas Rizzo, Marta Andreia Da Silva Perez, Oleg Aseev

Collision-induced dissociation (CID) is a key technique used in mass spectrometry-based peptide sequencing. Collisionally activated peptides undergo statistical dissociation, forming a series of backbone fragment ions that reflect their amino acid (AA) seq ...

2015

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015