Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter November 19, 2009

The number of antichains in ranked posets

  • A. A. SAPOZHENKO
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1991.1.1.35
Published Online: 2009-11-19
Published in Print: 1991

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 1 Issue 1

Journal and Issue

Articles in the same Issue

On α-closed classes and α-complete Systems of k-valued logic functions
Superstructure of the closed class of polynomials modulo k
The mimber of functions in some closed classes of partial k-valued logic
The number of antichains in ranked posets
Distribution of primitive and irreducible polynomials modulo a prime number
Sphere-packing in Euclidean space and extremal problems for trigonometrical polynomials
Central limit theorem for the sums of random variables any r of which are independent
Decomposable statistics in an inverse allocation problem
On the branch size of random m-trees
Substitutions with cycle lengths from a fixed set
Downloaded on 25.4.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1991.1.1.35/html
Scroll to top button