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.
The mean-field dynamics of a collection of stochastic agents evolving under local and nonlocal interactions in one dimension is studied via analytically solvable models. The nonlocal interactions between agents result from (a) a finite extension of the age ...
If L/K is a finite Galois extension of local fields, then we say that the valuation criterion VC(L/K) holds if there is an integer d such that every element x is an element of L with valuation d generates a normal basis for L/K. Answering a question of Byo ...
Les réseaux d’assainissement font partie des infrastructures clés des pays industrialisés. Selon l’Office fédéral de l’environnement, environ 50'000 km de canalisations publiques sont installés en Suisse, avec une valeur de remplacement supérieure à 50 mil ...
We establish exponential convergence of the hp-version of isogeometric analysis for second order elliptic problems in one spacial dimension. Specifically, we construct, for functions which are piecewise analytic with a finite number of algebraic singularit ...
Decision procedures are widely used in software development and verification. The goal of this dissertation is to increase the scope of properties that can be verified using decision procedures. To achieve this goal, we identify three improvements over the ...
Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets ...
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that can express constraints on sets of elements and their cardinalities. Problems from verification of complex properties of software often contain fragments that belong to quantifier- ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011
J.Dixmier asked in 1950 whether every non-amenable group admits uniformly bounded representations that cannot be unitarised. We provide such representations upon passing to extensions by abelian groups. This gives a new characterisation of amenability. Fur ...
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that can express constraints on sets of elements and their cardinalities. Problems from verification of complex properties of software often contain fragments that belong to quantifier- ...
Let F/E be a finite Galois extension of fields with abelian Galois group Γ. A self-dual normal basis for F/E is a normal basis with the additional property that TrF/E(g(x),h(x))=δg,h for g,h∈Γ. Bayer-Fluckiger and Lenstra h ...
