中文
相关论文

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

200 篇论文

We study $t$-structures (on triangulated categories) that are closely related to weight structures. A $t$-structure couple $t=(C_{t\le 0},C_{t\ge 0})$ is said to be adjacent to a weight structure $w=(C_{w\le 0}, C_{w\ge 0})$ if $C_{t\ge…

K理论与同调 · 数学 2025-12-16 Mikhail V. Bondarko

A $t$-structure $t=(C_{t\le 0},C_{t\ge 0})$ on a triangulated category $C$ is right adjacent to a weight structure $w=(C_{w\le 0}, C_{w\ge 0})$ if $C_{t\ge 0}=C_{w\ge 0}$; then $t$ can be uniquely recovered from $w$ and vice versa. We prove…

K理论与同调 · 数学 2019-07-09 Mikhail V. Bondarko

For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, for graphs $G$ with diameter 2, we show that…

组合数学 · 数学 2024-03-13 S. H. Jafari , S. R. Musawi

Let $X$ be a set and $d_1,d_2$ be two distances on $X$. We say that $d_1$ and $d_2$ are locally similar and write $d_1\cong d_2$ if $d_1$ and $d_2$ are topologically equivalent and, for every $a$ in $X$, \[ \lim_{x\to a}…

Given an ST-triple $(\mathcal{C},\mathcal{D},M)$ one can associate a co-$t$-structure on $\mathcal{C}$ and a $t$-structure on $\mathcal{D}$. It is shown that the discreteness of $\mathcal{C}$ with respect to the co-$t$-structure is…

表示论 · 数学 2018-11-12 Lingling Yao , Dong Yang

We associate a t-structure to a family of objects in D(A), the derived category of a Grothendieck category A. Using general results on t-structures, we give a new proof of Rickard's theorem on equivalence of bounded derived categories of…

表示论 · 数学 2007-05-23 Leovigildo Alonso , Ana Jeremias , Ma. -Jose Souto

We give the description of the t-structure on the derived category of regular holonomic D-modules corresponding to the trivial t-structure on the derived category of constructible sheaves via Riemann-Hilbert correspondence. We give also the…

代数几何 · 数学 2015-12-22 Masaki Kashiwara

Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…

组合数学 · 数学 2023-09-28 Jack Anderson , Cristian Cobeli , Alexandru Zaharescu

An $m$-distance set is a collection of points such that the distances between any two points have $m$ possible values. We use two different methods to construct large $m$-distance sets on the triangular lattices. One is to use the first m…

组合数学 · 数学 2025-09-03 Li-Ren Bao , Wei-Hsuan Yu

Co-t-structures were introduced about ten years ago as a type of mirror image of t-structures. Like t-structures, they permit to divide an object in a triangulated category T into a "left part" and a "right part", but there are crucial…

表示论 · 数学 2016-04-01 Peter Jorgensen

We establish a bijective correspondence between isomorphism classes of basic silting objects of $\mathsf{per}(A)$ and algebraic $t$-structures of $\mathsf{D}_{\rm fd}(A)$ for locally finite non-positive dg algebra $A$ over a field $k$ (more…

表示论 · 数学 2024-12-30 Riku Fushimi

The aim of this work is to construct certain homotopy t-structures on various categories of motivic homotopy theory, extending works of Voevodsky, Morel, D\'eglise and Ayoub. We prove these $t$-structures possess many good properties, some…

代数几何 · 数学 2016-12-30 Frédéric Déglise , Mikhail Bondarko

If $S$ is a given regular $d$-simplex of edge length $a$ in the $d$-dimensional Euclidean space $\mathcal{E}$, then the distances $t_1$, $\cdots$, $t_{d+1}$ of an arbitrary point in $\mathcal{E}$ to the vertices of $S$ are related by the…

度量几何 · 数学 2016-09-22 Mowaffaq Hajja , Mostafa Hayajneh , Bach Nguyen , Shadi Shaqaqha

The notions of consistent pairs and consistent chains of t-structures are introduced. A theorem that two consistent chains of t-structures generate a distributive lattice is proven. The technique developed is then applied to the pairs of…

代数几何 · 数学 2015-06-16 Alexey Bondal

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

组合数学 · 数学 2016-12-16 Ariel Bruner , Micha Sharir

A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…

度量几何 · 数学 2025-10-07 P. Erdős , E. Makai, , J. Pach

A dilatation structure on a metric space, arXiv:math/0608536v4, is a notion in between a group and a differential structure, accounting for the approximate self-similarity of the metric space. The basic objects of a dilatation structure are…

群论 · 数学 2007-06-06 Marius Buliga

The hull perimeter at distance d in a planar map with two marked vertices at distance k from each other is the length of the closed curve separating these two vertices and lying at distance d from the first one (d<k). We study the…

组合数学 · 数学 2017-11-20 Emmanuel Guitter

A time series is a sequence of data items; typical examples are videos, stock ticker data, or streams of temperature measurements. Quite some research has been devoted to comparing and indexing simple time series, i.e., time series where…

计算复杂性 · 计算机科学 2018-06-04 Jörg P. Bachmann , Johann-Christoph Freytag , Benjamin Hauskeller , Nicole Schweikardt

Let $D = (V, E)$ be a strongly connected and balanced digraph with vertex set $V$ and arc set $E.$ The classical distance $d_{ij}^D$ from $i$ to $j$ in $D$ is the length of a shortest directed path from $i$ to $j$ in $D.$ Let $L$ be the…

组合数学 · 数学 2022-11-01 R. Balakrishnan , S. Krishnamoorthy , W. So
‹ 上一页 1 2 3 10 下一页 ›