An arrangement of hyperplanes of Euclidean or projective d-space is a finite set of hyperplanes, together with the induced partition of the space. Given the hyperplanes of an arrangement, how can the faces of the induced partition be counted? Heretofore this question has been an…
Eulerian numbers
by Petersen, T. Kyle, (Thomas Kyle)
fromBirkhäuser advanced texts (En ligne)
This text presents the Eulerian numbers in the context of modern enumerative, algebraic, and geometric combinatorics. The book first studies Eulerian numbers from a purely combinatorial point of view, then embarks on a tour of how these numbers arise in the study of hyperplane a…
This text presents the Eulerian numbers in the context of modern enumerative, algebraic, and geometric combinatorics. The book first studies Eulerian numbers from a purely combinatorial point of view, then embarks on a tour of how these numbers arise in the study of hyperplane a…
This text presents the Eulerian numbers in the context of modern enumerative, algebraic, and geometric combinatorics. The book first studies Eulerian numbers from a purely combinatorial point of view, then embarks on a tour of how these numbers arise in the study of hyperplane a…
Volume 1. Boolean domain
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for br…
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for br…
Combinatorial enumeration
by Jackson, D. M., Goulden, I. P.
fromWiley-Interscience publication