2019/03/07 by Dinh Van Le, Tim Römer
Computer Science · Mathematics · #Action (physics) #Combinatorics #Commutative Algebra and Its Applications #Discrete mathematics #Kruskal's algorithm #Mathematical optimization #Mathematics #Minification #Monoid #Polynomial and algebraic computation #Shadow (psychology) #Simplicial complex #Spanning tree #Topological and Geometric Data Analysis #Type (biology) #math.AC #math.CO #msc:05D05 #msc:05E18 #msc:05E40 #msc:05E45
paper · pdf · doi:10.1016/j.disc.2019.111801
published as Discrete Math. 343 (2020), no. 5, 111801, 12 pp · 16 pages
arxiv created 2019/03/07 · openalex publication_date 2020/01/13 · arxiv updated 2020/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Inspired by the Kruskal-Katona theorem a minimization problem is studied, where the role of the shadow is replaced by the image of the action of the monoid of increasing functions. One of our main results shows that compressed sets are a solution to this problem. Several applications to simplicial complexes are discussed.