نتایج جستجو برای: m fuzzifying matroids
تعداد نتایج: 540937 فیلتر نتایج به سال:
based on a complete heyting algebra l, the relations between lfuzzifyingconvergence spaces and l-fuzzifying topological spaces are studied.it is shown that, as a reflective subcategory, the category of l-fuzzifying topologicalspaces could be embedded in the category of l-fuzzifying convergencespaces and the latter is cartesian closed. also the specialization l-preorderof l-fuzzifying convergenc...
Let M be a matroid without loops or coloops and let TM be its Tutte polynomial. In 1999 Merino and Welsh conjectured that max(TM (2, 0), TM (0, 2)) ≥ TM (1, 1) for graphic matroids. Ten years later, Conde and Merino proposed a multiplicative version of the conjecture which implies the original one. In this paper we show the validity of the multiplicative conjecture when M is a lattice path matr...
We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R = Z, and when R is a DVR, we get (structures which contain all the data of) quasi-arithmetic matroids, and valuated matroids, respectively. More generally, whenever R is a Dedekind domain, we extend the...
Among the many ways to view oriented matroids as geometrical objects, we consider two that have special properties: • Bland’s analysis of complementary subspaces in IRn [2] has the special feature that it simultaneously and symmetrically represents a realizable oriented matroid and its dual; • Lawrence’s topological representation of oriented matroids by arrangements of pseudospheres [4] has th...
We give a characterization of the internally 4-connected binary matroids that have no minor isomorphic to M(K3,3). Any such matroid is either cographic, or is isomorphic to a particular single-element extension of the bond matroid of a cubic or quartic Möbius ladder, or is isomorphic to one of eighteen sporadic matroids. 2000 Mathematics Subject Classification. 05B35.
Given a root system R, the vector system R̃ is obtained by taking a representative v in each antipodal pair {v,−v}. The matroid M(R) is formed by all independent subsets of R̃. The automorphism group of a matroid is the group of permutations preserving its independent subsets. We prove that the automorphism groups of all irreducible root systems matroids M(R) are uniquely determined by their inde...
This article studies the girth and cogirth problems for connected matroids. The problem of finding the cogirth of a graphic matroid has been intensively studied, but studies on the equivalent problem for a linear matroid or a general matroid have been rarely reported. Based on the duality and connectivity of a matroid, we prove properties associated with the girth and cogirth of a matroid whose...
Let k be an integer exceeding one. The class of k–regular matroids is a generalization of the classes of regular and near-regular matroids. A simple rank–r regular matroid has the maximum number of points if and only if it is isomorphic to M(Kr+1), the cycle matroid of the complete graph on r + 1 vertices. A simple rank–r near-regular matroid has the maximum number of points if and only if it i...
Let M = (E,F) be a matroid on a set E, and B one of its bases. A closed set θ ⊆ E is saturated with respect to B when |θ ∩B| = r(θ), where r(θ) is the rank of θ. The collection of subsets I of E such that |I ∩ θ| ≤ r(θ) for every closed saturated set θ turns out to be the family of independent sets of a new matroid on E, called base-matroid and denoted by MB . In this paper we prove that a grap...
Let M be a finite matroid with rank function r. We will write A ⊆ M when we mean that A is a subset of the ground set of M , and write M | A and M/A for the matroids obtained by restricting M to A, and contracting M on A respectively. Let M * denote the dual matroid to M. (See [1] for definitions). The main theorem is Theorem 1. The Tutte polynomial T M (x, y) satisfies (1) T M (x, y) = A⊆M T M...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید