Downloads & Free Reading Options - Results

This book introduces algebraic number theory through the problem of generalizing 'unique prime factorization' from ordinary integers to more general domains. Solving polynomial equations in integers leads naturally to these domains, but unique prime factorization may be lost in the process. To restore it, we need Dedekind's concept of ideals. However, one still needs the supporting concepts of algebraic number field and algebraic integer, and the supporting theory of rings, vector spaces, and modules. It was left to Emmy Noether to encapsulate the properties of rings that make unique prime factorization possible, in what we now call Dedekind rings. The book develops the theory of these concepts, following their history, motivating each conceptual step by pointing to its origins, and focusing on the goal of unique prime factorization with a minimum of distraction or prerequisites. This makes a self-contained easy-to-read book, short enough for a one-semester course. Review ‘In Algebraic Number Theory for Beginners, John Stillwell once again displays his remarkable talent for using the history of mathematics to motivate and explore even the most abstract mathematical concepts at an accessible, undergraduate level. This book is another gem of the genre Stillwell has done so much to enhance.’ Karen Hunger Parshall, University of Virginia ‘Stillwell, more than any author I know, helps us understand mathematics from its roots. In this book, he leads us into algebraic number theory along a historical route from concrete to abstract. In doing so, Stillwell makes a strong pedagogical case for flipping a typical algebraic number theory course ― that students will understand number theory better if questions about numbers come before and throughout the abstract theory of rings and ideals. The treatments of mathematics and its history are crystal clear and meticulous. Stillwell’s text is particularly well-suited for an advanced undergraduate or early graduate-level course in number theory. Experts also will find this text to be an incredible resource for its historical approach and well-motivated exercises. Stillwell has written another gem, this time for readers interested in number theory, abstract algebra, and their intertwined history.’ Martin Weissman, University of California, Santa Cruz About the Author John Stillwell is the author of many books on mathematics; among the best known are Mathematics and its History, Naive Lie Theory, and Elements of Mathematics. He is a member of the inaugural class of Fellows of the American Mathematical Society and winner of the Chauvenet Prize for mathematical exposition.

This book introduces algebraic number theory through the problem of generalizing 'unique prime factorization' from ordinary integers to more general domains. Solving polynomial equations in integers leads naturally to these domains, but unique prime factorization may be lost in the process. To restore it, we need Dedekind's concept of ideals. However, one still needs the supporting concepts of algebraic number field and algebraic integer, and the supporting theory of rings, vector spaces, and modules. It was left to Emmy Noether to encapsulate the properties of rings that make unique prime factorization possible, in what we now call Dedekind rings. The book develops the theory of these concepts, following their history, motivating each conceptual step by pointing to its origins, and focusing on the goal of unique prime factorization with a minimum of distraction or prerequisites. This makes a self-contained easy-to-read book, short enough for a one-semester course. Review ‘In Algebraic Number Theory for Beginners, John Stillwell once again displays his remarkable talent for using the history of mathematics to motivate and explore even the most abstract mathematical concepts at an accessible, undergraduate level. This book is another gem of the genre Stillwell has done so much to enhance.’ Karen Hunger Parshall, University of Virginia ‘Stillwell, more than any author I know, helps us understand mathematics from its roots. In this book, he leads us into algebraic number theory along a historical route from concrete to abstract. In doing so, Stillwell makes a strong pedagogical case for flipping a typical algebraic number theory course ― that students will understand number theory better if questions about numbers come before and throughout the abstract theory of rings and ideals. The treatments of mathematics and its history are crystal clear and meticulous. Stillwell’s text is particularly well-suited for an advanced undergraduate or early graduate-level course in number theory. Experts also will find this text to be an incredible resource for its historical approach and well-motivated exercises. Stillwell has written another gem, this time for readers interested in number theory, abstract algebra, and their intertwined history.’ Martin Weissman, University of California, Santa Cruz About the Author John Stillwell is the author of many books on mathematics; among the best known are Mathematics and its History, Naive Lie Theory, and Elements of Mathematics. He is a member of the inaugural class of Fellows of the American Mathematical Society and winner of the Chauvenet Prize for mathematical exposition.

Speaker: Charles Curtis Date: April, 2003

Speaker: Charles Curtis Date: April, 2003

With the advent of powerful computing tools and numerous advances in mathematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and interna1 pressures gave a powerful impetus to the development of more powerful algorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of applications, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc . . .

These are lecture notes for the class on introduction to algebraic number theory, given at NTU from January to April 2009 and 2010.

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by \O{}. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number fields.

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by \O{}. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number fields.

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by \O{}. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number fields.

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by \O{}. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number fields.

