2025/10/16 by Jillian Eddy, Eddy, Jillian, Ryan M. Pesak +5
Computer Science · #05C25 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #FOS: Mathematics #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2510.15086
openalex publication_date 2025/10/16 · openalex created_date 2025/10/21 · openalex updated_date 2026/07/28
Local and global amoebas are families of labeled graphs that satisfy interpolation properties on a fixed vertex set. A labeled graph G on n vertices is a local amoeba (resp. global amoeba) if there exists a sequence of feasible edge-replacements between any two labelled embeddings of G into Kn (resp. Kn+1). Here, a feasible edge-replacement removes an edge and reinserts it so that the resulting graph is isomorphic to G; the induced relabeling yields a class of permutations of the label set. Motivated by classical group theoretic ideas, we introduce the hang group, a new invariant that can encode how local amoebas embed into larger ones. Using this framework, we identify necessary and sufficient conditions connecting stem-symmetric and hang-symmetric graphs with local and global amoebas. In particular, we show how hang-symmetry and stem-symmetry conditions propagate under the addition of leaves and isolated vertices, in turn yielding constructive criteria for both local and global amoebas. Finally, via wreath products, we provide four sets of sufficient conditions, one for each property, guaranteeing when the comb product is a local amoeba, a global amoeba, stem-symmetric, or hang-symmetric. These results strengthen and generalize existing constructions of local and global amoebas.