Concept

Théorie des groupes

Publications associées (215)

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

An Audio Visual Corpus for Emergent Leader Analysis

Daniel Gatica-Perez, Oya Aran, Dairazalia Sanchez Cortes

In this paper we discuss our experience designing and collecting a data corpus called ELEA (Emergent LEader Analysis), and describe the use of a light portable scenario to record small group meetings. The corpus was gathered with the aim of analyzing emerg ...

2011

Endotrivial modules for p-solvable groups

Jacques Thévenaz, Nadia Mazza

We determine the torsion subgroup of the group of endotrivial modules for a finite solvable group in characteristic p. We also prove that our result would hold for p-solvable groups, provided a conjecture can be proved about the case of p-nilpotent groups. ...

2011

Paper Interface Design for Classroom Orchestration

Pierre Dillenbourg, Frédéric Kaplan, Sébastien Cuendet, Quentin Bonnard

Designing computer systems for educational purpose is a difficult task. While many of them have been developed in the past, their use in classrooms is still scarce. We make the hypothesis that this is because those systems take into account the needs of in ...

2011

Secure key exchange in wireless networks

Christina Fragouli, László Czap

We investigate the problem of exchanging a se- cret key within a group of wireless devices. In particular, we are interested in information theoretically secure key exchange schemes that enable honest nodes of a multi-hop network to establish a secret grou ...

2011

The group of unimodular automorphisms of a principal bundle and the Euler-Yang-Mills equations

Given a principal bundle G hooked right arrow P -> B (each being compact, connected and oriented) and a G-invariant metric h(P) on P which induces a volume form mu(P), we consider the group of all unimodular automorphisms SAut(P, mu(P)) := {phi is an eleme ...

2010

Maximal symmetrization and reduction of fields: Application to wave functions in solid-state nanostructures

Marc-André Dupertuis, Sascha Dalessi

A general formalism for the maximal symmetrization and reduction of fields (MSRFs) is proposed and applied to wave functions in solid-state nanostructures. Its primary target is to provide an essential tool for the study and analysis of the electronic and ...

2010

Derandomization and Group Testing

Mahdi Cheraghchi Bashi Astaneh

The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments related to combinator ...

2010

Group Secret Key Generation over Broadcast Erasure Channels

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Uday Kiran Pulleti

We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the t ...

2010

Cnnm proteins and uses thereof

The present invention relates proteins from the group consisting of CNNM1, CNNM2, CNNM 3 and CNNM4, its derivatives or fragments thereof for use as a medicament, for treatment and or diagnostic purposes. The invention further relates to a human genomic DNA ...

2010

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Robert Granger

This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of

\mathbb{F}_{q^6}

, for

q \equiv 1 \bmod{6}

. Our result arises from considering the Weil restriction of scalars of this group from

\mathbb{F}_{q^6}

...

Springer Berlin Heidelberg2010

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Robert Granger

This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of

\mathbb{F}_{q^6}

, for

q \equiv 1 \bmod{6}

. Our result arises from considering the Weil restriction of scalars of this group from

\mathbb{F}_{q^6}

...

Springer Berlin Heidelberg2010