中文
相关论文

相关论文: A correspondence and distance of t-structures

200 篇论文

The Gromov-Hausdorff distance ($d_\mathrm{GH}$) provides a natural way of quantifying the dissimilarity between two given metric spaces. It is known that computing $d_\mathrm{GH}$ between two finite metric spaces is NP-hard, even in the…

度量几何 · 数学 2021-10-08 Facundo Mémoli , Zane Smith , Zhengchao Wan

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

离散数学 · 计算机科学 2011-06-24 Giovanni Rossi

This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…

数值分析 · 数学 2014-02-18 Yaron Lipman , Jesus Puente , Ingrid Daubechies

The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in Pattern Recognition. In this paper we introduce a…

代数拓扑 · 数学 2010-12-21 Patrizio Frosini

Given a distance $D$ on a finite set $X$ with $n$ elements, it is interesting to understand how the ranking $R_x = z_1,z_2,\dots,z_n$ obtained by ordering the elements in $X$ according to increasing distance $D(x,z_i)$ from $x$, varies with…

离散数学 · 计算机科学 2019-10-23 Vincent Moulton , Andreas Spillner

Let $\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2$ be a separated point set, i.e., any two points have a distance at least $1$. Let $k \ge 1$ be an integer, and $1 \le t_1 < \ldots < t_k$ be real numbers. Let $\delta > 0$. Suppose for all $1…

组合数学 · 数学 2025-10-08 P. Erdős , E. Makai, , J. Pach

We introduce the persistent homotopy type distance dHT to compare real valued functions defined on possibly different homotopy equivalent topological spaces. The underlying idea in the definition of dHT is to measure the minimal shift that…

计算几何 · 计算机科学 2018-03-06 Patrizio Frosini , Claudia Landi , Facundo Memoli

Recently, Amnon Neeman settled a bold conjecture by Antieau, Gepner, and Heller regarding the relationship between the regularity of finite-dimensional noetherian schemes and the existence of bounded $t$-structures on their derived…

Let $G$ be a graph and $T$ a certain connected subgraph of $G$. The $T$-structure connectivity $\kappa(G; T)$ (or resp., $T$-substructure connectivity $\kappa^{s}(G; T)$) of $G$ is the minimum number of a set of subgraphs…

组合数学 · 数学 2018-03-23 Dong Li , Xiaolan Hu , Huiqing Liu

Point configurations have been widely used as model systems in condensed matter physics, materials science and biology. Statistical descriptors such as the $n$-body distribution function $g_n$ is usually employed to characterize the point…

数学物理 · 物理学 2015-05-13 Y. Jiao , F. H. Stillinger , S. Torquato

The idea of a co-t-structure is almost "dual" to that of a t-structure, but with some important differences. This note establishes co-t-structure analogues of Beligiannis and Reiten's corresponding results on compactly generated…

范畴论 · 数学 2011-09-20 David Pauksztello

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

度量几何 · 数学 2008-02-03 János Pach , Joel Spencer

Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…

计算几何 · 计算机科学 2011-03-15 Sarang Joshi , Raj Varma Kommaraju , Jeff M. Phillips , Suresh Venkatasubramanian

The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put…

计算几何 · 计算机科学 2021-05-06 Brendan Mumey

We give a construction for the d-dimensional simplices with all distances in {1,2} from the set of partitions of d+1.

组合数学 · 数学 2007-05-23 Christian Haase , Sascha Kurz

TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et. al. noticed that every triangulation is the TD-Delaunay…

离散数学 · 计算机科学 2018-03-28 Daniel Gonçalves , Lucas Isenmann

Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…

概率论 · 数学 2014-06-26 Masanori Hino

Using techniques due to Dwyer-Greenlees-Iyengar we construct weight structures in triangulated categories generated by compact objects. We apply our result to show that, for a dg category whose homology vanishes in negative degrees and is…

表示论 · 数学 2011-09-15 Bernhard Keller , Pedro Nicolas

We give a classification theorem for a relevant class of $t$-structures in triangulated categories, which includes in the case of the derived category of a Grothendieck category, the $t$-structures whose hearts have at most $n$ fixed…

表示论 · 数学 2014-12-31 Luisa Fiorot , Francesco Mattiello , Alberto Tonolo

It is unlikely that the discrete Fr\'echet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to…

计算几何 · 计算机科学 2024-04-08 Boris Aronov , Tsuri Farhana , Matthew J. Katz , Indu Ramesh