Book Chapter10.1007/978-0-8176-4842-8_25
On the Foundations of Combinatorial Theory
Gian-Carlo Rota
- 01 Jan 2009
- pp 332-360
809
TL;DR: One of the most useful principles of enumeration in discrete probability and combinatorial theory is the celebrated principle of inclusion-exclusion (ef. Feller*, FrEchet, Riordan, Ryser).
read more
Abstract: One of the most useful principles of enumeration in discrete probability and combinatorial theory is the celebrated principle of·inclusion-exclusion (ef. Feller*, FrEchet, Riordan, Ryser). When skillfully applied, this principle has yielded the solution to many a combinatorial problem. Its mathematical foundations were thoroughly investigated not long ago in a monograph by FrEchet, and it might at first appear that, after such exhaustive work, little else could be said on the subject.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Broken circuit complexes of series-parallel networks
TL;DR: A formula for the difference h s - 1 - h 1 in terms of an ear decomposition of G, a characterization of outerplanar graphs, and a solution to a conjecture on A -graphs posed by Fenton are provided.
Metrically homogeneous graphs: dynamical properties of their automorphism groups and the classification of twists
Rebecca Coulson
- 01 Jan 2019
TL;DR: In this paper, the authors investigate the properties of graphs which are homogeneous in the sense of Fraíssé when considered as metric spaces with the graph metric, and particularly the metrically homogeneous graphs of generic type constructed by Cherlin.
•Posted Content
Shellability of face posets of electrical networks and the CW poset property
Patricia Hersh,Richard Kenyon +1 more
TL;DR: It is proved that the face posets of stratified spaces of planar resistor networks are shellable, and certain subposets of uncrossing partial orders are shown to be isomorphic to type A Bruhat order intervals.
Combinatorial Structure of the Polytope of 2-Additive Measures
TL;DR: A triangulation is built of this polytope of 2-additive measures satisfying that all simplices in the triangulations have the same volume, which allows a very simple and appealing way to generate points in a random way in thispolytope.
The bihecke monoid of a finite coxeter group and its representations
TL;DR: For any finite Coxeter group W, this article introduced two new objects: its cutting poset and its biHecke monoid, which almost forms a lattice on W.
References
An Introduction To The Theory Of Numbers
G. H. Hardy,Ernest M. Wright +1 more
- 31 Jul 2008
TL;DR: An Introduction to the Theory of Numbers is a classic text in elementary number theory covering key milestones and developments in the field. It is highly suitable for undergraduates and number theorists alike.
2.3K
An Introduction to Combinatorial Analysis.
N. J. Fine,John Riordan +1 more
TL;DR: The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press.This book introduces combinatorial analysis to the beginning student.
1.5K
A Contribution to the Theory of Chromatic Polynomials
TL;DR: In this paper, a polynomial χ(G, x, y) in two variables x and y, which can be regarded as generalizing both θ(G and n) and ϕ(G n) is studied.
1.1K