Sciweavers

61 search results - page 2 / 13
» A chain theorem for matroids
Sort
View
JCT
2006
110views more  JCT 2006»
13 years 6 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
13 years 5 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
JCT
2010
98views more  JCT 2010»
13 years 28 days ago
Lifts of matroid representations over partial fields
There exist several theorems which state that when a matroid is representable over distinct fields 1,..., k, it is also representable over other fields. We prove a theorem, the Li...
Rudi Pendavingh, Stefan H. M. van Zwam
JCT
2010
79views more  JCT 2010»
13 years 28 days ago
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
Rudi Pendavingh, Stefan H. M. van Zwam
COMBINATORICS
2004
93views more  COMBINATORICS 2004»
13 years 6 months ago
On the Combinatorial Structure of Arrangements of Oriented Pseudocircles
We introduce intersection schemes (a generalization of uniform oriented matroids of rank 3) to describe the combinatorial properties of arrangements of pseudocircles in the plane ...
Johann Linhart, Ronald Ortner