Five classes of pattern avoiding inversion sequences under one roof: generating trees

IF 1.1 4区数学 Q2 MATHEMATICS, APPLIED

Journal of Difference Equations and Applications Pub Date : 2023-07-03 DOI:10.1080/10236198.2023.2253327

T. Mansour

引用次数: 0

Abstract

An inversion sequence of length n is a word which satisfies for each the inequalities . In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, , , 0123, or 0321.

查看原文本刊更多论文

五类模式避免反转序列在一个屋檐下:生成树

长度为n的反转序列是一个满足每个不等式的词。在本文中，我们列举了避免长度为4的模式的四类反转序列。更准确地说，我们用一个带有2个标签的生成树来描述每个类，然后我们得到了长度为n的反转序列的生成函数的显式公式，这些反转序列避免了0132、、、0123或0321。

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

求助全文

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

来源期刊

Journal of Difference Equations and Applications 数学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

4-8 weeks

期刊介绍： Journal of Difference Equations and Applications presents state-of-the-art papers on difference equations and discrete dynamical systems and the academic, pure and applied problems in which they arise. The Journal is composed of original research, expository and review articles, and papers that present novel concepts in application and techniques. The scope of the Journal includes all areas in mathematics that contain significant theory or applications in difference equations or discrete dynamical systems.