Bar Code and Janet-like division

Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like nonmultiplicative power of its elements and detect completeness of the set. Some observation on the computation of Janet-like bases conclude the work.