A polygon is an elementary (self-avoiding) cycle in the hypercubic lattice Z d taking at least one step in every dimension. A polygon on Z d is said to be convex if its length is exactly twice the sum of the side lengths of the smallest hypercube containing it. The number of d-dimensional convex pol
โฆ LIBER โฆ
The asymptotic enumeration of rooted convex polyhedra
โ Scribed by Edward A Bender; L.Bruce Richmond
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 293 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Asymptotic Enumeration of Convex Polygon
โ
Dudley Stark; Nicholas C. Wormald
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 413 KB
On the enumeration of polyhedra
โ
P. Engel
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 358 KB
The asymptotic number of rooted maps on
โ
Edward A Bender; E.Rodney Canfield; L.Bruce Richmond
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 436 KB
The enumeration of catafusenes rooted at
โ
Fuji Zhang; Xiaofeng Guo; S.J. Cyvin; B.N. Cyvin
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 339 KB
A type of catafusenes rooted at a polygon core is dealt with, called CRP systems, in which the maximum degree of any CRP system is equal to three, and on the boundary of the polygon core there are not more than two successive vertices with degree two. The enumeration problem of the type of CRP syste
On the convex hull of the union of certa
โ
Egon Balas
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 459 KB
The asymptotic number of rooted maps on
โ
Edward A Bender; E.Rodney Canfield
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 567 KB