A powerful way to study groups is via their actions on suitable spaces. Classifying spaces for families of subgroups are a type of these spaces, obtained by imposing some strict conditions on the fixed-point sets. We show how in the framework of knot theory the notion of classifying spaces for families pops out naturally and we provide explicit models for them. The study of their topological properties hints at the existence of arcane connections between knot theory and algebraic number theory. Trying to track these connections, we discovered a behavioural analogy between the fundamental group of our classifying spaces and the ideal class group of an algebraic number field, a 9-term exact sequence for knots mimicking Poitou-Tate exact sequence for algebraic number fields and, in some cases, a second analogy between the first (co)homology group of the classifying spaces and the first Shafarevich group of a number field extension.

A powerful way to study groups is via their actions on suitable spaces. Classifying spaces for families of subgroups are a type of these spaces, obtained by imposing some strict conditions on the fixed-point sets. We show how in the framework of knot theory the notion of classifying spaces for families pops out naturally and we provide explicit models for them. The study of their topological properties hints at the existence of arcane connections between knot theory and algebraic number theory. Trying to track these connections, we discovered a behavioural analogy between the fundamental group of our classifying spaces and the ideal class group of an algebraic number field, a 9-term exact sequence for knots mimicking Poitou-Tate exact sequence for algebraic number fields and, in some cases, a second analogy between the first (co)homology group of the classifying spaces and the first Shafarevich group of a number field extension.

This is the first of three papers introducing a paradigm within which global algebraic number theory for the reals may be formulated so as to make possible the synthesis of algebraic and transcendental number theory into a coherent whole. We introduce diophantine approximation groups and their associated Kronecker foliations, using them to provide new algebraic and geometric characterizations of K-linear and algebraic dependence. As a consequence we find reformulations -- as algebraic and geometric (graph) rigidities -- of the Theorems of Baker and Lindemann-Weierstrass, the Logarithm Conjecture and the Schanuel Conjecture. There is an Appendix describing diophantine approximation groups as model theoretic types.

This is the first of three papers introducing a paradigm within which global algebraic number theory for the reals may be formulated so as to make possible the synthesis of algebraic and transcendental number theory into a coherent whole. We introduce diophantine approximation groups and their associated Kronecker foliations, using them to provide new algebraic and geometric characterizations of K-linear and algebraic dependence. As a consequence we find reformulations -- as algebraic and geometric (graph) rigidities -- of the Theorems of Baker and Lindemann-Weierstrass, the Logarithm Conjecture and the Schanuel Conjecture. There is an Appendix describing diophantine approximation groups as model theoretic types.

This is the first of three papers introducing a paradigm within which global algebraic number theory for the reals may be formulated so as to make possible the synthesis of algebraic and transcendental number theory into a coherent whole. We introduce diophantine approximation groups and their associated Kronecker foliations, using them to provide new algebraic and geometric characterizations of K-linear and algebraic dependence. As a consequence we find reformulations -- as algebraic and geometric (graph) rigidities -- of the Theorems of Baker and Lindemann-Weierstrass, the Logarithm Conjecture and the Schanuel Conjecture. There is an Appendix describing diophantine approximation groups as model theoretic types.

This is the first of three papers introducing a paradigm within which global algebraic number theory for the reals may be formulated so as to make possible the synthesis of algebraic and transcendental number theory into a coherent whole. We introduce diophantine approximation groups and their associated Kronecker foliations, using them to provide new algebraic and geometric characterizations of K-linear and algebraic dependence. As a consequence we find reformulations -- as algebraic and geometric (graph) rigidities -- of the Theorems of Baker and Lindemann-Weierstrass, the Logarithm Conjecture and the Schanuel Conjecture. There is an Appendix describing diophantine approximation groups as model theoretic types.

This is the first of three papers introducing a paradigm within which global algebraic number theory for the reals may be formulated so as to make possible the synthesis of algebraic and transcendental number theory into a coherent whole. We introduce diophantine approximation groups and their associated Kronecker foliations, using them to provide new algebraic and geometric characterizations of K-linear and algebraic dependence. As a consequence we find reformulations -- as algebraic and geometric (graph) rigidities -- of the Theorems of Baker and Lindemann-Weierstrass, the Logarithm Conjecture and the Schanuel Conjecture. There is an Appendix describing diophantine approximation groups as model theoretic types.

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to be done in the area. We hope to show that the study of algorithms not only increases our understanding of algebraic number fields but also stimulates our curiosity about them. The discussion is concentrated of three topics: the determination of Galois groups, the determination of the ring of integers of an algebraic number field, and the computation of the group of units and the class group of that ring of integers.

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to be done in the area. We hope to show that the study of algorithms not only increases our understanding of algebraic number fields but also stimulates our curiosity about them. The discussion is concentrated of three topics: the determination of Galois groups, the determination of the ring of integers of an algebraic number field, and the computation of the group of units and the class group of that ring of integers.

