Concept

Nombre transcendant

Publications associées (31)

The validation project on the TORPEX basic plasma physics experiment

Ambrogio Fasoli, Ivo Furno, Paolo Ricci, Christian Gabriel Theiler, Joaquim Loizu Cisquella, Fabio Avino, Sébastien Jolliet, Federico David Halpern, Annamaria Mosetto

Owing to its detailed diagnostics, feasibility of parameter scans, and relatively simple configuration, the basic plasma physics experiment TORPEX is an ideal testbed in which to perform experiment/simulation comparisons and to contribute to the establishm ...

2013

The Truncated Tracial Moment Problem

Sabine Burgdorf

We present tracial analogs of the classical results of Curto and Fialkow on moment matrices. A sequence of real numbers indexed by words in noncommuting variables with values invariant under cyclic permutations of the indexes, is called a tracial sequence. ...

Theta Foundation2012

Overlap properties of geometric expanders

The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) is an element of (0, 1] such that no matter how we map the vertices of H into R-d, there is a point covered by at least a c(H)-fraction of the simplices induced by the ...

De Gruyter2011

Diagonal Quartic Surfaces And Transcendental Elements Of The Brauer Group

Evis Ieronymou

We exhibit central simple algebras over the function field of a diagonal quartic surface over the complex numbers that represent the 2-torsion part of its Brauer group. We investigate whether the 2-primary part of the Brauer group of a diagonal quartic sur ...

Cambridge University Press2010

Expressiveness And Closure Properties For Quantitative Languages

Laurent Doyen

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...

2010

Exponential decay and Fredholm properties in second-order quasilinear elliptic systems

Charles Stuart, Hicham Georges Gebran

We consider second-order quasilinear elliptic systems on un-bounded domains in the setting of Sobolev spaces. We complete our earlier work on the Fredholm and properness properties of the associated differential operators by giving verifiable conditions fo ...

2010

Ideal knots and other packing problems of tubes

Henryk Gerlach

This thesis concerns optimal packing problems of tubes, or thick curves, where thickness is defined as follows. Three points on a closed space curve define a circle. Taking the infimum over all radii of pairwise-distinct point triples defines the thickness ...

EPFL2010

Infinite labeled trees: From rational to Sturmian trees

Nicolas Gabriel Gast

This paper studies infinite unordered d-ary trees with nodes labeled by {0,1}. We introduce the notions of rational and Sturmian trees along with the definitions of (strongly) balanced trees and mechanical trees, and study the relations among them. In part ...

Elsevier2010

Arithmetic Bounds-Lenstra's Constant and Torsion of K-Groups

Julien Houriet

This thesis is concerned with computations of bounds for two different arithmetic invariants. In both cases it is done with the intention of proving some algebraic or arithmetic properties for number fields. The first part is devoted to computations of low ...

EPFL2010

Spherical lens antenna designs with particle swarm optimization

Juan Ramon Mosig, Anja Skrivervik, Ruzica Golubovic, Benjamin Fuchs

A design procedure for spherical lens antennas is described. A particle swarm optimization (PSO) algorithm is coupled to a mode matching technique based on spherical wave expansion to analyze the lens antennas. The proposed methodology is applied to three ...

Wiley-Blackwell2010

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