Concept

Corps de nombres

Publications associées (98)

Hybrid Bounds For Automorphic Forms On Ellipsoids Over Number Fields

We prove upper bounds for Hecke-Laplace eigenfunctions on certain Riemannian manifolds X of arithmetic type, uniformly in the eigenvalue and the volume of the manifold. The manifolds under consideration are d-fold products of 2-spheres or 3-spheres, realiz ...

Cambridge Univ Press2013

On the size of Satake parameters for unitary cuspidal automorphic representations for GL(4)

Nahid Walji

Let Pi be a cuspidal automorphic representation for GL(4) over a number field F. We obtain unconditional lower bounds on the number of places at which the Satake parameters are not "too large". In the case of self-dual Pi with non-trivial central character ...

Academic Press Inc Elsevier Science2013

Upper bounds for the Euclidean minima of abelian fields of odd prime power conductor

Eva Bayer Fluckiger, Piotr Aleksander Maciak

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime power conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p(r), where p is an odd prime number ...

Springer Verlag2013

Modular Functions and Special Cycles

Maryna Viazovska

In this thesis we study algebraic cycles on Shimura varieties of orthogonal type. Such varieties are a higher dimensional generalization of modular curves and their important feature is that they have natural families of algebraic cycles in all codimesions ...

Rheinische Friedrich-Wilhelms-Universität Bonn2013

Solving a $6120$-bit DLP on a Desktop Computer

Robert Granger, Jens Markus Zumbrägel

In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. By combining the polynomial time relat ...

Springer Berlin Heidelberg2013

Influence of numerical schemes on statistical properties of computed charged particle trajectories in turbulent electromagnetic fields

A class of numerical schemes is developed for the study of charged particle transport in complex stationary electromagnetic fields and tested for fields obtained from a numerical solution of the magneto-hydrodynamic equation. The performances of these sche ...

Elsevier2013

Accelerated autofocusing of off-axis holograms using critical sampling

Christian Depeursinge, Muhammed Fatih Toy, Jérôme Parent, Marcel Egli, Stéphane Richard

In this Letter we propose a fast off-axis hologram autofocusing (AF) approach that is based on the redundant data elimination by the critical resampling of the contained complex field. Implementation of the proposed methodology enables the real-time AF wit ...

Optical Society of America2012

Algebraic Divisibility Sequences Over Function Fields

Valéry Aurélien Mahé

In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields define ...

Australian Mathematical Society2012

Online BCI with Stable Sources

José del Rocio Millán Ruiz, Ricardo Andres Chavarriaga Lozano, Mohit Kumar Goel

In this paper, we show that the estimated intra-cranial sources using source localization on EEG signals can be used for online Brain Computer Interation (BCI) and the discriminant sources remain stable over days. Classifiers are trained on discriminant so ...

2012

Lattice theoretic approach to space-time codes from division algebras

Cyril Becker

This master project on algebraic coding theory gathers various techniques from lattice theory, central simple algebras and algebraic number theory. The thesis begins with the formulation of the engineering problem into mathematical form. It presents how sp ...

2012

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