Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...random graphs <math>G(n,n^{-a})</math>.{{r|berarducci}} A key tool in the proof is the [[Ehrenfeucht–Fraïssé game]].{{r|frank}} ...d by elegant writing", recommending it to [[probability theory|probability theorists]] and [[mathematical logic|logicians]].{{r|kolchin}} Reviewer Alessandro Be ...
    4 KB (607 words) - 03:35, 19 February 2025
  • }}.</ref> and for his unusual proof that there exist infinitely many ''n'' for which [[Category:French number theorists]] ...
    3 KB (446 words) - 04:17, 13 July 2024
  • ...itae], retrieved January 25, 2015.</ref> and is particularly known for his proof of explicit degree bounds that can be used to turn [[Hilbert's Nullstellens [[Category:American number theorists]] ...
    4 KB (528 words) - 07:52, 6 May 2024
  • ...semigroup context that Markov introduced the above notion that that group theorists came to call the ''Markov property'' of finitely presented groups. This Mar ...[[Mathematical Reviews]]'' review of Rabin's 1958 paper containing Rabin's proof of the Adyan–Rabin theorem. ...
    8 KB (1,205 words) - 16:19, 13 January 2025
  • Greenberg's results include a proof (joint with [[Glenn Stevens (mathematician)|Glenn Stevens]]) of the [[Mazur [[Category:American number theorists]] ...
    4 KB (544 words) - 07:52, 6 May 2024
  • ...h> at the optimum. This is the core method for his subsequent constructive proof(1964) that the number of Nash( bimatrix) equilibrium points is odd. [[Category:American game theorists]] ...
    5 KB (578 words) - 05:17, 20 July 2024
  • ...mber fields'', Annals of Mathematics, vol. 109, 1979, pp. 377–395. Another proof was provided by W. Sinnott, Inventiones Mathematicae, vol. 75, 1984, 273.</ [[Category:American number theorists]] ...
    5 KB (589 words) - 07:48, 6 May 2024
  • * A proof of Langlands conjecture on Plancherel measures; Complementary series for p- [[Category:Number theorists]] ...
    5 KB (691 words) - 10:32, 9 June 2024
  • * {{cite journal|doi=10.1017/S0308210500024422|title=A rigorous proof of an exponentially small estimate for a boundary value arising from an ord [[Category:Dynamical systems theorists]] ...
    9 KB (1,192 words) - 09:02, 22 August 2024
  • ...important cases without assuming any <math>\mu = 0</math> hypothesis. The proof relies on the classical (non-equivariant) Iwasawa main conjecture proven by [[Category:Number theorists]] ...
    9 KB (1,098 words) - 07:11, 8 December 2024
  • ...|archive-date=2009-02-20 }}</ref> Pintz joined the team and completed the proof in 2005 and developed the so called [[GPY sieve]]. Later, they improved thi [[Category:Number theorists]] ...
    5 KB (772 words) - 15:40, 22 September 2024
  • ...ondon Mathematical Society]]. Second Series vol. 7 (1973), no. 2, 246–250 (proof of the theorem on the compact core) {{doi|10.1112/jlms/s2-7.2.246}} ...ic.''] J. London Math. Soc. Second Series vol. 17 (1978), no. 3, 555–565. (proof that surface groups are [[LERF]]) {{doi|10.1112/jlms/s2-17.3.555}} ...
    8 KB (939 words) - 12:17, 18 July 2024
  • *{{cite journal|doi=10.1090/S0002-9939-1983-0702313-2|title=A short proof of the algebraic Weierstrass preparation theorem|journal=[[Proceedings of t ...r=1983|last1=Gersten|first1=S. M.|doi-access=free}} (This paper presents a proof of a conjecture made by [[G. Peter Scott]].) ...
    7 KB (921 words) - 17:18, 17 September 2024
  • ...his strictly as an "[[Immersion (mathematics)|immersion]]", but many graph theorists, including Erdős, Harary and Tutte, use the term "[[embedding]]".</ref> {{hidden begin|style=border:solid 1px #aaa|toggle=left|title=Proof}} ...
    9 KB (1,458 words) - 07:19, 14 August 2023
  • {{Short description|Mathematical proof technique}} ...a jumping''', also known as '''root flipping''', is a [[Mathematical proof|proof technique]]. It is most often used for problems in which a relation between ...
    15 KB (2,327 words) - 15:08, 17 February 2024
  • title=A simpler proof and a generalization of the zero-trees theorem| ...oi=10.1556/sscmath.38.2001.1-4.17}}</ref> made further progress toward the proof of the conjecture. ...
    14 KB (1,964 words) - 20:23, 25 January 2025
  • ...s Hamiltonian. It is named after [[Herbert Fleischner]], who published its proof in 1974. ...problem which has for several years defeated the ingenuity of other graph-theorists".<ref>{{MR|0332573}}.</ref> ...
    14 KB (1,770 words) - 11:39, 12 January 2024
  • ...ewtonian 4-body problem — however, at the time there was still no rigorous proof. See {{cite journal|author=Gerver, Joseph L.|title=Noncollision Singulariti ...a finite time interval) must be of the collision type. However, Painlevé's proof did not extend to the case <math> N > 3 </math>. ...
    9 KB (1,188 words) - 19:57, 27 February 2025
  • ...y Webster.<ref>{{cite journal|last=Webster|first= Sidney, M.|title= On the Proof of Kuranishi's Embedding Theorem|journal=[[Annales Henri Poincaré|Annales d [[Category:Partial differential equation theorists]] ...
    8 KB (1,131 words) - 08:24, 24 January 2025
  • ...ref> on the open access repository [[arXiv]] that made a more consolidated proof of Maynard and Tao's postulate but involving Carmichael numbers into the tw [[Category:American number theorists]] ...
    7 KB (960 words) - 15:24, 1 March 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)