Results 161 to 170 of about 35,860 (197)
Enumerative Combinatorics [PDF]
, 2022 Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, probability theory, graph theory and computer science.
openaire +2 more sources
Enumerative Combinatorics [PDF]
, 2018 Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science.
core +3 more sources
Oberwolfach ReportsEnumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to several disciplines, including probability theory, geometry, algebra, statistical physics, computer science, and biology. Within combinatorics, it has strong links with structural graph theory and with algebraic combinatorics, in
Guillaume Chapuy +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1986
Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled ...
Richard P Stanley
exaly +2 more sources
Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled ...
Richard P Stanley
exaly +2 more sources
Lessons in Enumerative Combinatorics
Graduate Texts in Mathematics, 20211. Basic Combinatorial Structures.- 2. Partitions and Generating Functions.- 3. Planar Trees and the Lagrange Inversion Formula.- 4. Cayley Trees.- 5. The Cayley-Hamilton Theorem.- 6. Exponential Structures and Polynomial Operators.- 7. The Inclusion-Exclusion Principle.- 8. Graphs, Chromatic Polynomials and Acyclic Orientations.- 9.
Ömer Eğecioğlu, Adriano M Garsia
exaly +2 more sources
Enumerative combinatorics on words
, 2015 Combinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory. The present interest in the field is pushed by its links with several connexions with other topics external to pure mathematics ...
Perrin, Dominique, Restivo, Antonio
core +5 more sources
What Is Enumerative Combinatorics?
1986The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set I (such as the nonnegative integers ℕ), and we wish to count the number ƒ(i) of elements of each S i “simultaneously.” Immediate philosophical difficulties ...
Richard P Stanley
exaly +2 more sources
Oberwolfach Reports, 2023
Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, probability theory, graph theory and computer science.
Mireille Bousquet-Mélou +3 more
openaire +1 more source
Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, probability theory, graph theory and computer science.
Mireille Bousquet-Mélou +3 more
openaire +1 more source