Concept

Groupe résoluble

Publications associées (169)

The Minimal Faithful Permutation Degree For A Direct Product Obeying An Inequality Condition

The minimal faithful permutation degree (G) of a finite group G is the least nonnegative integer n such that G embeds in the symmetric group Sym(n). Clearly (G x H) (G) + (H) for all finite groups G and H. In 1975, Wright ([10]) proved that equality occurs ...

Taylor & Francis Inc2016

Special Reductive Groups Over An Arbitrary Field

Mathieu Huruguen

A linear algebraic group G defined over a field k is called special if every G-torsor over every field extension of k is trivial. In 1958 Grothendieck classified special groups in the case where the base field is algebraically closed. In this paper we desc ...

Springer Birkhauser2016

Testing the Role of Dorsal Premotor Cortex in Auditory-Motor Association Learning Using Transcranical Magnetic Stimulation (TMS)

Interactions between the auditory and the motor systems are critical in music as well as in other domains, such as speech. The premotor cortex, specifically the dorsal premotor cortex (dPMC), seems to play a key role in auditory-motor integration, and in m ...

Public Library Science2016

Deciphering the Silent Participant. On the Use of Audio-Visual Cues for the Classification of Listener Categories in Group Discussions

Jean-Marc Odobez, Kenneth Alberto Funes Mora, Catharine Regina Monika Maria Oertel Genannt Bierbach

Estimating a silent participant’s degree of engagement and his role within a group discussion can be challenging, as there are no speech related cues available at the given time. Having this information available, however, can provide important insights in ...

ACM2015

Crowding, grouping, and gain control in schizophrenia

Michael Herzog, Maya Roinishvili

isual paradigms are versatile tools to investigate the pathophysiology of schizophrenia. Contextual modulation refers to a class of paradigms where a target is flanked by neighbouring elements, which either deteriorate or facilitate target perception. It i ...

Elsevier2015

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

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

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

Quasi-hereditary property of double Burnside algebras

Baptiste Thierry Pierre Rognerud

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

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