Christopher Hammond
- Published in print:
- 2015
- Published Online:
- August 2015
- ISBN:
- 9780198738671
- eISBN:
- 9780191801938
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780198738671.003.0013
- Subject:
- Physics, Crystallography, Condensed Matter Physics / Materials
This chapter starts with the Fourier series and Fourier transforms, and the representation of periodic functions. It then looks at Fourier analysis in crystallography. It details electron density, ...
More
This chapter starts with the Fourier series and Fourier transforms, and the representation of periodic functions. It then looks at Fourier analysis in crystallography. It details electron density, the derivation of relations between Fourier coefficients and structure factors, the X-ray resolution of a crystal structure, and the structural analysis of crystals and molecules (trial and error methods, the Patterson function, interpretation of Patterson maps, heavy atom and isomorphous replacement techniques, direct methods, and charge flipping). Finally, it provides an analysis of the Fraunhofer diffraction pattern from a grating and the Abbe theory of image formation.Less
This chapter starts with the Fourier series and Fourier transforms, and the representation of periodic functions. It then looks at Fourier analysis in crystallography. It details electron density, the derivation of relations between Fourier coefficients and structure factors, the X-ray resolution of a crystal structure, and the structural analysis of crystals and molecules (trial and error methods, the Patterson function, interpretation of Patterson maps, heavy atom and isomorphous replacement techniques, direct methods, and charge flipping). Finally, it provides an analysis of the Fraunhofer diffraction pattern from a grating and the Abbe theory of image formation.
Bas Edixhoven and Jean-Marc Couveignes (eds)
- Published in print:
- 2011
- Published Online:
- October 2017
- ISBN:
- 9780691142012
- eISBN:
- 9781400839001
- Item type:
- book
- Publisher:
- Princeton University Press
- DOI:
- 10.23943/princeton/9780691142012.001.0001
- Subject:
- Mathematics, Number Theory
Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's ...
More
Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. This book gives an algorithm for computing coefficients of modular forms of level one in polynomial time. For example, Ramanujan's tau of a prime number p can be computed in time bounded by a fixed power of the logarithm of p. Such fast computation of Fourier coefficients is itself based on the main result of the book: the computation, in polynomial time, of Galois representations over finite fields attached to modular forms by the Langlands program. Because these Galois representations typically have a nonsolvable image, this result is a major step forward from explicit class field theory, and it could be described as the start of the explicit Langlands program. The book begins with a concise and concrete introduction that makes it accessible to readers without an extensive background in arithmetic geometry, and it includes a chapter that describes actual computations.Less
Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. This book gives an algorithm for computing coefficients of modular forms of level one in polynomial time. For example, Ramanujan's tau of a prime number p can be computed in time bounded by a fixed power of the logarithm of p. Such fast computation of Fourier coefficients is itself based on the main result of the book: the computation, in polynomial time, of Galois representations over finite fields attached to modular forms by the Langlands program. Because these Galois representations typically have a nonsolvable image, this result is a major step forward from explicit class field theory, and it could be described as the start of the explicit Langlands program. The book begins with a concise and concrete introduction that makes it accessible to readers without an extensive background in arithmetic geometry, and it includes a chapter that describes actual computations.
