Pattern avoidance in parking functions

DOI10.54550/ECA2023V3S3R17MaRDI QIDQ6659956

Ayomikun Adeniran, Lara Pudwell

Publication date: 9 January 2025

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

zbMATH Keywords

permutationpatternparking function

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Patterns in permutations and words.
• Chords, trees and permutations
• Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
• A remarkable \(q,t\)-Catalan sequence and \(q\)-Lagrange inversion
• Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions
• Patterns in words of ordered set partitions
• Protected points in ordered trees
• Kernel method and linear recurrence system
• Combinatorics of Permutations
• The Supremum and Infimum of the Poisson Process
• An Occupancy Discipline and Applications
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Restricted permutations

Related Items (1)

Counting parking sequences and parking assortments through permutations

This page was built for publication: Pattern avoidance in parking functions

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