Explore: Arithmetic Ground Fields
Discover books, insights, and more — all in one place.
Learn more about Arithmetic Ground Fields with top reads curated from trusted sources — all in one place.
AI-Generated Overview About “arithmetic-ground-fields”:
Books Results
Source: The Open Library
The Open Library Search Results
Search results from The Open Library
1Algebraic geometry codes
By M. A. Tsfasman, Michael Tsfasman, Serge Vladut and Dmitry Nogin

“Algebraic geometry codes” Metadata:
- Title: Algebraic geometry codes
- Authors: M. A. TsfasmanMichael TsfasmanSerge VladutDmitry Nogin
- Language: English
- Number of Pages: Median: 338
- Publisher: American Mathematical Society
- Publish Date: 2007 - 2019
- Publish Location: Providence, R.I
“Algebraic geometry codes” Subjects and Themes:
- Subjects: ➤ Algebraic Geometry - Coding theory - Number theory - Mathematical theory of computation - Mathematics - Computers - General Information - Science/Mathematics - Information Theory - Nonfiction - Advanced - Geometry, Algebraic - Geometry, algebraic - Algebraic geometry - Curves - Information and communication, circuits - Theory of error-correcting codes and error-detecting codes - Arithmetic problems. Diophantine geometry - Finite ground fields - Algebraic number theory: global fields - Arithmetic theory of algebraic function fields - Algebraic numbers; rings of algebraic integers - Finite fields and commutative rings (number-theoretic aspects) - Algebraic coding theory; cryptography - Zeta and $L$-functions: analytic theory - Zeta and $L$-functions in characteristic $p$ - Class field theory - Zeta functions and $L$-functions of number fields - Families, fibrations - Fine and coarse moduli spaces - Surfaces and higher-dimensional varieties - Arithmetic ground fields - Algebraische meetkunde - Coderingstheorie - Codage - Theorie des Nombres - Geometrie algebrique
Edition Identifiers:
- The Open Library ID: OL11420280M - OL37286938M - OL17179885M
- Online Computer Library Center (OCLC) ID: 1090163037 - 85822747
- Library of Congress Control Number (LCCN): 2007061731 - 2019003782
- All ISBNs: 0821843060 - 9780821843062 - 9781470448653 - 1470448653
Access and General Info:
- First Year Published: 2007
- Is Full Text Available: Yes
- Is The Book Public: No
- Access Status: Borrowable
Online Access
Downloads Are Not Available:
The book is not public therefore the download links will not allow the download of the entire book, however, borrowing the book online is available.
Online Borrowing:
- Borrowing from Open Library: Borrowing link
- Borrowing from Archive.org: Borrowing link
Online Marketplaces
Find Algebraic geometry codes at online marketplaces:
- Amazon: Audiable, Kindle and printed editions.
- Ebay: New & used books.
Wiki
Source: Wikipedia
Wikipedia Results
Search Results from Wikipedia
Arithmetic
that are ultimately grounded in the sensory world as described by the empirical sciences. Arithmetic is relevant to many fields. In daily life, it is
Anabelian geometry
topological homomorphisms between two arithmetic fundamental groups of two hyperbolic curves over number fields correspond to maps between the curves
List of first-order theories
example, the "theory of finite fields" consists of all sentences in the language of fields that are true in all finite fields. An Lσ theory may: be consistent:
Class field theory
local and global fields using objects associated to the ground field. Hilbert is credited as one of pioneers of the notion of a class field. However, this
Hilbert's program
Ultimately, the consistency of all of mathematics could be reduced to basic arithmetic. Gödel's incompleteness theorems, published in 1931, showed that Hilbert's
Factorization of polynomials over finite fields
interest in finite fields and this is partly due to important applications in coding theory and cryptography. Applications of finite fields introduce some
Satisfiability modulo theories
directly in SMT solvers; see, for instance, the decidability of Presburger arithmetic. SMT can be thought of as a constraint satisfaction problem and thus a
Reverse mathematics
Reverse mathematics is usually carried out using subsystems of second-order arithmetic, where many of its definitions and methods are inspired by previous work
Frobenius endomorphism
of finite fields is generated by an iterate of the Frobenius automorphism. First, consider the case where the ground field is the prime field Fp. Let Fq
Decidability (logic)
essentially undecidable. The theory of fields is undecidable but not essentially undecidable. Robinson arithmetic is known to be essentially undecidable