Combinatorics of non-ambiguous trees (Q402584): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-like tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some properties of permutation tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequence of Integers Related to the Bessel Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of pairs of permutations and sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelogram polyominoes and corners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic languages and polyominoes enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The excedance set of a permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hopf algebra of the planar binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of alternative tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation tableaux and permutation patterns / rank
 
Normal rank

Latest revision as of 22:38, 8 July 2024

scientific article
Language Label Description Also known as
English
Combinatorics of non-ambiguous trees
scientific article

    Statements

    Combinatorics of non-ambiguous trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 August 2014
    0 references
    posets
    0 references
    parallelogram polyominoes
    0 references
    tree-like tableaux
    0 references
    Bessel function
    0 references
    permutations excedances
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references