Vocabulary of Combinatorial Analysis

Louis Comtet
Additional contact information
Louis Comtet: University of Paris-Sud

Chapter Chapter I in Advanced Combinatorics, 1974, pp 1-93 from Springer

Abstract: Abstract In this chapter we define the language we will use and we introduce those elementary concepts which will be referred to throughout the book. As much as possible, the chosen notations will not be new; we will use only those that actually occur in publications. We will not be afraid to use two different symbols for the same thing, as one may be preferable to the other, depending on circumstances. Thus, for example, Ā and ∁ A both denote the complement of A, A ∩ B and AB stand for the intersection of A and B, etc. For the rest, it seems desirable to avoid taking positions and to obtain the flexibility which is necessary to be able to read different authors.

Keywords: Recurrence Relation; Formal Series; Euler Number; Minimal Path; Double Sequence (search for similar items in EconPapers)
Date: 1974
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-94-010-2196-8_1

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

DOI: 10.1007/978-94-010-2196-8_1

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 ().