Some refinements of Stanley's shuffle theorem

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A Pub Date : 2023-11-17 DOI:10.1016/j.jcta.2023.105830

Kathy Q. Ji, Dax T.X. Zhang

引用次数: 0

Abstract

We give a combinatorial proof of Stanley's shuffle theorem by using the insertion lemma of Haglund, Loehr and Remmel. Based on this combinatorial construction, we establish several refinements of Stanley's shuffle theorem.

查看原文本刊更多论文

斯坦利洗牌定理的一些改进

利用Haglund, Loehr和Remmel的插入引理，给出Stanley洗牌定理的组合证明。基于这个组合构造，我们建立了斯坦利洗牌定理的几个改进。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Theory Series A 数学-数学

CiteScore

2.90

自引率

9.10%

发文量

审稿时长

12 months

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.