skip to content
Recurrence in ergodic theory and combinatorial number theory Preview this item
ClosePreview this item
Checking...

Recurrence in ergodic theory and combinatorial number theory

Author: Harry Furstenberg
Publisher: Princeton, N.J. : Princeton University Press, ©1981.
Series: M. B. Porter lectures, 1978.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Harry Furstenberg
ISBN: 0691082693 9780691082691
OCLC Number: 6625668
Notes: Includes index.
Description: vii, 202 p. ; 25 cm.
Series Title: M. B. Porter lectures, 1978.
Responsibility: H. Furstenberg.
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/6625668>
library:oclcnum"6625668"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/6625668>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:copyrightYear"1981"
schema:creator
schema:datePublished"1981"
schema:exampleOfWork<http://worldcat.org/entity/work/id/442480>
schema:inLanguage"en"
schema:name"Recurrence in ergodic theory and combinatorial number theory"@en
schema:numberOfPages"202"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.