Jorge L. Ramírez Alfonsín
- Published in print:
- 2005
- Published Online:
- September 2007
- ISBN:
- 9780198568209
- eISBN:
- 9780191718229
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780198568209.001.0001
- Subject:
- Mathematics, Algebra, Combinatorics / Graph Theory / Discrete Mathematics
During the early part of the last century, F. G. Frobenius raised, in his lectures, the following problem (called the Diophantine Frobenius Problem FP): given relatively prime positive integers a1, . ...
More
During the early part of the last century, F. G. Frobenius raised, in his lectures, the following problem (called the Diophantine Frobenius Problem FP): given relatively prime positive integers a1, . . . , an, find the largest natural number (called the Frobenius number and denoted by g(a1, . . . , an)) that is not representable as a nonnegative integer combination of a1, . . . , an. It turned out that the knowledge of g(a1, . . . , an) has been extremely useful to investigate many different problems. A number of methods, from several areas of mathematics, have been used in the hope of finding a formula giving the Frobenius number and algorithms to calculate it. The main intention of this book is to highlight such ‘methods, ideas, viewpoints, and applications’ for as wide an audience as possible. This book aims to provide a comprehensive exposition of what is known today on FP.Less
During the early part of the last century, F. G. Frobenius raised, in his lectures, the following problem (called the Diophantine Frobenius Problem FP): given relatively prime positive integers a1, . . . , an, find the largest natural number (called the Frobenius number and denoted by g(a1, . . . , an)) that is not representable as a nonnegative integer combination of a1, . . . , an. It turned out that the knowledge of g(a1, . . . , an) has been extremely useful to investigate many different problems. A number of methods, from several areas of mathematics, have been used in the hope of finding a formula giving the Frobenius number and algorithms to calculate it. The main intention of this book is to highlight such ‘methods, ideas, viewpoints, and applications’ for as wide an audience as possible. This book aims to provide a comprehensive exposition of what is known today on FP.
Category Theory
Cyclic Modules and the Structure of Rings
Hilbert Modular Forms and Iwasawa Theory
Krylov Subspace Methods
