Lattice path enumeration by formal schema (Q1197397): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Thomas S. Sundquist / rank | |||
Property / reviewed by | |||
Property / reviewed by: Johann Cigler / rank | |||
Property / author | |||
Property / author: Thomas S. Sundquist / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Johann Cigler / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chain enumeration and non-crossing partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial aspects of continued fractions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal languages and enumeration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941417 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3669422 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3877686 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3903764 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3726126 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0196-8858(92)90010-t / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2028731145 / rank | |||
Normal rank |
Latest revision as of 09:57, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lattice path enumeration by formal schema |
scientific article |
Statements
Lattice path enumeration by formal schema (English)
0 references
16 January 1993
0 references
This paper gives another formal description of Pólya's idea of picture writing. An unlabelled rooted plane tree is represented as a word of the free monoid generated by the alphabet \(t\), ), \((_ n,\;n=1,2,3,\dots\), by starting with \(D\) and using the substitution rules \(D\to(_ n D^ n)\) if \(n\) is the number of edges emanating from the vertex \(D\) and \(D\to t\) for a terminal point.
0 references
lattice path enumeration
0 references
formal schema
0 references
rooted plane tree
0 references
word
0 references