期刊文献+

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

Circuit Modular Pair and Characterizations of Binary Matroids
原文传递
导出
摘要 研究极小圈模对与二元域拟阵的特征.首先给出拟阵M的极小圈模对,模对的并的秩与相应的超平面的交的秩三者的等价关系.在两个极小圈不等的条件下,证明了满足极小圈消去公理的极小圈是唯一的并且极小圈模对的对称差包含在其中,结合极小圈的对称差的表示,证明了极小圈与基的差的绝对值大于等于2.后面两个证明都把原来的必要条件推广为充要条件.最后,用M上不相同的极小圈,极小圈模对,极小圈的对称差表示,M上不相等的超平面,超平面的并不等于E及满足的秩等式极简单地刻划了二元域拟阵M的特征. The properties of circuit modular pair and characterizations of binary matroids are investigated.First,the equivalence relations among the circuit modular pair over matroid M,the rank of the union of modular pair and the rank of the intersection of the corresponding hyperplane are studied.Under the condition that two circuits are not equal,the uniqueness of circuit satisfying circuit eUmination and the symmetric difference of circuit modular pahis a subset of a circuit over Mare proved,combining the representation of the symmetric difference of circuits,the fact that the absolute value of the difference of circuit and the basis for M is greater or equal to 2 is given.In the two proofs of above,the necessary conditions in[1]of circuit modular pair are showed to be sufficient conditions of circuit modular pair.Finally,some characterizations of binary matroids are easily deduced based on two different circuit over M,the representation of symmetric difference,two different hyperplane over M,the union of hyperplanes which satisfying the rank equation is not equal to E.
出处 《数学的实践与认识》 CSCD 北大核心 2014年第10期224-229,共6页 Mathematics in Practice and Theory
基金 陕西省教育厅自然科学资助项目(12JK0866)
关键词 极小圈模对 超平面 对称差 二元域拟阵的特征 circuit modular pair hyperplane symmetric difference characterizations of binary matroids
  • 相关文献

参考文献8

  • 1Oxley J G. Matroid theory[M]. New York, Oxford University Press, 2011.
  • 2Wagner D K. on Mighton's characterization of graphic matroidsIJ]. Journal of Combinatorial Theory, Series B, 2010, 100(5): 493-496.
  • 3Mayhew D, Royle G, Whittle G. The internally 4-connected binary matroids with no M (K3, 3)- minor[M]. American Mathematical Soc., 2010.
  • 4Mayhew D, Royle G, Whittle G. Excluding Kuratowski graphs and their duals from binary ma- troids[J], arXiv preprint arXiv:0902.0198, 2009.
  • 5Wu H. on vertex-triads in 3-connected binary matroids[J]. Combinatorics Probability and Comput- ing, 1998, 7(4): 485-497.
  • 6Traldi L. Binary matroids and local complementation[J], arXiv preprint arXiv:1301.4946, 2013.
  • 7Chun C, Mayhew D, Oxley J. Towards a splitter theorem for internally 4-connected binary ma- troids[J]. Journal of Combinatorial Theory, Series B, 2012, 102(3): 688-700.
  • 8Jackson B. Counting 2-connected deletion-minors of binary matroids[J]. Discrete Mathematics, 2013, 313(11): 1262-1266.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部