arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.5356math.CO
收藏

蜂窝上的流动与Littlewood-Richardson表和

Flows on Honeycombs and Sums of Littlewood-Richardson Tableaux

Glenn D. Appleby, Tamsen Whitehead

摘要:

假设μ和μ'是两个划分。我们将让μ \oplus μ'表示分区的“直和“,定义为由$μ$和$μ'$的部分组成的排序分区。本文定义了(μ,ν;λ)型和(UNF ',ν'; λ ')型Littlewood-Richardson填充的求和运算,从而得到(μ \oplus UNF',ν \oplus ν'; λ \oplus ν')型Littlewood-Richardson填充.我们给出了一个算法来产生的总和,并表明,它终止于一个Littlewood-Richardson填充定义之间的双射Littlewood-Richardson填充和流动的蜂窝,然后显示,覆盖的两个蜂窝的适当类型对应的两个填充的总和。

英文摘要:

Suppose μand μ' are two partitions. We will let μ\oplus μ' denote the "direct sum" of the partitions, defined as the sorted partition made of the parts of $μ$ and $μ'$. In this paper, we define a summation operation on two Littlewood-Richardson fillings of type (μ, ν;λ) and (μ', ν';λ'), which results in a Littlewood-Richardson filling of type (μ\oplus μ', ν\oplus ν' ;λ\oplus λ'). We give an algorithm to produce the sum, and show that it terminates in a Littlewood-Richardson filling by defining a bijection between a Littlewood-Richardson filling and a flow on a honeycomb, and then showing that the overlay of the two honeycombs of appropriate type corresponds to the sum of the two fillings.

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

↑