Publication
Modular Functions and Special Cycles
Publications associées (78)
Trace coordinates of Teichmüller spaces of Riemann surfaces
Using an algebraic formalism based on matrices in SL(2,R), we explicitly give the Teichmüller spaces of Riemann surfaces of signature (0,4) (X pieces), (1,2) ("Fish" pieces) and (2,0) in trace coordinates. The approach, based upon gluing together two build ...
EPFL2006Upper bounds for Euclidean minima of algebraic number fields
The aim of this paper is to give new upper bounds for Euclidean minima of algebraic number fields. In particular, to show that Minkowski's conjecture holds for the maximal totally real subfields of cyclotomic fields of prime power conductor. ...
2006Réseaux idéaux sur des corps CM et des corps totalement réels
This thesis deals with the study of ideal lattices over number fields. Let K be a number field, which is assumed to be CM or totally real. An ideal lattice over K is a pair (I,b), where I is a fractional ideal of K and b : I × I → R is a symmetric positive ...
EPFL2005Algebraic methods for channel coding
This work is dedicated to developing algebraic methods for channel coding. Its goal is to show that in different contexts, namely single-antenna Rayleigh fading channels, coherent and non-coherent MIMO channels, algebraic techniques can provide useful tool ...
EPFL2005Deciding properties of number fields without factoring
The polynomial time algorithm of Lenstra, Lenstra, and Lovász [15] for factoring integer polynomials and variants thereof have been widely used to show that various computational problems in number theory have polynomial time solutions. Among them is the p ...
1997The Factorization of the ninth Fermat Number
In this paper we exhibit the full prime factorization of the ninth Fermat number F9 = 2(512) + 1. It is the product of three prime factors that have 7, 49, and 99 decimal digits. We found the two largest prime factors by means of the number field sieve, wh ...
American Mathematical Society1993Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
It is shown that the binary expansions of algebraic numbers do not form secure pseudorandom sequences, given sufficiently many initial bits of an algebraic number, its minimal polynomial can be reconstructed, and therefore the further bits of the algebraic ...
1988