Results 151 to 160 of about 45,358 (192)
Hypergraph coloring complexes.
Breuer F, Dall A, Kubitzke M.
europepmc +1 more source
The enumeration of inversion sequences avoiding the patterns 201 and 210
Jay Pantone
doaj +1 more source
On weighted and bounded multidimensional Catalan numbers
Ryota Inagaki, Dimana Pramatarova
doaj +1 more source
On the correspondence between integer sequences and vacillating tableaux
Zhanar Berikkyzy +4 more
doaj +1 more source
Enumerative Combinatorics [PDF]
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.
exaly +4 more sources
Tests and Proofs for Enumerative Combinatorics [PDF]
In this paper we show how the research domain of enumerative combinatorics can benefit from testing and formal verification. We formalize in Coq the combinatorial structures of permutations and maps, and a couple of related operations. Before formally proving soundness theorems about these operations, we first validate them, by using logic programming (
Alain Giorgetti, Catherine Dubois
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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.
Richard Stanley
exaly +2 more sources
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.
Richard 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.
Omer Nuri Egecioglu, Adriano Garsia
exaly +2 more sources

