2019/10/07 by Michela Ceria, Ceria, Michela
Computer Science · Mathematics · #Combinatorics (math.CO) #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1910.03572
openalex publication_date 2019/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.