检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:詹高娃
机构地区:[1]华南师范大学数学科学学院,广东广州510631
出 处:《汕头大学学报(自然科学版)》2015年第2期34-37,71,共5页Journal of Shantou University:Natural Science Edition
摘 要:本文研究限定相邻元素的排列问题,由单组的限邻问题推广多组限邻问题,并得到集合中若干个不相交子集之间的限邻排列问题的解决办法,其中多次用到容斥原理、集合的交并运算和归纳与猜想原理,并对定理进行了初步的推广与应用.In this paper, the permutation problem of limit adjacent elements is studied. The single set of limit problem is extended to multi-set of limit problem by using inclusion-exclusion principle, collection of occurring simultaneously and principle of induction and conjecture frequently. A solution to deal with limit adjacent arrangement problems about collection of several disjoint subsets is achieved. Preliminary popularization and application of the theorem are also studied
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62