z-logo
Premium
Poset Measure and Saturated Partitions
Author(s) -
Griggs Jerrold R.
Publication year - 1982
Publication title -
studies in applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 46
eISSN - 1467-9590
pISSN - 0022-2526
DOI - 10.1002/sapm198266191
Subject(s) - partially ordered set , measure (data warehouse) , mathematics , chain (unit) , point (geometry) , combinatorics , discrete mathematics , computer science , physics , geometry , data mining , astronomy
The theory of saturated partitions is applied to solve the problem of maximizing the measure of a finite poset when each point has measure in [0, 1] and each chain has measure at most λ>0.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here