您要查找的是不是：
- Keywords poset;group;matroid;poset matroid;greedoid; 偏序集;群;拟阵;偏序集拟阵;广义拟阵;
- Characteristic theorems for the automorphism group of a poset matroid 偏序集拟阵自同构群的特征定理
- poset matroid 偏序集拟阵
- How to apply poset theory to solve such problem? 怎样运用偏序集理论的手法去解决该问题呢？
- Keywords Simple Matroids;Geometric lattices;Strong maps;Rank strong maps;Poset matroids;Combinatorial schemes;Equivalence of category; 简单拟阵;几何格;强映射;秩强映射;偏序集拟阵;组合概型;范畴等价;
- A poset is an FS-domain iff it is a Lawson compact FS-poset. 一个偏序集是一个FS-Domain当且仅当它为Lawson紧的FS-偏序集;
- In this paper, let X be a finite poset, then Aut2 X ?Aut X . 证明了有限格 2 X 的自同构群 Aut2 X 与有限偏序集 X的自同构群是同构的这一结论
- In this paper , we investigate the interval topology on a poset . 本文主要研究了偏序集上的区间拓扑的一些性质。
- It is known that poset theory is important to the study on greedoid theory. 摘要众所周知，偏序集理论在研究广义拟阵论中起着重要作用。
- Moreover, based on these, some relations between matroid and antimatroid are discussed here. 在此基础上，讨论了拟阵与反反拟阵之间的一些关系。
- Graph theory and matroid theory have witnessed an unprecedented growth in the twentieth century. 图论和拟阵理论在二十世纪经历了空前的发展。
- It is proved that a central essential arrangement is irreducible if, and only if, the matroid is connected. 对超平面中心构形 构造了拟阵 ，在超平面构形和拟阵之间建立了对应关系。
- By generalizing the idea of crisp matroid sums to fuzzy matroid, the fuzzy matroid sum is defined. 通过将传统拟阵理论中和的概念推广到模糊拟阵,给出了模糊拟阵的和的定义。
- The set of all Boolean association rules is just a lower segment of the graded poset. 由事物数据库的项目集构造一个分层偏序集,使所有布尔关联规则之集构成该分层偏序集的一个下集。
- But what is the direct relation between poset theory and the containment relations between different kinds of greedoids? 但是偏序集理论与不同种广义拟阵间的包含关系的直接联系是什么呢?
- Number1covert to find the minimum matching matroid of bipartite graph,and number2to search for one matching of permeating musters through bipartite graph. 第一个问题转化为求二部图最小匹配数,第二个问题转化为求二部图中渗透集合每个点的一个匹配。
- Discuss mapping properties of Z-continuous poset. Some characterize theorem of Z-continuous poset is given by using galois connection. 摘要在Z-连续偏序集的基础上对其上一些映射性质作了进一步的探讨。利用伴随给出了Z-连续偏序集的等价刻划。
- A graded poset is constructed from the items of a transactional database.The set of all Boolean association rules is just a lower segment of the graded poset. 摘要由事物数据库的项目集构造一个分层偏序集，使所有布尔关联规则之集构成该分层偏序集的一个下集。
- This leads to the definition of upper bounds .Given a subset S of some poset P, an upper bound of S is an element b of P that is above all elements of S. 这种更加抽象的方式更有意义，因为你可以从一般性架构推导出各种定理，而不用关心任何特定次序的细节。
- This paper deals with the relation between matroid and concept lattice by constructive ways and gets that up to isomorphism, every matroid is a concept lattice, but not vice versa. 摘要本文以构造的方式建立起拟阵与概念格的联系，得到在同构意义下每个拟阵是一个概念格，但反之不然的结论；
