Concept

Simple group

Related publications (103)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Bartosz Maria Walczak, Michal Lason

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of com ...

Springer2014

A hierarchical detection framework for computational contact mechanics

Jean-François Molinari, Alejandro Marcos Aragon

A novel methodology consisting of three hierarchical levels is proposed for the detection phase of contact mechanics simulations. The top level of the hierarchy uses kinematic information from the objects involved in the simulation to determine approximate ...

Elsevier2014

Cantor systems, piecewise translations and simple amenable groups

Nicolas Monod

We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by constructing a suita ...

Annal Mathematics2013

Double centralizers of unipotent elements in simple algebraic groups of type G(2), F-4 and E-6

Iulian Ion Simion

Let u be a unipotent element of a simple algebraic group G over a field k of characteristic p. We develop a method for computing the connected component of Z(C-G(u)) in the cases where p is positive and both it and the rank of G are small enough. The metho ...

Academic Press Inc Elsevier Science2013

Double centralizers of unipotent elements in simple algebraic groups of type G2, F4 and E6

Iulian Ion Simion

Let

u

be a unipotent element of a simple algebraic group

G

over a field

k

of characteristic

p

. We develop a method for computing the connected component of

Z(C_G(u))

in the cases where

p

is positive and both it and the rank of

G

are small eno ...

2013

The Dade group of a finite group

Caroline Lassueur

The aim of this paper is to construct an equivalent of the Dade group of a p-group for an arbitrary finite group G, whose elements are equivalences classes of endo-p-permutation modules. To achieve this goal we use the theory of relative projectivity with ...

Elsevier2013

On the irreducibility of symmetrizations of cross-characteristic representations of finite classical groups

Donna Testerman

Let W be a vector space over an algebraically closed field k. Let H be a quasisimple group of Lie type of characteristic p not equal char(k) acting irreducibly on W. Suppose also that G is a classical group with natural module W, chosen minimally with resp ...

2013

Irreducibility In Algebraic Groups And Regular Unipotent Elements

Donna Testerman

We study (connected) reductive subgroups G of a reductive algebraic group H, where G contains a regular unipotent element of H. The main result states that G cannot lie in a proper parabolic subgroup of H. This result is new even in the classical case H = ...

2013

Algebraic algorithms for network information flow

Javad Ebrahimi Boroojeni

Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...

EPFL2013

Double centralizers of unipotent elements in simple algebraic groups of type G2, F4 and E6

Iulian Ion Simion

Let

u

be a unipotent element of a simple algebraic group

G

over a field

k

of characteristic

p

. We develop a method for computing the connected component of

Z(C_G(u))

in the cases where

p

is positive and both it and the rank of

G

are small eno ...

2013