A multipartition is a finite stack of partitions.  Some multipartitions correspond to paths in a vector space according to a recursive comparison, and others do not.  One of the open problems in algebraic combinatorics is to find a good criterion of these so-called e-regular multipartitions. After explaining the context of the general problem, we will describe a class of multipartition for which the multipartition can be directly translated into a path, without using a recursive construction.