Entry Lalanne:1993:ICD from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Lalanne:1993:ICD,
author = "J. C. Lalanne",
title = "Sur une involution sur les chemins de {Dyck}.
({French}) [{On} an involution on {Dyck} paths]",
journal = j-THEOR-COMP-SCI,
volume = "117",
number = "1--2",
pages = "203--215",
day = "30",
month = aug,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:30 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=117&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=117&issue=1-2&aid=1422",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4260
(Computational geometry)",
conflocation = "Bordeaux, France; 2-5 May 1991",
conftitle = "Conference on Formal Power Series and Algebraic
Combinatorics",
corpsource = "CNRS, Bordeaux I Univ., Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bijective proof; binary trees; computational geometry;
counting parallelogram polyominoes; Dyck paths;
generating functions; graph theory; involution;
multichains; multiwalks; q-Bessel functions",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bijective,
117(1)z,
129(2)263
- binary,
71(1)3,
75(3)357,
77(1)131,
77(3)267,
79(2)323,
83(2)249,
85(1)75,
87(1)25,
88(1)83,
88(2)365,
93(2)201,
93(2)321,
102(2)253,
106(2)265,
106(2)361,
108(2)291,
112(2)383,
114(2)247,
115(2)243,
117(1)99,
118(1)49,
119(1)39,
120(1)1,
120(2)215,
123(2)291,
124(2)221,
125(2)259,
132(1)1,
132(1)37,
132(1)129,
133(2)387,
136(2)507
- C4260,
88(2)231,
92(2)319,
94(2)295,
98(2)263,
103(1)107,
106(2)265,
112(2)215,
112(2)339,
115(2)291,
115(2)351,
116(2)291,
116(2)359,
116(2)373,
117(1)153,
117(1)187,
119(2)331,
123(1)151,
123(1)z,
127(1)187,
129(2)263,
129(2)369,
130(1)125,
130(1)139,
130(1)163,
131(2)361,
134(2)415
- counting,
79(1)37,
81(1)49,
81(1)77,
85(1)171,
86(2)325,
100(1)243,
102(2)283,
103(1)3,
107(1)3,
108(1)3,
108(2)371,
112(2)255,
117(1)45,
133(1)105
- Dyck,
97(2)245
- French,
72(2)z,
94(2)199,
94(2)223,
94(2)261,
98(1)79,
99(2)327,
115(2)291,
117(1)3,
117(1)45,
117(1)67,
117(1)131,
117(1)153,
117(1)169,
117(1)187,
117(1)217,
117(1)243,
117(1)255,
119(1)z,
123(1)21,
123(1)55,
123(1)89,
123(1)145,
126(2)281
- generating,
71(3)381,
73(3)279,
79(1)37,
79(1)151,
79(1)163,
79(1)195,
79(1)257,
81(2)269,
92(2)249,
94(2)261,
98(1)65,
113(2)349,
113(2)371,
117(1)273,
119(2)345,
131(2)375,
132(1)347,
132(1)415,
134(1)3
- geometry,
74(1)95,
74(3)253,
81(2)289,
84(1)77,
84(1)127,
86(2)205,
88(2)231,
92(2)319,
94(2)295,
98(2)263,
103(1)107,
106(2)265,
112(2)215,
112(2)339,
113(2)371,
115(2)291,
115(2)351,
116(2)291,
116(2)359,
116(2)373,
117(1)153,
117(1)187,
119(2)331,
123(1)151,
123(1)z,
127(1)187,
129(2)263,
129(2)369,
130(1)125,
130(1)139,
130(1)163,
131(2)361,
134(1)131,
134(2)415
- involution,
117(1)91
- parallelogram,
127(1)187
- path,
72(2)251,
72(2)z,
74(2)199,
74(3)355,
79(1)151,
79(1)179,
83(2)189,
84(1)127,
84(2)179,
84(2)281,
88(1)33,
88(1)151,
89(1)33,
94(1)141,
95(2)245,
100(1)243,
102(2)329,
105(1)129,
106(2)391,
112(2)255,
115(2)351,
116(2)359,
117(1)137,
117(1)187,
125(2)345,
127(2)395,
131(1)1,
133(1)65
- polyominoes,
79(1)209,
127(1)187