PROPERTIES OF LOCAL RANK MAP VECTORS FROM MULTIDETECTION CHROMATOGRAMS

Different windowing techniques estimate the local rank map of a two-di mensional multidetection chromatogram. A rank map vector, however, doe s not provide an unique determination of the location of components (r eferred to as the chromatographic configuration). This paper emphasize s on two problems: (1) Bow many local rank map vectors are allowed and how can they be generated from the knowledge of the number of differe nt components? (2) For a given local rank map vector, how many differe nt chromatographic configurations are possible and how can they be gen erated? The presented theorems can be useful in the process of determi ning correct local rank map vectors and chromatographic configurations .