Asymptotic Combinatorics and Algebraic Analysis

Anatoly M. Vershik ()
Additional contact information
Anatoly M. Vershik: Steklov Mathematical Institute St. Petersburg Branch Fontanka 27

A chapter in Proceedings of the International Congress of Mathematicians, 1995, pp 1384-1394 from Springer

Abstract: Abstract A large number of asymptotic questions in mathematics can be stated as combinatorial problems. I can give examples from algebra, analysis, ergodic theory, and so on. Therefore the study of asymtotic problems in combinatorics is stimulated enormously by taking into account the various approaches from different branches of mathematics. Recently we found many new aspects of this development of combinatories. The main question in this context is: What kind of limit behavior can have a combinatorial object when it “grows”?

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-9078-6_133

Ordering information: This item can be ordered from
http://www.springer.com/9783034890786

DOI: 10.1007/978-3-0348-9078-6_133

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().