The Transition Matrix Between the Specht and ??3 Web Bases is Unitriangular With Respect to Shadow Containment

The Transition Matrix Between the Specht and ??3 Web Bases is Unitriangular With Respect to Shadow Containment
复制标题

就影子遏制而言,Spect 和 ??3 Web 基地之间的过渡矩阵是单位三角形的

DOI:
10.1093/imrn/rnaa290
复制
发表时间:
2020
影响因子:
1
通讯作者:
Tymoczko, Julianna
Tymoczko, Julianna
中科院分区:
数学1区
文献类型:
--
作者:
Russell, Heather M;Tymoczko, Julianna

文献摘要

参考文献

被引文献

相似文献

网是具有边界的平面图,它描述了的图示范畴中的态射。它们被纽结理论家广泛研究,因为编织图提供了一种用网来表示链接图的分类方法,产生了像著名的琼斯多项式这样的量子不变量。表示论中的一个重要问题是确定不同基之间的关系;基变矩阵中的系数通常描述组合、代数或几何量(例如,Kazhdan-Lusztig多项式)。通过“展平”编织图,网也可以被视为对称群表示的基本元素。在这篇文章中,我们定义了两种新的网络组合结构:带状图及其一维投影,阴影,它衡量了网络内部区域的深度。作为应用,我们解决了一个公开的猜想,即这种对称群表示的所谓特殊基和网基之间的基的变化对于-网(和.)是单位三角的。我们使用带状图和阴影来构造Web上的新的偏序,这是对通常的偏序的改进。事实上,我们证明了对于Web,我们的新偏序与作者和其他人[,]所研究的Web上的Tableau偏序一致。我们还证明了,虽然新的WEB偏序是对以前研究的Tableau序的改进,但这两个偏序并不一致。
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., Kazhdan–Lusztig polynomials). By ”flattening” the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs:band diagramsand their one-dimensional projections,shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-calledSpecht basisand web basis of this symmetric group representation is unitriangular for-webs ( and .) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ , , , ]. We also prove that though the new partial order for-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for.
施普林格对霍瓦诺夫施普林格品种的介绍
DOI: 10.1017/s0305004111000132
发表时间: 2008
影响因子: 0.8
作者:
Heather M. Russell;Julianna Tymoczko
通讯作者: Julianna Tymoczko
(n, n) Springer 品种的无交叉匹配和上同调
DOI: 10.1142/s0219199704001471
发表时间: 2002
影响因子: 1.6
作者:
M. Khovanov
通讯作者: M. Khovanov
半标准画面和非椭圆 sl3 网之间的显式双射
DOI: 10.1007/s10801-013-0428-y
发表时间: 2012
影响因子: 0.8
作者:
Heather M. Russell
通讯作者: Heather M. Russell
Specht 和 Web 基础之间的转换矩阵是单能的,具有额外的消失条目
DOI: 10.1093/imrn/rnx164
发表时间: 2017
期刊: arXiv: Representation Theory
影响因子: --
作者:
Heather M. Russell;Julianna Tymoczko
通讯作者: Julianna Tymoczko
建筑物、蜘蛛和几何佐竹
DOI: 10.1112/s0010437x13007136
发表时间: 2011
影响因子: 1.8
作者:
Bruce Fontaine;J. Kamnitzer;G. Kuperberg
通讯作者: G. Kuperberg