first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
MATCHINGS IN THREE CATALAN LATTICES
Authors:
J. L. Baril a;
J. M. Pallo a
| Affiliation: | a Universit de Bourgogne, L.E.2.I, B.P 47870, 21078 DIJON-Cedex, France. |
DOI:
10.1080/00207160304677
Publication Frequency:
12 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
80,
Issue
2
February
2003
, pages 193
- 200
International Journal of Computer Mathematics,
Volume
80,
Issue
2
February
2003
, pages 193
- 200
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 22
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
In this note we consider a series of lattices that are enumerated by the well-known Catalan numbers. For each of these lattices, we exhibit a matching in a constructive way.
|
| Keywords: Lattices; Matchings; Well-formed Parentheses Strings; Binary Trees |
| view references (22) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
