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.
Ordered Partition of a Set
CHF 42.80
Auf Lager
SKU
EH9V3DB6K3U
1 Verfügbar 
Geliefert zwischen Do., 05.02.2026 und Fr., 06.02.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In combinatorial mathematics, an ordered partition O of a set S is a sequence A1, A2, A3, ..., An of subsets of S, with union is S, which are non-empty, and pairwise disjoint. This differs from a partition of a set, in that the order of the Ai matters.Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria (as in combinatorial designs and matroid theory), finding "largest", "smallest", or "optimal" objects (extremal combinatorics and combinatorial optimization), and studying combinatorial structures arising in an algebraic context, or applying algebraic techniques to combinatorial problems (algebraic combinatorics).
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131297762
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131297762
- Format Fachbuch
- Titel Ordered Partition of a Set
- Herausgeber Betascript Publishing
- Anzahl Seiten 88
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
