arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.05613math.COmath.AT
收藏

条形码偏序集的组合性质与连接

Barcode Posets: Combinatorial Properties and Connections

Edgar Jaramillo-Rodriguez

摘要:

条形码是实线$B = \{ (b_i, d_i)\}_{i=1}^n$上的有限多个区间。条形码是拓扑数据分析中的重要对象,在拓扑数据分析中,条形码用作过滤的持久同调群的总结。条形码的组合性质也被研究,主要是在区间顺序和区间图的背景下。在本文中,我们定义了一个新的家庭的映射,从空间的条码与$n$酒吧各种多集的置换集,称为多重置换。这些多重排列在条形码空间上提供了新的组合不变量。然后,我们在这些多重排列上定义了一个顺序关系,我们表明它可以被解释为条形码的交叉数,让人想起图的交叉数。接下来,我们证明了所得到的偏序集是序同构的主理想的一个众所周知的偏序集称为多项式纽曼格。因此,这些偏序集形成了多面体的渐变面格,我们称之为条形码格或条形码多面体。最后,我们表明,对于一个大类的条形码,这些不变量可以提供一对条形码之间的Wasserstein和瓶颈距离的界限,将这些离散的不变量连接到条形码上的连续度量。

英文摘要:

A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The combinatorial properties of barcodes have also been studied, mainly in the context of interval orders and interval graphs. In this paper, we define a new family of maps from the space of barcodes with $n$ bars to the permutation sets of various multisets, known as multipermutations. These multipermutations provide new combinatorial invariants on the space of barcodes. We then define an order relation on these multipermutations, which we show can be interpreted as a crossing number for barcodes, reminiscent of Túran's crossing number for graphs. Next, we show that the resulting posets are order-isomorphic to principal ideals of a well known poset known as the multinomial Newman lattice. Consequently, these posets form the graded face-lattices of polytopes, which we refer to as barcode lattices or barcode polytopes. Finally, we show that for a large class of barcodes, these invariants can provide bounds on the Wasserstein and bottleneck distances between a pair of barcodes, linking these discrete invariants to continuous metrics on barcodes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