Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Inclusion-exclusion principle
Details
In combinatorial mathematics, the inclusion exclusion principle (also known as the sieve principle) states that if A1, ..., An are finite sets, then where A denotes the cardinality of the set A. For example, taking n = 2, we get a special case of double counting; in words: we can count the size of the union of sets A and B by adding A and B and then subtracting the size of their intersection. The name comes from the idea that the principle is based on over-generous inclusion, followed by compensating exclusion. When n 2 the exclusion of the pairwise intersections is (possibly) too severe, and the correct formula is as shown with alternating signs. This formula is attributed to Abraham de Moivre; it is sometimes also named for Daniel da Silva, Joseph Sylvester or Henri Poincaré. Inclusion exclusion illustrated for three sets Counts of each region with progressively more terms used for n = 4 For the case of three sets A, B, C the inclusion exclusion principle is illustrated in the graphic on the right.
Klappentext
In combinatorial mathematics, the inclusion-exclusion principle (also known as the sieve principle) states that if A1, ..., An are finite sets, then where |A| denotes the cardinality of the set A. For example, taking n = 2, we get a special case of double counting; in words: we can count the size of the union of sets A and B by adding |A| and |B| and then subtracting the size of their intersection. The name comes from the idea that the principle is based on over-generous inclusion, followed by compensating exclusion. When n 2 the exclusion of the pairwise intersections is (possibly) too severe, and the correct formula is as shown with alternating signs. This formula is attributed to Abraham de Moivre; it is sometimes also named for Daniel da Silva, Joseph Sylvester or Henri Poincaré. Inclusion-exclusion illustrated for three sets Counts of each region with progressively more terms used for n = 4 For the case of three sets A, B, C the inclusion-exclusion principle is illustrated in the graphic on the right.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130249649
- Editor Frederic P. Miller, Agnes F. Vandome, John McBrewster
- Sprache Englisch
- Größe H220mm x B150mm x T5mm
- Jahr 2010
- EAN 9786130249649
- Format Fachbuch
- ISBN 978-613-0-24964-9
- Titel Inclusion-exclusion principle
- Untertitel Combinatorics, Mathematics, Cardinality, Double counting (proof technique), Union (set theory), Intersection (set theory), Abraham de Moivre, Daniel da Silva (mathematician)
- Gewicht 147g
- Herausgeber Alphascript Publishing
- Anzahl Seiten 88
- Genre Mathematik