19 search results - page 2 / 4 » Lifts of matroid representations over partial fields |
JCT
2006
13 years 5 months ago
2006
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...
DM
2006
13 years 5 months ago
2006
For an integer n 3, a rank-n matroid is called an n-spike if it consists of n three-point lines through a common point such that, for all k {1, 2, . . . , n - 1}, the union of e...
JCT
2010
13 years 4 months ago
2010
Abstract. For each finite field F of prime order there is a constant c such that every 4-connected matroid has at most c inequivalent representations over F. We had hoped that th...
EJC
2008
13 years 4 months ago
2008
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...