Inversion polynomials for permutations avoiding consecutive patterns

DOI10.1016/J.AAM.2015.03.002MaRDI QIDQ2346477zbMATH OpenOpenAlexFDO

Authors Kendra Killpatrick, Naiomi T. Cameron

Publication date 2 June 2015

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.5211

zbMATH Keywords

consecutive patternsFibonacci tableauxgeneralized pattern avoidanceinversionspermutation statisticstableauxWilf equivalence

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Binomial coefficients; factorials; (q)-identities (11B65)

Abstract: In 2012, Sagan and Savage introduced the notion of $st$-Wilf equivalence for a statistic $st$ and for sets of permutations that avoid particular permutation patterns which can be extended to generalized permutation patterns. In this paper we consider $inv$-Wilf equivalence on sets of two or more consecutive permutation patterns. We say that two sets of generalized permutation patterns $Pi$ and $P{i}^{\prime }$ are $inv$-Wilf equivalent if the generating function for the inversion statistic on the permutations that simultaneously avoid all elements of $Pi$ is equal to the generating function for the inversion statistic on the permutations that simultaneously avoid all elements of $P{i}^{\prime }$. In 2013, Cameron and Killpatrick gave the inversion generating function for Fibonacci tableaux which are in one-to-one correspondence with the set of permutations that simultaneously avoid the consecutive patterns $321$ and $312.$ In this paper, we use the language of Fibonacci tableaux to study the inversion generating functions for permutations that avoid $Pi$ where $Pi$ is a set of five or fewer consecutive permutation patterns. In addition, we introduce the more general notion of a strip tableaux which are a useful combinatorial object for studying consecutive pattern avoidance. We go on to give the inversion generating functions for all but one of the cases where $Pi$ is a subset of three consecutive permutation patterns and we give several results for $Pi$ a subset of two consecutive permutation patterns.

Recommendations

• Permutation statistics and multiple pattern avoidance
• Inversion sequences avoiding consecutive patterns
• Consecutive patterns in inversion sequences
• Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
• Patterns in inversion sequences. I.

Cites work

• Avoiding consecutive patterns in permutations
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• Consecutive patterns in permutations
• Generalized pattern avoidance
• Generalized permutation patterns and a classification of the Mahonian statistics
• scientific article; zbMATH DE number 3513846 (Why is no real title available?)
• scientific article; zbMATH DE number 2192219 (Why is no real title available?)
• Inversion polynomials for 321-avoiding permutations
• Mahonian pairs
• Multi-avoidance of generalised patterns
• Permutation patterns and statistics
• Symmetry and log-concavity results for statistics on Fibonacci tableaux
• Two element lattice permutation numbers and their \(q\)-generalization

Cited in

(4)

• The maximal-inversion statistic and pattern-avoiding permutations
• Fibonacci numbers, consecutive patterns, and inverse peaks
• The operators F_i on permutations, 132-avoiding permutations and inversions
• Inversion formulae on permutations avoiding 321

This page was built for publication: Inversion polynomials for permutations avoiding consecutive patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346477)