拟阵Q6与W4可F-线性表示的构造

对拟阵Q6与W4可F-线性表示的构造进行了研究.用E(G)在R上的链群F0(G,R)表示G的圈拟阵M(G);用松弛拟阵M的极小圈超平面X的方法得到拟阵M'.得到主要结果为:(i)用链群表示了M(K4),M(W4);(ii)用松弛极小圈超平面的方法从M(K4)构造了Q6,从M(W4)构造了W4,找出了W4可线性表示的所有...     

拟阵闭包算子诱导拓扑空间的分离性

拟阵是图论与代数的结合,而拓扑学是一门重要的数学基础学科.利用拟阵理论研究拓扑空间,从而将两者进行融合,通过拟阵的闭包算子定义拟阵拓扑空间,进一步利用拟阵闭包算子与拓扑闭包算子之间的关系,讨论拟阵拓扑空间的分离性.     

闭模糊拟阵模糊圈的算法研究

用闭模糊拟阵的基本序列来研究和描述它的模糊圈,找到了从闭模糊拟阵的模糊相关集或模糊独立集计算模糊圈的方法,并给出了相应的算法.     

离散事件动态系统研究中图论方法的某些应用

因为许多离散生产过程都可以用离散事件系统描述，所以离散事件动态系统有很强的实用背景，例如柔性制造系统，因此，受到国内外的广泛注意和重视，进行深入研究，已获得一些很重要的理论结果．本文试图用图论的观点和方法，对离散事件动态系统的某些重要结果予以注释和新的证明，并探讨图论在该领域研究中的进一步应用．     

在1/2Z~+中的(F-Z_1)-可流拟阵(M-Z_1)/Z_2

研究在1/2Z⁺中的F-可流拟阵的幼阵的可流性.首先给出F-可流拟阵的充要条件及在1/2Z+中的F-可流拟阵的幼阵的可流性.首先给出F-可流拟阵的充要条件及在1/2Z⁺中是F-可流拟阵的定义.证明了辅助命题:若拟阵是无环元的,则它的每个元素都恰在k个余极小圈之中;对满足一定的条件的极小圈集合,成立最小极小圈集合的等式.设映射p′在幼阵中满足1/2Z+中是F-可流拟阵的定义.证明了辅助命题:若拟阵是无环元的,则它的每个元素都恰在k个余极小圈之中;对满足一定的条件的极小圈集合,成立最小极小圈集合的等式.设映射p′在幼阵中满足1/2Z⁺中(F-Z_1)-可流拟阵的不等式,由p′定义p.证明p在拟阵中满足同样的不等式.由映射Φ满足是12/Z+中(F-Z_1)-可流拟阵的不等式,由p′定义p.证明p在拟阵中满足同样的不等式.由映射Φ满足是12/Z⁺中F-可流拟阵的等式,可找到最小属于幼阵的极小圈,定义Φ′(C′)则可证明Φ′满足在1/2Z+中F-可流拟阵的等式,可找到最小属于幼阵的极小圈,定义Φ′(C′)则可证明Φ′满足在1/2Z⁺中是(F-Z_1)-可流的等式.即由在1/2Z+中是(F-Z_1)-可流的等式.即由在1/2Z⁺中F-可流拟阵的充要条件,证明了幼阵在1/2Z+中F-可流拟阵的充要条件,证明了幼阵在1/2Z⁺中是(F-Z_1)-可流的.     

任意基数集上的拟阵的圈及连通性

通过研究任意基数集上的拟阵圈的性质,继而得出当此拟阵连通时,它可由含任一给定元素的圈集唯一确定的结论.     

双圈拟阵

Sim■es Pereira于1992年提出双圈拟阵.本文讨论了(i)双圈拟阵及其秩函数;(ii)次模函数在双圈拟阵中的应用;(iii)双圈拟阵B(G)的横贯拟阵.主要结果:1°由圈矩阵Bf=[I,Bf12]和圈秩的概念,推出M(f0)为双圈拟阵;2°证明了双圈拟阵B(G)等于由子集族{Av∶v∈V(G)},e与v在G中相关联}所确定的横贯拟阵;3°用不同于Matthews(1977)的方法证明了(iii).     

极小圈模对与二元域拟阵的特征

研究极小圈模对与二元域拟阵的特征.首先给出拟阵M的极小圈模对,模对的并的秩与相应的超平面的交的秩三者的等价关系.在两个极小圈不等的条件下,证明了满足极小圈消去公理的极小圈是唯一的并且极小圈模对的对称差包含在其中,结合极小圈的对称差的表示,证明了极小圈与基的差的绝对值大于等于2.后面两个证明都把原来的必要条件推广为充要条件.最后,用M上不相同的极小圈,极小圈模对,极小圈的对称差表示,M上不相等的超平面,超平面的并不等于E及满足的秩等式极简单地刻划了二元域拟阵M的特征.     