The following gives a summary of the main ideas you need to know as prerequisites to the Part B lecture course on Algebraic Number Theory. There is an associated optional Sheet 0 of questions for you to try, if you feel you need to refresh your skills in these topics. Most of you should have seen most of this material before in lecture courses from previous terms, but it is just as well to read through it carefully, in order to �ll in any gaps

These notes are modi�ed from previous versions (due to Neil Dummigan,Alan Lauder and Roger Heath-Brown) and have been recently revised by me. They draw mainly upon �A Classical Introduction to Modern Number Theory�, by Ireland and Rosen, and �Algebraic Number Theory�, by Stewart and Tall. While I take full responsibility for their current contents, considerable thanks are clearly due to Neil, Alan and Roger.

An algebraic number �eld is a �nite extension of Q; an algebraic number is an element of an algebraic number �eld. Algebraic number theory studies the arithmetic of algebraic number �elds � the ring of integers in the number �eld, the ideals and units in the ring of integers, the extent to which unique factorization holds, and so on. An abelian extension of a �eld is a Galois extension of the �eld with abelian Galois group. Class �eld theory describes the abelian extensions of a number �eld in terms of the arithmetic of the �eld. These notes are concerned with algebraic number theory, and the sequel with class �eld theory.

An algebraic number �eld is a �nite extension of Q; an algebraic number is an element of an algebraic number �eld. Algebraic number theory studies the arithmetic of algebraic number �elds � the ring of integers in the number �eld, the ideals and units in the ring of integers, the extent to which unique factorization holds, and so on. An abelian extension of a �eld is a Galois extension of the �eld with abelian Galois group. Class �eld theory describes the abelian extensions of a number �eld in terms of the arithmetic of the �eld. These notes are concerned with algebraic number theory, and the sequel with class �eld theory.

This is a survey on the theory of height zeta functions, written on the occasion of a French-Japanese winter school, held in Miura (Kanagawa, Japan) in Jan. 2008. It does not presuppose much knowledge in algebraic geometry. The last chapter of the survey explains recent results obtained in collaboration with Yuri Tschinkel concerning asymptotics of volumes of height balls in analytic geometry over local fields, or in adelic spaces.

This is a survey on the theory of height zeta functions, written on the occasion of a French-Japanese winter school, held in Miura (Kanagawa, Japan) in Jan. 2008. It does not presuppose much knowledge in algebraic geometry. The last chapter of the survey explains recent results obtained in collaboration with Yuri Tschinkel concerning asymptotics of volumes of height balls in analytic geometry over local fields, or in adelic spaces.

This report describes the main research achievements during the time period cited above on the research project in the area of wireless communications. The main achievements include new space-time/frequency code designs based on algebraic number theory, new space-time code designs with a new design criterion that achieve full spatial diversity when linear receivers such as MMSE and ZF receivers are used, and algebraic space-time code designs that achieve the full cooperative diversity in cooperative communications systems when synchronization between relay nodes does not hold, and also space-time codes for cooperative systems that are robust to both timing errors and frequency offsets.

This report describes the main research achievements during the time period cited above on the research project in the area of wireless communications. The main achievements include new space-time/frequency code designs based on algebraic number theory, new space-time code designs with a new design criterion that achieve full spatial diversity when linear receivers such as MMSE and ZF receivers are used, and algebraic space-time code designs that achieve the full cooperative diversity in cooperative communications systems when synchronization between relay nodes does not hold, and also space-time codes for cooperative systems that are robust to both timing errors and frequency offsets.

This report describes the main research achievements during the time period cited above on the research project in the area of wireless communications. The main achievements include new space-time/frequency code designs based on algebraic number theory, new space-time code designs with a new design criterion that achieve full spatial diversity when linear receivers such as MMSE and ZF receivers are used, and algebraic space-time code designs that achieve the full cooperative diversity in cooperative communications systems when synchronization between relay nodes does not hold, and also space-time codes for cooperative systems that are robust to both timing errors and frequency offsets.

This report describes the main research achievements during the time period cited above on the research project in the area of wireless communications. The main achievements include new space-time/frequency code designs based on algebraic number theory, new space-time code designs with a new design criterion that achieve full spatial diversity when linear receivers such as MMSE and ZF receivers are used, and algebraic space-time code designs that achieve the full cooperative diversity in cooperative communications systems when synchronization between relay nodes does not hold, and also space-time codes for cooperative systems that are robust to both timing errors and frequency offsets.

Algebraic Number Theory

Algebraic Number Theory

Algebraic Number Theory

Algebraic Number Theory

Algebraic Number Theory

Algebraic Number Theory

Algebraic Number Theory