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.

Topic Search

Search for any topic

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

Book's cover

“Algebraic geometry codes” Metadata:

  • Title: Algebraic geometry codes
  • Authors:
  • Language: English
  • Number of Pages: Median: 338
  • Publisher: American Mathematical Society
  • Publish Date:
  • Publish Location: Providence, R.I

“Algebraic geometry codes” Subjects and Themes:

Edition Identifiers:

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:

Online Marketplaces

Find Algebraic geometry codes at online marketplaces:



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