Number theory informed computation (14 risultati)

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New. 2026. hardcover. . . . . .

Condizione: New.

Hardcover. Condizione: Brand New. 325 pages. 10.00x7.00x1.44 inches. In Stock.

Condizione: As New. Unread book in perfect condition.

Condizione: New. 2026. hardcover. . . . . . Books ship from the US and Ireland.

Condizione: New.

Condizione: New.

Hardback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is a collection of lecture notes from the Graduate Summer School ''Number Theory Informed by Computation'' held at the IAS/Park City Mathematics Institute 2022. The lectures address topics at the interface between number theory and computation, both terms interpreted broadly. Included are lectures on polynomial-time algorithms for problems in algebraic number theory, algorithms for counting points on mod $p$ reduction of a variety working with many values of $p$ simultaneously, arithmetic statistics, the theory of lattices, Brauer-Manin obstruction, the theory of rigid cocycles, and the inverse Galois problem. The volume starts with the notes of Hendrik Lenstra's public lecture, aimed at a general audience, where the speaker explains how modern abstract algebra can be used to explain concrete properties of integers. This volume is aimed at students with a background in graduate level number theory. For some expositions, undergraduate abstract algebra may be sufficient, while others might require basic algebraic geometry. 325 pp. Englisch.…

Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book is a collection of lecture notes from the Graduate Summer School ''Number Theory Informed by Computation'' held at the IAS/Park City Mathematics Institute 2022. The lectures address topics at the interface between number theory and computation, both terms interpreted broadly. Included are lectures on polynomial-time algorithms for problems in algebraic number theory, algorithms for counting points on mod $p$ reduction of a variety working with many values of $p$ simultaneously, arithmetic statistics, the theory of lattices, Brauer-Manin obstruction, the theory of rigid cocycles, and the inverse Galois problem. The volume starts with the notes of Hendrik Lenstra's public lecture, aimed at a general audience, where the speaker explains how modern abstract algebra can be used to explain concrete properties of integers. This volume is aimed at students with a background in graduate level number theory. For some expositions, undergraduate abstract algebra may be sufficient, while others might require basic algebraic geometry.…