Knygos.lt klubas Knygos.lt nariams
20,29 €
-30%
Įprastai
28,99 €
Combinatorics of Finite Sets
Combinatorics of Finite Sets
Knygos.lt klubas Knygos.lt nariams
20,29 €
-30%
Įprastai
28,99 €
  • Išsiųsime per 12–18 d.d.
Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result concerning k-saturated chain partitions of general partially ordered sets. Connections with Dilworth's theorem, the marriage problem, and probability are also discussed. Each chapter ends with a helpful series of exercises and outline solutions appear…
  • Leidėjas:
  • ISBN-10: 0486422577
  • ISBN-13: 9780486422572
  • Formatas: 13.7 x 21.5 x 1.5 cm, minkšti viršeliai
  • Kalba: Anglų

Combinatorics of Finite Sets (el. knyga) (skaityta knyga) | knygos.lt

Atsiliepimai

(3.75 Goodreads įvertinimas)

Aprašymas

Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result concerning k-saturated chain partitions of general partially ordered sets. Connections with Dilworth's theorem, the marriage problem, and probability are also discussed. Each chapter ends with a helpful series of exercises and outline solutions appear at the end. An excellent text for a topics course in discrete mathematics. -- Bulletin of the American Mathematical Society.

Knygos.lt klubas
Knygos.lt nariams
20,29 €
-30%
Įprastai
28,99 €
Kaina registruotiems pirkėjams
Prisijunkite ir už šią prekę
gausite 0,29 Knygų Eurų!?
Išsiųsime per 12–18 d.d.
Įsigykite dovanų kuponą
Daugiau
  • Autorius: Ian Anderson
  • Leidėjas:
  • ISBN-10: 0486422577
  • ISBN-13: 9780486422572
  • Formatas: 13.7 x 21.5 x 1.5 cm, minkšti viršeliai
  • Kalba: Anglų

Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result concerning k-saturated chain partitions of general partially ordered sets. Connections with Dilworth's theorem, the marriage problem, and probability are also discussed. Each chapter ends with a helpful series of exercises and outline solutions appear at the end. An excellent text for a topics course in discrete mathematics. -- Bulletin of the American Mathematical Society.

Atsiliepimai

  • Atsiliepimų nėra
0 pirkėjai įvertino šią prekę.
5
0%
4
0%
3
0%
2
0%
1
0%
(rodomas nebus)
× Akcija + knyga už 1ct