Concept

Classe caractéristique

Publications associées (59)

Counting Sheaves Using Spherical Codes

Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of geometrically irreducibl ...

International Press2013

A link between short-range and long-range properties of random sphere packings

Daniele Mari, Gérard Gremaud, Arnaud Comment, Riccardo Balzan, Alessandro Luigi Sellerio

We present a high precision particle-by-particle 3D reconstruction of granular systems composed of monodispersed spheres (sphere packings); the experimental approach is based on magnetic resonance imaging techniques. Our measurements revealed a strong corr ...

Springer Berlin Heidelberg2013

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

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

Numerical simulations with a first-order BSSN formulation of Einstein's field equations

Jan Sickmann Hesthaven

We present a new fully first-order strongly hyperbolic representation of the Baumgarte-Shapiro-Shibata-Nakamura formulation of Einstein's equations with optional constraint damping terms. We describe the characteristic fields of the system, discuss its hyp ...

AMER PHYSICAL SOC2012

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with a BGP router. DiCE quickly detects three important classes of faults, resulting from configuration mistakes, po ...

2011

Experimental Evaluation of Steel Slit Panel Frames for Seismic Resistance

Gustavo Cortes

The steel slit panel–frame is a new system for seismic resistance of buildings. The steel slit panels are bolted to beams which are simply connected to the columns. The steel slit panels are steel plates with rows of vertical slits forming a series of flex ...

Elsevier2011

Ordered and Oriented Supramolecular n/p-Heterojunction Surface Architectures: Completion of the Primary Color Collection

Natalie Renuka Banerji, Daniel Emery, Stefan Matile, Michal Borkovec, Plinio Maroni, Eric Vauthey

In this study, we describe synthesis, characterization, and zipper assembly of yellow p-oligophenyl naphthalenediimide (POP-NDI) donor−acceptor hybrids. Moreover, we disclose, for the first time, results from the functional comparison of zipper and layer-b ...

2009

On Hermitian Pfister Forms

Let K be a field of characteristic different from 2. It is known that a quadratic Pfister form over K is hyperbolic once it is isotropic. It is also known that the dimension of an anisotropic quadratic form over K belonging to a given power of the fundamen ...

2008

On the essential dimension of cyclic p-groups

Let p be a prime number, let K be a field of characteristic not p, containing the p-th roots of unity, and let r >= 1 be an integer. We compute the essential dimension of Z/p(r) Z over K (Theorem 4.1). In particular, i) We have edℚ(ℤ/8ℤ)=4, a result which ...

Springer-Verlag2008

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