passa ai contenuti
The mathematics of Paul Erdös Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

The mathematics of Paul Erdös

Autore: Paul Erdős; Ronald L Graham; Jaroslav Nešetřil
Editore: Berlin ; New York : Springer, ©1997.
Serie: Algorithms and combinatorics, 13-14.
Edizione/Formato:   book_printbook : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:

This is a comprehensive survey of the mathematical life of Paul Erdos, covering all the main areas of his research. The book contains both high-level research articles, as well as "key" articles,  Per saperne di più…

Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Informazioni aggiuntive sul formato: Online version:
Mathematics of Paul Erdös.
Berlin ; New York : Springer, ©1997
(OCoLC)625199562
Persona incaricata: Paul Erdős; Paul Erdős
Tipo documento: Book
Tutti gli autori / Collaboratori: Paul Erdős; Ronald L Graham; Jaroslav Nešetřil
ISBN: 3540610324 9783540610328 3540610316 9783540610311
Numero OCLC: 35172609
Note: "List of publications of Paul Erdös": pages [477]-573 (v. 2).
Descrizione: 2 volumes : illustrations ; 24 cm.
Contenuti: Some of my favorite problems and results / P. Erdös --
Encounters with Paul Erdös / A.H. Stone --
Did Erdös save western civilization? / C.A.B. Smith --
Integers uniquely represented by certain ternary forms / I. Kaplansky --
On cubic graphs of girth at least five / W.T. Tutte --
Classical results on primitive and recent results on cross-primitive sequences / R. Ahlswede and L.H. Khachatrian --
Sur la non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires / G. Tenenbaum --
On additive representation functions / A. Sárközy and V.T. Sós --
Arithmetical properties of polynomials / A. Schinzel --
Cross-disjoint pairs of clouds in the interval lattice / R. Ahlswede and N. Cai --
Dense difference sets and their combinatorial structure / V. Bergelson [and others] --
On primes recognizable in deterministic polynomial time / S. Konyagin and C. Pomerance --
Ballot numbers, alternating products, and the Erdös-Heilbronn conjecture / M.B. Nathanson --
Integer sets containing no solution to x+y=3z / F.R.K. Chung and J.L. Goldwasser --
On Landau's function g(n) / J.-L. Nicolas --
On divisibility properties of sequences of integers / A. Sárközy --
Some methods of Erdós applied to finite arithmetic progressions / T.N. Shorey and R. Tijdeman --
First steps in a mysterious quest / G. Tenenbaum --
Games, randomness and algorithms / J. Beck --
The origins of the theory of random graphs / M. Karoński and A. Rucińsky --
The Erdós existence argument / J. Spencer --
On some hypergraph problems of Paul Erdós and the asymptotics of matchings, covers and colorings / J. Kahn --
How abelian is a finite group? / L. Pyber --
On small size approximation models / A.A. Razborov --
An upper bound for a communication game related to time-space tradeoffs / P. Pudlák and J. Sgall.
Titolo della serie: Algorithms and combinatorics, 13-14.
Responsabilità: Ronald L. Graham, Jaroslav Nešetřil, eds.

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


<http://www.worldcat.org/oclc/35172609>
library:oclcnum"35172609"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:copyrightYear"1997"
schema:datePublished"1997"
schema:description"Some of my favorite problems and results / P. Erdös -- Encounters with Paul Erdös / A.H. Stone -- Did Erdös save western civilization? / C.A.B. Smith -- Integers uniquely represented by certain ternary forms / I. Kaplansky -- On cubic graphs of girth at least five / W.T. Tutte -- Classical results on primitive and recent results on cross-primitive sequences / R. Ahlswede and L.H. Khachatrian -- Sur la non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires / G. Tenenbaum -- On additive representation functions / A. Sárközy and V.T. Sós -- Arithmetical properties of polynomials / A. Schinzel -- Cross-disjoint pairs of clouds in the interval lattice / R. Ahlswede and N. Cai -- Dense difference sets and their combinatorial structure / V. Bergelson [and others] -- On primes recognizable in deterministic polynomial time / S. Konyagin and C. Pomerance -- Ballot numbers, alternating products, and the Erdös-Heilbronn conjecture / M.B. Nathanson -- Integer sets containing no solution to x+y=3z / F.R.K. Chung and J.L. Goldwasser -- On Landau's function g(n) / J.-L. Nicolas -- On divisibility properties of sequences of integers / A. Sárközy -- Some methods of Erdós applied to finite arithmetic progressions / T.N. Shorey and R. Tijdeman -- First steps in a mysterious quest / G. Tenenbaum -- Games, randomness and algorithms / J. Beck -- The origins of the theory of random graphs / M. Karoński and A. Rucińsky -- The Erdós existence argument / J. Spencer -- On some hypergraph problems of Paul Erdós and the asymptotics of matchings, covers and colorings / J. Kahn -- How abelian is a finite group? / L. Pyber -- On small size approximation models / A.A. Razborov -- An upper bound for a communication game related to time-space tradeoffs / P. Pudlák and J. Sgall."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1848023090>
schema:inLanguage"en"
schema:isPartOf
schema:name"The mathematics of Paul Erdös"@en
schema:publication
schema:publisher
schema:workExample
schema:workExample
umbel:isLike<http://d-nb.info/948082127>
wdrs:describedby

Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.