The 1-box pattern on pattern-avoiding permutations

MaRDI QIDQ5404376zbMATH OpenFDO

Authors Sergey Kitaev, Jeffrey Remmel

Publication date 24 March 2014

Full work available at URL https://arxiv.org/abs/1305.6970, http://www.emis.de/journals/JIS/VOL17/Kitaev/kitaev4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

distributionFibonacci numberseparable permutationPell number132-avoiding permutation1-box pattern

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: This paper is continuation of the study of the 1-box pattern in permutations introduced by the authors in cite{kitrem4}. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and then study some of its coefficients providing a link to the Fibonacci numbers. We also find the number of separable permutations with two and three occurrences of the 1-box pattern.

Recommendations

• Restricted 1-3-2 permutations and generalized patterns
• Continued fractions, statistics, and generalized patterns.
• scientific article; zbMATH DE number 1375582
• Classical pattern distributions in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)
• Avoidance of boxed mesh patterns on permutations

Cited in

(1)

• \((a, b)\)-rectangle patterns in permutations and words

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: The 1-box pattern on pattern-avoiding permutations

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