For uniform oriented matroids M with n elements, there is in the realizable case a sharp lower bound L r (n) for the number mut(M) of mutations of M : L r (n) = n ≤ mut(M), see Shannon [17]. Finding a sharp lower bound L(n) ≤ mut(M) in the non-realizable case is an open problem for rank d ≥ 4. Las V
✦ LIBER ✦
A finite crisscross method for oriented matroids
✍ Scribed by Tamás Terlaky
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 515 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On a Mutation Problem for Oriented Matro
✍
Jürgen Bokowski; Holger Rohlfs
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 469 KB
Oriented matroids as a foundation for sp
✍
John Stell; Julian Webster
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 210 KB
We provide an expository account, from the viewpoint of geographic information science, of oriented matroids. The importance of these structures is that they provide an approach to space which is discrete and hence can be used for robust computation. A finite set of points in the plane can be given
Goal-oriented mesh adaptation for finite
✍
R. P. Dwight
📂
Article
📅
2008
🏛
John Wiley and Sons
🌐
English
⚖ 251 KB
Method for constructing a group-oriented
✍
Chu-Hsing Lin; Chin-Chen Chang
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 391 KB
A quadrature method for finite intervals
✍
William Squire
📂
Article
📅
1976
🏛
John Wiley and Sons
🌐
English
⚖ 228 KB
A Person-Oriented Approach: Methods for
✍
Lars R. Bergman; Bassam M. El-Khouri
📂
Article
📅
2003
🏛
John Wiley and Sons
🌐
English
⚖ 72 KB