Matroids with coefficients, recently introduced by Dress [4], generalize ordinary matroids, Tutte representations of matroids coordinatizable over a given field and oriented matroids. Oriented matroids can be defined in terms of circuit signatures [2]. In this paper we show that there are exactly four classes of circuit signatures coordinatizable, in the sense of Dress, over a semiring R the unit group of which is {+, −}, such that R is generated by {+, −} . In particular, we show that weakly oriented matroids [1, 7] are matroids with coefficients in a suitable semiring
The matroid matching problem (also known as matroid parity problem) has been intensively studied by ...
A matroid M will be called sign-representable if, for every basis B of M, there is a (0,1, — 1)-matr...
This paper studies systems of polynomial equations that provide information about orientability of m...
Matroids with coefficients, recently introduced by Dress [4], generalize ordinary matroids, Tutte re...
AbstractMatroid coordinatizations over GF(3) are characterized by several properties, including a si...
AbstractWe study the modular triples of circuits of a matroid and use them to characterize four type...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite an...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
We extend the notion of representation of a matroid to algebraic structures that we call skew partia...
Matroids over tracts (Baker and Bowler, 2017) provide an algebraic framework simultaneously generali...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
Las Vergnas & Hamidoune studied the number of circuits needed to deter-mine an oriented matroid....
AbstractTwo elements of an oriented matroid constitute an invariant pair if all signed circuits cont...
AbstractThe number of acyclic reorientations of a weakly oriented matroid M is ≤t(M; 2,0). Equality ...
The matroid matching problem (also known as matroid parity problem) has been intensively studied by ...
A matroid M will be called sign-representable if, for every basis B of M, there is a (0,1, — 1)-matr...
This paper studies systems of polynomial equations that provide information about orientability of m...
Matroids with coefficients, recently introduced by Dress [4], generalize ordinary matroids, Tutte re...
AbstractMatroid coordinatizations over GF(3) are characterized by several properties, including a si...
AbstractWe study the modular triples of circuits of a matroid and use them to characterize four type...
International audienceLas Vergnas & Hamidoune studied the number of circuits needed to determine an ...
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite an...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
We extend the notion of representation of a matroid to algebraic structures that we call skew partia...
Matroids over tracts (Baker and Bowler, 2017) provide an algebraic framework simultaneously generali...
AbstractFor the class of matroids linearly representable over a field of characteristic 2, we prove ...
Las Vergnas & Hamidoune studied the number of circuits needed to deter-mine an oriented matroid....
AbstractTwo elements of an oriented matroid constitute an invariant pair if all signed circuits cont...
AbstractThe number of acyclic reorientations of a weakly oriented matroid M is ≤t(M; 2,0). Equality ...
The matroid matching problem (also known as matroid parity problem) has been intensively studied by ...
A matroid M will be called sign-representable if, for every basis B of M, there is a (0,1, — 1)-matr...
This paper studies systems of polynomial equations that provide information about orientability of m...