Explore: Gauss Sums
Discover books, insights, and more — all in one place.
Learn more about Gauss Sums with top reads curated from trusted sources — all in one place.
AI-Generated Overview About “gauss-sums”:
Books Results
Source: The Open Library
The Open Library Search Results
Search results from The Open Library
1Gauss Diagram Invariants for Knots and Links
By T. Fiedler

“Gauss Diagram Invariants for Knots and Links” Metadata:
- Title: ➤ Gauss Diagram Invariants for Knots and Links
- Author: T. Fiedler
- Language: English
- Number of Pages: Median: 428
- Publisher: Springer
- Publish Date: 2001
“Gauss Diagram Invariants for Knots and Links” Subjects and Themes:
- Subjects: Knot theory - Invariants - Link theory - Gauss sums - Gaussian sums
Edition Identifiers:
- The Open Library ID: OL11152414M
- Online Computer Library Center (OCLC) ID: 47240758
- Library of Congress Control Number (LCCN): 2001038251
- All ISBNs: 0792371127 - 9780792371120
First Setence:
"Let pr : F2 x R F2 denote the standard projection."
Access and General Info:
- First Year Published: 2001
- Is Full Text Available: No
- Is The Book Public: No
- Access Status: No_ebook
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 Gauss Diagram Invariants for Knots and Links at online marketplaces:
- Amazon: Audiable, Kindle and printed editions.
- Ebay: New & used books.
2Gauss diagram invariants for knots and links
By Thomas Fiedler
“Gauss diagram invariants for knots and links” Metadata:
- Title: ➤ Gauss diagram invariants for knots and links
- Author: Thomas Fiedler
- Language: English
- Number of Pages: Median: 412
- Publisher: Kluwer Academic Publishers
- Publish Date: 2001
- Publish Location: Boston - Dordrecht
“Gauss diagram invariants for knots and links” Subjects and Themes:
- Subjects: Link theory - Knot theory - Gauss sums
Edition Identifiers:
- The Open Library ID: OL21801178M
- Library of Congress Control Number (LCCN): 2001038251
- All ISBNs: 0792371127 - 9780792371120
Access and General Info:
- First Year Published: 2001
- Is Full Text Available: No
- Is The Book Public: No
- Access Status: No_ebook
Online Marketplaces
Find Gauss diagram invariants for knots and links at online marketplaces:
- Amazon: Audiable, Kindle and printed editions.
- Ebay: New & used books.
Wiki
Source: Wikipedia
Wikipedia Results
Search Results from Wikipedia
Gauss sum
non-unit r, where it takes the value 0. Gauss sums are the analogues for finite fields of the Gamma function. Such sums are ubiquitous in number theory. They
Quadratic Gauss sum
In number theory, quadratic Gauss sums are certain finite sums of roots of unity. A quadratic Gauss sum can be interpreted as a linear combination of
Carl Friedrich Gauss
Johann Carl Friedrich Gauss (/ɡaʊs/ ; German: Gauß [kaʁl ˈfʁiːdʁɪç ˈɡaʊs] ; Latin: Carolus Fridericus Gauss; 30 April 1777 – 23 February 1855) was a German
Exponential sum
restricted by some inequality. Examples of complete exponential sums are Gauss sums and Kloosterman sums; these are in some sense finite field or finite ring analogues
List of things named after Carl Friedrich Gauss
exponential sum over Dirichlet characters Elliptic Gauss sum, an analog of a Gauss sum Quadratic Gauss sum Gaussian quadrature Gauss–Hermite quadrature Gauss–Jacobi
Gaussian period
of sums of roots of unity, now generally called Gauss sums (sometimes Gaussian sums). The quantity P − P* presented above is a quadratic Gauss sum mod
Central charge
the higher Gauss sums: ζ n = ∑ a d a 2 θ a n | ∑ a d a 2 θ a n | . {\displaystyle \zeta _{n}={\frac {\sum _{a}d_{a}^{2}\theta _{a}^{n}}{|{\sum _{a}d_{a}^{2}\theta
Proofs of quadratic reciprocity
primitive pth root of unity. This is a quadratic Gauss sum. A fundamental property of these Gauss sums is that g p 2 = p ∗ {\displaystyle g_{p}^{2}=p^{*}}
Quantum algorithm
discrete logarithm problem reduces to Gauss sum estimation, an efficient classical algorithm for estimating Gauss sums would imply an efficient classical
Gauss–Newton algorithm
The Gauss–Newton algorithm is used to solve non-linear least squares problems, which is equivalent to minimizing a sum of squared function values. It is