关于G-V模糊拟阵的对偶模糊拟阵概念的推广

模糊拟阵的研究方法之一就是通过基本序列和导出拟阵序列将模糊拟阵问题转化为普通拟阵问题来进行研究。本文正是采用这个研究方法,主要完成了三项工作:一是给出并证明了闭正规模糊拟阵和正规模糊拟阵的几个充要条件;二是将对偶模糊拟阵概念从闭正规模糊拟阵推广到正规模糊拟阵并讨论了有关性质和计算;三是证明了除正规模糊拟阵外,其他模糊拟阵不存在这样的对偶模糊拟阵。     

M-模糊化拟阵的差导算子北大核心

引入M-模糊化差导算子的新概念,给出它的一些等价刻画,探讨M-模糊化拟阵、M-模糊化差导算子以及M-模糊化闭包算子之间的关系。     

准模糊图拟阵基图的最大权基与字典序最大的基

模糊拟阵的基图是模糊拟阵的基本概念.在准模糊图拟阵的基础上,给出了准模糊图拟阵基图的最大权基与字典序最大的基的性质,这将有利于模糊拟阵从基础研究逐渐转向应用研究.     

准模糊图拟阵基图

在准模糊图拟阵的基础上,提出准模糊图拟阵的基图,并讨论准模糊图拟阵基图的性质和特征。     

Concept of a vertex in a matroid and 3-connected graphs

The concept of a matroid vertex is introduced. The vertices of a matroid of a 3-connected graph are in one-to-one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3-connected graphs implies isomorphism. The concept of a vertex of a matroid leads to an equally simple proof of Whitney's theorem on the unique embedding of a 3-connected planar graph in the sphere. It also leads to a number of new facts about 3-connected graphs. Thus, consideration of a vertex in a matroid that is the dual of the matroid of a graph leads to a natural concept of a nonseparating cycle of a graph. Whitney's theorem on cyclic isomorphism can be strengthened (even if the nonseparating cycles of a graph are considered, the theorem is found to work) and a new criterion for planarity of 3-connected graphs is obtained (in terms of nonseparating cycles).     

Branch decomposition heuristics for linear matroids

This paper presents three new heuristics which utilize classification, max-flow, and matroid intersection algorithms respectively to derive near-optimal branch decompositions for linear matroids. In the literature, there are already excellent heuristics for graphs, however, no practical branch decomposition methods for general linear matroids have been addressed yet. Introducing a “measure” which compares the “similarity” of elements of a linear matroid, this work reforms the linear matroid into a similarity graph. Then, the classification method, the max-flow method, and the mat-flow method, all based on the similarity graph, are utilized on the similarity graph to derive separations for a near-optimal branch decomposition. Computational results using the methods on linear matroid instances are shown respectively.     

障碍拟阵图

Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.     

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of semidefinite programming relaxations of the cut polytope of the graph. If the binary matroid avoids certain minors we can characterize when the first theta body in the hierarchy equals the cycle polytope of the matroid. Specialized to cuts in graphs, this result solves a problem posed by Lovász.     

Factor group of the automorphism group of a matroid basis graph with respect to the automorphism group of the matroid

Any automorphism of a matroid induces an automorphism of its basis graph. We try to determine what can be said concerning the automorphisms of the basis graph which are not induced by matroids' automorphisms. In particular, we determine the structure of the factor group of the automorphism group of the basis graph with respect to the automorphism group of the matroid, in the event that this factor group exists.     

A branching greedoid for multiply-rooted graphs and digraphs

Two combinatorial structures which describe the branchings in a graph are graphic matroids and undirected branching greedoids. We introduce a new class of greedoids which connects these two structures. We also apply these greedoids to directed graphs to consider a matroid defined on a directed graph. Finally, we obtain a formula for the greedoid characteristic polynomial for multiply-rooted directed trees which can be determined from the vertices.     

Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications

The purpose of this paper is to introduce and study a new class of combinatorial optimization problems in which the objective function is the algebraic sum of a bottleneck cost function (Min-Max) and a linear cost function (Min-Sum). General algorithms for solving such problems are described and general complexity results are derived. A number of examples of application involving matchings, paths and cutsets, matroid bases, and matroid intersection problems are examined, and the general complexity results are specialized to each of them. The interest of these various problems comes in particular from their strong relation to other important and difficult combinatorial problems such as: weighted edge coloring of a graph; optimum weighted covering with matroid bases; optimum weighted partitioning with matroid intersections, etc. Another important area of application of the algorithms given in the paper is bicriterion analysis involving a Min-Max criterion and a Min-Sum one.     

Polynomial Time Recognition of Uniform Cocircuit Graphs

We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid.