𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal dissections of a simplex

✍ Scribed by Thomas Zaslavsky

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
621 KB
Volume
20
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dissections of a tetrahedron
Dissections of a tetrahedron
✍ G.L Alexanderson; John E Wetzel πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 458 KB
The simplex algorithm with the pivot rul
The simplex algorithm with the pivot rule of maximizing criterion improvement
✍ R.G. Jeroslow πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 998 KB

We extend ;l result of Klee anC Minty by showing that the Simplex Alp,orithm with the pivot rule of maximizing criterion ixrip;ovement is not a good algorithm in the sense of Edmonas. The method of proof extends to other similar pivot rules. \* Original version rlzceived 7 July 3.97 1. \* As Klee a

A combinatorial analysis of topological
A combinatorial analysis of topological dissections
✍ Thomas Zaslavsky πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 994 KB

## A Combinatorial Analysis of Topological Dissections THOMAS ZASLAVSKY Massachusetts Institute Contents. Introduction. 1. The fundamental relations for dissections and covers. 2. Algebraic combinatorics: Valuations and MGbius algebras. 3. Dissections into cells and properly cellular faces. 4. Gen