Symmetric permutations avoiding two patterns

DOI10.1007/S00026-010-0050-9zbMath1233.05017OpenAlexW1980076972MaRDI QIDQ659572

Jonah Ostroff, David Lonoff

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-010-0050-9

zbMATH Keywords

signed permutationpattern-avoiding permutationrestricted permutationsymmetric permutationFibonacci identity

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05)

Related Items (2)

Enumerating \(r\)c-invariant permutations with no long decreasing subsequences ⋮ On the centrosymmetric permutations in a class

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
• Generating trees and forbidden subsequences
• Restricted symmetric permutations
• Counting occurrences of 231 in an involution
• Restricted permutations

This page was built for publication: Symmetric permutations avoiding two patterns