Gian-Carlo Rota said that “Anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day.” [20] Hassler Whitney introduced the theory of matroids in 1935 and developed a striking number of their basic properties as well as different ways to formulate the notion of a matroid. As more and more connections between matroi...

We considered the possibility that the oriented matroid theory is connected with supersymmetry via the Grassmann-Plucker relations. The main reason for this, is that such relations arise in both in the chirotopes definition of an oriented matroid, and in maximally supersymmetric solutions of elevenand ten-dimensional supergravity theories. Taking this observation as a motivation, and using the ...

Matroid theory has been applied to solve problems in generalized assignment, operations research, control theory, network theory, flow theory, generalized flow theory or linear programming, coding theory, and telecommunication network design. The operations of matroid union, matroid partitioning, matroid intersection, and the theorem on the greedy algorithm, Rado’s theorem, and Brualdi’s symmet...

The closed fuzzy matroid is a subsystem of the fuzzy matroid theory. Some important conclusions, ideas and methods of the closed fuzzy matroid are briefly introduced and commented in this paper. We try to let readers to know the latest development and results of the closed fuzzy matroids.

A classic exercise in the topology of surfaces is to show that, using handle slides, every disc-band surface, or 1-vertex ribbon graph, can be put in a canonical form consisting of the connected sum of orientable loops, and either non-orientable loops or pairs of interlaced orientable loops. Motivated by the principle that ribbon graph theory informs delta-matroid theory, we find the delta-matr...

2 Matroid Theory 3 This paper explores the connection between network coding and matroid theory, 4 a branch of mathematics that generalizes linear algebra and graph theory. ABSTRACT | Networks derived from matroids have played a 7 fundamental role in proving theoretical results about the limits 8 of network coding. In this tutorial paper, we review many con-9 nections between matroids and netwo...

Rough set theory has been successfully applied to vague and uncertain data due to its approximation ability. Matroid is a sophisticated mathematical structure to provide a unifying abstract treatment for graph theory, linear algebra, and combinatorial optimization. In this paper, we redefine rough approximation operators throughmatroidal approaches and build a matroidal structure of rough set t...

One of the foundations of oriented matroid theory is the topological representation theorem of Folkman and Lawrence [8]. It says that an oriented (simple) matroid can be realized uniquely as an arrangement of pseudospheres. That there is no similar interpretation for the class of all matroids has been taken for granted. For instance, “A non-coordinatizable matroid of abstract origin may be thou...

2 Matroid Theory 3 This paper explores the connection between network coding and Matroid theory, 4 a branch of mathematics that generalizes linear algebra and graph theory. ABSTRACT | Networks derived from matroids have played a 7 fundamental role in proving theoretical results about the limits 8 of network coding. In this tutorial paper, we review many con-9 nections between matroids and netwo...

1 Franti sek Mat u s Prague ABSTRACT. Special conditional independence structures have been recognized to be matroids. This opens new possibilities for the application of matroid theory methods (duality, minors, expansions) to the study of conditional independence and, on the other hand, starts a new probabilistic branch of matroid representation theory. 2