pular para conteúdo
The mathematics of Paul Erdös Ver prévia deste item
FecharVer prévia deste item
Checando...

The mathematics of Paul Erdös

Autor: Paul Erdős; Ronald L Graham; Jaroslav Nešetřil
Editora: Berlin ; New York : Springer, ©1997.
Séries: Algorithms and combinatorics, 13-14.
Edição/Formato   Livro : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:

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,  Ler mais...

Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Formato Físico Adicional: Online version:
Mathematics of Paul Erdös.
Berlin ; New York : Springer, c1997
(OCoLC)625199562
Pessoa Denominada: Paul Erdős; Paul Erdős
Tipo de Documento: Livro
Todos os Autores / Contribuintes: Paul Erdős; Ronald L Graham; Jaroslav Nešetřil
ISBN: 3540610324 9783540610328 3540610316 9783540610311
Número OCLC: 35172609
Notas: "List of publications of Paul Erdös": p. [477]-573 (v. 2)
Descrição: 2 v. : ill. ; 24 cm.
Conteúdos: 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 ... [et al.] --
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.
Título da Série: Algorithms and combinatorics, 13-14.
Responsabilidade: Ronald L. Graham, Jaroslav Nešetřil, eds.

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.
Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<http://www.worldcat.org/oclc/35172609>
library:oclcnum"35172609"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/35172609>
rdf:typeschema:Book
schema:about
schema:about
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 ... [et al.] -- 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/40090518>
schema:inLanguage"en"
schema:name"The mathematics of Paul Erdös"@en
schema:publisher
schema:url
schema:workExample
schema:workExample
umbel:isLike<http://d-nb.info/948082127>

Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.