Concept

Nombre rationnel

Publications associées (49)

Moving on: Is Existenzminimum Still Relevant?

In the inter-war period, progressive architects confronted the building of mass housing with an analogy with rational and functional workplaces. At the 2nd CIAM (Congres Internationaux d'Architecture Moderne), held in Frankfurt in 1929, this was tested aga ...

2019

Rationally isomorphic hermitian forms and torsors of some non-reductive groups

Eva Bayer Fluckiger

Let R be a semilocal Dedekind domain. Under certain assumptions, we show that two (not necessarily unimodular) hermitian forms over an R-algebra with involution, which are rationally isomorphic and have isomorphic semisimple coradicals, are in fact isomorp ...

Academic Press Inc Elsevier Science2017

Some consequences of Masser's counting theorem on elliptic curves

Valéry Aurélien Mahé

We use Masser's counting theorem to prove a lower bound for the canonical height in powers of elliptic curves. We also prove the Galois case of the elliptic Lehmer problem, combining Kummer theory and Masser's result with bounds on the rank and torsion of ...

Springer Heidelberg2017

Height of rational points on quadratic twists of a given elliptic curve

Pierre Francis André Le Boudec

We formulate a conjecture about the distribution of the canonical height of the lowest non-torsion rational point on a quadratic twist of a given elliptic curve, as the twist varies. This conjecture seems to be very deep and we can prove only partial resul ...

Oxford Univ Press2016

Motivic Classes of Nakajima Quiver Varieties

Dimitri Stelio Wyss

We prove that Hausel’s formula for the number of rational points of a Nakajima quiver variety over a finite field also holds in a suitable localization of the Grothendieck ring of varieties. In order to generalize the arithmetic harmonic analysis in his pr ...

2016

Inhomogeneous minima of mixed signature lattices

Eva Bayer Fluckiger, Martino Borello, Peter Simon Jossen

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([ ...

Academic Press Inc Elsevier Science2016

The interaction factor method for energy pile groups

Lyesse Laloui, Alessandro Francesco Rotta Loria

Prior to this study, no simplified yet rational methods were available for estimating the vertical displacements of energy pile groups subjected to thermal loads. Observing such a challenge, the goal of this study has been threefold: (i) to extend the inte ...

Elsevier2016

Density of Rational Points on a Certain Smooth Bihomogeneous Threefold

Pierre Francis André Le Boudec

We establish sharp upper and lower bounds for the number of rational points of bounded anticanonical height on a smooth bihomogeneous threefold defined over Q and of bidegree (1, 2). These bounds are in agreement with Manin's conjecture. ...

Oxford University Press2015

Linear Growth for Certain Elliptic Fibrations

Pierre Francis André Le Boudec

We prove that the number of rational points of bounded height on certain del Pezzo surfaces of degree 1 defined over Q grows linearly, as predicted by Manin's conjecture. ...

Oxford University Press2015

Shimura Curves and Special Values of p-adic L-functions

Ernest Hunter Brooks

We construct "generalized Heegner cycles" on a variety fibered over a Shimura curve, defined over a number field. We show that their images under the p-adic Abel-Jacobi map coincide with the values (outside the range of interpolation) of a p-adic L-functio ...

Oxford University Press2015

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