𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Mutation Problem for Oriented Matroids

✍ Scribed by Jürgen Bokowski; Holger Rohlfs

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
469 KB
Volume
22
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

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 Vergnas [9] conjectured that 1 ≤ L(n). We study in this article the rank 4 case. Richter-Gebert [11] showed that L(4k) ≤ 3k + 1 for k ≥ 2. We confirm Las Vergnas' conjecture for n < 13. We show that L(7k + c) ≤ 5k + c for all integers k ≥ 0 and c ≥ 4, and we provide a 17 element example with a mutation free element.

📜 SIMILAR VOLUMES

Lawrence Oriented Matroids and a Problem
Lawrence Oriented Matroids and a Problem of McMullen on Projective Equivalences of Polytopes
✍ J.L. Ramı&amp;#x0301;rez Alfonsı&amp;#x0301;n 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Consider the following question introduced by McMullen: Determine the largest integer n = f (d) such that any set of n points in general position in the affine d-space R d can be mapped by a projective transformation onto the vertices of a convex polytope. It is known that 2d + 1 ≤ f (d) < (d + 1)(d

A note on some embedding problems for or
A note on some embedding problems for oriented graphs
✍ Andrew Treglown 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

We conjecture that every oriented graph G on n vertices with + (G), -(G) ≥ 5n / 12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfe