Inversion sequences and signed permutations

DOI10.47443/DML.2024.060MaRDI QIDQ7030422zbMATH OpenFDO

Authors Toufik Mansour, Amir Safadi

Publication date 7 February 2025

Published in DML. Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/DML.2024.060

zbMATH Keywords

generating treesinversion sequencessigned inversion sequencesWilf-equivalences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites work

• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Generating trees and forbidden subsequences
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Pattern avoidance in coloured permutations
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.

Cited in

(2)

• Pattern avoidance and Schur-positivity in restricted-growth words of type B
• Signed inversion sequences avoiding a set of length-2 signed patterns

This page was built for publication: Inversion sequences and signed permutations

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