CRGreathouse

• Number theory: analytic (multiplicative and additive), algebraic, and general
• Computational mathematics, including numerical analysis
• Set theory and reverse mathematics: ZF, KPU, NBG, MK, GST
• Cramér's conjecture
• Wikipedia:Requested articles/Mathematics/Category:Mathematics articles needing expert attention
• Unsolved problems in mathematics
• Ex falso quodlibet
• A=B
• Lagrange interpolating polynomial
• Tarski–Seidenberg theorem vs. Richardson's theorem
• Fundamental theorem of arithmetic generalized by the Jordan–Hölder theorem
• List of numbers#Numbers not known with high precision
• Risch algorithm etc.

• Efficient market hypothesis
• Kemeny-Young method
• Duverger's law/Black's theorem/Hotelling's law
• Pigouvian tax
• Price of anarchy

• Computational complexity of mathematical operations
• Limits of computation: Bekenstein bound, Bremermann's limit, Landauer's principle

• Holevo's theorem; superdense coding and quantum teleportation; quantum fingerprinting
• Quantum error correction: [[5,1,3]] stabilizer code; [[7,1,3]] code; toric code and surface code; low-density parity-check code

• Polarity (international relations)
• Social choice theory
• Government secrecy especially in the US and UK

• Typeface anatomy
• Linguistic typology; theoretical linguistics; computational and corpus linguistics

• Wikipedia grep
• PetScan (Wikipedia category search)
• Help:Magic words
• Interwiki linking
• User:Eubot/Hatnote formatting

As in the userboxes, plus:

• Web design languages like HTML, JavaScript, PHP, and CSS
• Esolangs like BF/P′′
• Fun languages like Forth and Scheme

• Modigliani–Miller theorem
• Ricardian equivalence
• Coase theorem

Take a collection of properties; at least one of them must be false. In principle, all theorems can be rewritten in such a form, but some are more striking in this form. These are antinomies or (in Quine's terminology) veridical paradoxes.

• Arrow's theorem: "Good" voting systems can't be IIA.
• Gibbard–Satterthwaite theorem: "Good" voting systems can be manipulated (unique winner).
• Duggan–Schwartz theorem: "Good" voting systems can be manipulated (winning set).
• Fundamental theorems of welfare economics
• Holmström's theorem
• Abel–Ruffini theorem
• Gödel's incompleteness theorems

Barry A. Cipra, The Best of the 20th Century: Editors Name Top 10 Algorithms, SIAM News, 33:4.

1. Monte Carlo method, 1946
2. simplex method for linear programming, 1947
3. Krylov subspace iteration methods, 1950
4. decompositional approach to matrix computations, 1951
5. Fortran optimizing compiler, 1957
6. QR algorithm, 1959–61
7. Quicksort, 1962
8. fast Fourier transform, 1965
9. integer relation detection algorithm, 1977
10. fast multipole algorithm, 1987

Among others:

1. Chocho language
2. Eggon language
3. Manam language
4. Shubi language
5. Coatlán Zapotec language
6. Landau set
7. Peyton Young
8. Duggan-Schwartz theorem
9. John H. Smith (mathematician)
10. Karatsuba algorithm
11. Quasitransitive relation
12. Saraveca
13. Double exponential function
14. ALL (complexity)

1. Tradable (old)
2. May's theorem (old)
3. Dickman-de Bruijn function‎ (old)

• User:CRGreathouse/Arrow
• User:CRGreathouse/Large and small sets

This section is for my note-taking and random links.

• Ramanujan papers and notebooks (see also [1])
• ISO 639-3 codes on SIL and ISO 639-2 codes on LoC
• Things I forget: Emotive conjugation, Jeffreys prior = pseudocount of 1/2 (see additive smoothing), smoothing via Newton–Cotes
• Location: Observable universe, Pisces–Cetus Supercluster Complex, Virgo Supercluster, Local Volume, Local Sheet, Local Group, Milky Way, Orion Arm, Local Bubble, Local Interstellar Cloud, Solar System, Earth, North America