A characterization of chains which are separable and compact in their order topology is given in (A.J. Ostaszewski, J. London Math. Soc. 7 (1974), 758-760) as those which can be order-embedded into two horizontal segments of the lexicographic square so that the image meets the lower segment in a clo
✦ LIBER ✦
Convex polyhedral chains: a representation for geometric data
✍ Scribed by O. Günther; E. Wong
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 702 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A Representation for Topologically Separ
✍
I. Fleischer
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 118 KB
Conjugate duality for convex programs: A
✍
Arthur F. Veinott Jr.
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 226 KB
A geometric interpretation of convexity
✍
R.E. Barnhill; T. Whelan
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 166 KB
An algorithm for determining the minimal
✍
J.B. Hughes
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 467 KB
A duality-based method for generating ge
✍
J. J. Rimoli; M. Ortiz
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 566 KB
Log-linear plots for data representation
✍
James C. Holste; Kenneth R. Hall; Gustavo A. Iglesias-Silva
📂
Article
📅
1996
🏛
American Institute of Chemical Engineers
🌐
English
⚖ 128 KB
When developing models to represent experimental data, residual plots are effective for assessing quality of fit, and these present the differences between data and reference data or a model. However, when some ordinate values are excessive, it is impossible to maintain definition for small values.