Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the heapability of finite partial orders   We investigate the partitioning of partial orders into a minimal number of
heapable subsets. We prove a characterization result reminiscent of the proof
of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for
computing such a minimal decomposition. On the other hand, in the particular
case of sets and sequences of intervals we prove that this minimal
decomposition can be computed by a simple greedy-type algorithm. The paper ends
with a couple of open problems related to the analog of the Ulam-Hammersley
problem for decompositions of sets and sequences of random intervals into
heapable sets.

11
The categories of this paper are: hep-lat
9
The categories of this paper are: nlin
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
29
The categories of this paper are: funct-an