منابع مشابه
Internally Perfect Matroids
In 1977 Stanley proved that the h-vector of a matroid is an O-sequence and conjectured that it is a pure O-sequence. In the subsequent years the validity of this conjecture has been shown for a variety of classes of matroids, though the general case is still open. In this paper we use Las Vergnas’ internal order to introduce a new class of matroids which we call internally perfect. We prove tha...
متن کاملCATEGORICAL RELATIONS AMONG MATROIDS, FUZZY MATROIDS AND FUZZIFYING MATROIDS
The aim of this paper is to study the categorical relations betweenmatroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids.It is shown that the category of fuzzifying matroids is isomorphic to that ofclosed fuzzy matroids and the latter is concretely coreflective in the categoryof fuzzy matroids. The category of matroids can be embedded in that offuzzifying matroids as a simul...
متن کاملcategorical relations among matroids, fuzzy matroids and fuzzifying matroids
the aim of this paper is to study the categorical relations betweenmatroids, goetschel-voxman’s fuzzy matroids and shi’s fuzzifying matroids.it is shown that the category of fuzzifying matroids is isomorphic to that ofclosed fuzzy matroids and the latter is concretely coreflective in the categoryof fuzzy matroids. the category of matroids can be embedded in that offuzzifying matroids as a simul...
متن کاملCategorical Relations among Matroids, Fuzzy Matroids and Fuzzifying Matroids
The aim of this paper is to study the categorical relations between matroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids. It is shown that the category of fuzzifying matroids is isomorphic to that of closed fuzzy matroids and the latter is concretely coreflective in the category of fuzzy matroids. The category of matroids can be embedded in that of fuzzifying matroids as a ...
متن کاملLecture : Matroids [fa'''] Matroids .. Definitions
Many problems that can be correctly solved by greedy algorithms can be described in terms of an abstract combinatorial object called a matroid. Matroids were first described in 1935 by the mathematician Hassler Whitney as a combinatorial generalization of linear independence of vectors—‘matroid’ means ‘something sort of like a matrix’. A matroid M is a finite collection of finite sets that sati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1992
ISSN: 0001-8708
DOI: 10.1016/0001-8708(92)90015-d