检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《天津大学学报(自然科学与工程技术版)》2003年第1期73-77,共5页Journal of Tianjin University:Science and Technology
基 金:~~
摘 要:将拟阵间有关强映射和自同构的概念推广到广义拟阵上.给出强映射的判定定理及两种具体找到强映射的方法,为实现用计算机搜寻强映射提供了理论依据.着重讨论区间广义拟阵自同构的判定定理,并推出关于广义拟阵自同构群不存在平坦公理的结论.结果是对在网络和算法上蓬勃发展的广义拟阵理论的充实,为进一步讨论广义拟阵间的关系提供了基础.The concepts of strong map between matroids and an automorphism of a matroid are first extended to that of greedoids,and then followed by presenting some decision theorems for strong maps of greedoids and two methods of finding the strong maps of a greedoid concretely. The methods provide the theoretical foundation for finishing the search of the concrete strong maps of a greeedoid with computer. Thirdly, discussions about the automorphism group of an interval greedoid are made and two decision theorems about it are established. As a consequence,a flat axiom is found that it is not existed in the automorphism group of a greedoid. All the results described in this paper a complementary to the greedoid theory which is developing in network and greedy algorithm vigorously. Moreover, they provide a basis for the study on the relationships between greedoids.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.104