9786131297762 - ordered partition of a set: combinatorics, mathematics, sequence, subset, disjoint sets, partition of a set, exponential generating function (4 risultati)
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 34,00
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 subs…ets 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). 88 pp. Englisch.
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 37,09
EUR 30,50 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 o…f 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).
- Brossura
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 109,85
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Ordered Partition of a Set | Combinatorics, Mathematics, Sequence, Subset, Disjoint Sets, Partition of a Set, Exponential Generating Function | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131297762 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Len…gericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 136,00
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In combinatorialmathematics, 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, andpairwise disjoint. This differs from a partition of a set, in that theorder of the Ai matters.Combinatorics is a branch of mathematicsconcerning the study of finite or countable discrete structures. Aspectsof combinatorics include counting the structures of a given kind andsize (enumerative combinatorics), deciding when certain criteria can bemet, and constructing and analyzing objects meeting the criteria (as incombinatorial designs and matroid theory), finding 'largest''smallest', or 'optimal' objects (extremal combinatorics andcombinatorial optimization), and studying combinatorial structuresarising in an algebraic context, or applying algebraic techniques tocombinatorial problems (algebraic combinatorics).VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 88 pp. Englisch.
