1995
DOI: 10.1016/s0195-6698(95)90053-5
|View full text |Cite
|
Sign up to set email alerts
|

Sur une extension des nombres de Genocchi

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
11
0

Year Published

1996
1996
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 7 publications
0
11
0
Order By: Relevance
“…The strip decomposition of the Motzkin path P = uuhduudddudduuhdd drawn in Figure 5 is S(P ) = {(5, 1), (6,3), (7,6), (9,8), (10,10), (14,12), (15,14)}. It is known that every Motzkin path P can be determined from the set S(P ) satisfying ( 11) by reversing the above procedure ( see [6,Fig.…”
Section: Crossings Over S N (321 3142)mentioning
confidence: 99%
See 2 more Smart Citations
“…The strip decomposition of the Motzkin path P = uuhduudddudduuhdd drawn in Figure 5 is S(P ) = {(5, 1), (6,3), (7,6), (9,8), (10,10), (14,12), (15,14)}. It is known that every Motzkin path P can be determined from the set S(P ) satisfying ( 11) by reversing the above procedure ( see [6,Fig.…”
Section: Crossings Over S N (321 3142)mentioning
confidence: 99%
“…Using recursion ( 13), Dumont showed the following theorem. To prove it, we can we can inquire into the paper of Dumont and Randrianarivony [10].…”
Section: Crossings Over S N (321 3142)mentioning
confidence: 99%
See 1 more Smart Citation
“…• if σ = 6 1 7 2 3 8 4 10 5 11 9 15 12 16 13 14, we have R(σ) = {(5, 1), (6, 3), (7,6), (9,8), (10,10), (14,12), (15,14)}.…”
Section: Crossings Over S N (321 3 142)mentioning
confidence: 99%
“…The strip decomposition of the Motzkin path P = uuhduudddudduuhdd drawn in Figure 5 is S(P) = {(5, 1), (6, 3), (7,6), (9,8), (10,10), (14,12), (15,14)}. It is known that every Motzkin path P can be determined from the set S(P) satisfying (4.1) by inversing the above procedure ( see [6,Fig.…”
Section: Crossings Over S N (321 3 142)mentioning
confidence: 99%