Publication

Idempotents in the endomorphism algebra of a finite lattice

Publications associées (32)

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

Construction of balanced sports schedules using partitions into subleagues

Dominique de Werra, Tinaz Ekim

Direct constructions for balanced tournaments known so far solve problems with 2n teams if 2n mod 3 not equal 1 or 2n = 2(p), p >= 3 or n is odd. Our construction uses an arbitrary partition of the league into subleagues. It solves more than half of the mi ...

2008

Anonymous and Fault-Tolerant Shared-Memory Computing

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for re ...

2007

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui, Eric Ruppert

Springer, Springer-Verlag2007

Minimum euclidien des ordres maximaux dans les algèbres centrales à division

Jérôme Chaubert

This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...

EPFL2007

Modules d'endo-p-permutation

Jean-Marie Urfer

This dissertation is concerned with the study of a new family of representations of finite groups, the endo-p-permutation modules. Given a prime number p, a finite group G of order divisible by p and an algebraically closed field k of characteristic p, we ...

EPFL2006

Réseaux idéaux sur des corps CM et des corps totalement réels

Ivan Suarez Atias

This thesis deals with the study of ideal lattices over number fields. Let K be a number field, which is assumed to be CM or totally real. An ideal lattice over K is a pair (I,b), where I is a fractional ideal of K and b : I × I → R is a symmetric positive ...

EPFL2005

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge the ...

2005

High aspect ratio, 3D structuring of photoresist materials by ion beam LIGA

Philippe Renaud, Arnaud Bertsch

IB-LIGA (Ion Beam Lithographie, Galvanoformung and Abformung) is a new technique for the 3D structuring of photoresist materials. It is a direct-write (maskless) technique that uses high energy (0.5-3.5 McV) light ions (protons or helium ions) for the irra ...

2003

Cluster synchronization in three-dimensional lattices of diffusively coupled oscillators

Martin Hasler, Igor Belykh

Cluster synchronization modes of continuous time oscillators that are diffusively coupled in a three-dimensional (3-D) lattice are studied in the paper via the corresponding linear invariant manifolds. Depending in an essential way on the number of oscilla ...

2003

Maximal subgroups of direct products

Jacques Thévenaz

We determine all maximal subgroups of the direct product G^n of n copies of a group G. If G is finite, we show that the number of maximal subgroups of G^n is a quadratic function of n if G is perfect, but grows exponentially otherwise. We deduce a theorem ...

1997