scientific article; zbMATH DE number 6909264

zbMATH Open1391.06001MaRDI QIDQ3176569FDOQ3176569

Authors: Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev 

Publication date: 23 July 2018

Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0118

scientific article; zbMATH DE number Title of this publication is (Why is no real title available?)

Recommendations

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
• Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
• Enumerating \((2 + 2)\)-free posets by indistinguishable elements
• On a conjecture about enumerating \((2+2)\)-free posets
• scientific article; zbMATH DE number 6806834
• Asymptotic enumeration of permutations avoiding generalized patterns
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• An exact enumeration of the unlabeled disconnected posets
• Pattern avoidance in poset permutations

zbMATH Keywords

enumerationkernel methodpattern-avoidanceinterval orderascent sequence\((2 + 2)\)-free poset

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)

Cited In (8)

• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• Pattern avoidance in ascent sequences
• Counting words with Laguerre series
• Title not available (Why is no real title available?)
• Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• \(n!\) matchings, \(n!\) posets (extended abstract)

This page was built for publication:

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