A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations (Q2494390): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Luca Ferrari / rank
Normal rank
 
Property / author
 
Property / author: Luca Ferrari / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11083-005-9021-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089049012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized permutation patterns and a classification of the Mahonian statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating functions for generating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An area-to-inv bijection between Dyck paths and 312-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECO:a methodology for the enumeration of combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating permutations avoiding three Babson-Steingrímsson patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellable nonpure complexes and posets. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matrix of chromatic joins and the Temperley-Lieb algebra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized pattern avoidance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial statistics on Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyck path enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak order on pattern-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijections for refined restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear operator approach to succession rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices of lattice paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vexillary involutions are enumerated by Motzkin numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations with restricted patterns and Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bruhat lattices, plane partition generating functions, and minuscule representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diagram of 132-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncrossing partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and the Catalan and Schröder numbers / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:30, 24 June 2024

scientific article
Language Label Description Also known as
English
A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
scientific article

    Statements

    A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Bell numbers
    0 references
    Catalan numbers
    0 references
    Dyck paths
    0 references
    distributive lattice
    0 references
    noncrossing partitions
    0 references
    312-avoiding permutations
    0 references
    strong Bruhat order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references