Princeton companion to mathematics

By T. Gowers. 2008

312 citations recorded by the source corpus.

Subfields: Theoretical Computer Science

View Paper: https://www.semanticscholar.org/paper/a7bae89963046e83ddbcf8be38afee10135e1187

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Theoretical Computer Science

1. Paul B. Garrett

Citations in the corpus

• Primes in Arithmetic Progressions (2011, methodology): “We obtain (4) by computing a sum in two ways, using (6) and (7) respectively:”
• A discrete Gauss-Bonnet type theorem (2010, unknown): “Our starting point had been to extend Jacobi fields to the discrete for numerical purposes: for a discretized Jacobi field with smallest space step 1, we have f (0) = f(2)− 2f(1) + f(0) = f(2)− 2f(1).”
• NaturalProofs: Mathematical Theorem Proving in Natural Language (2021, background): “However, this setting does not directly address the informal aspect of human mathematics, which is conveyed with a mixture of symbolic and natural language [13].”