关于不等式multiply from i=1 to n(x_i+(1/x_i))≥(n+(1/n))~n(x_i为正数,sum from i=1 to n x_i=1)的正确性,《数学通讯》已有多篇文章给出了证明,本文将这个不等式推广到较一般的情形。从sum from i=1 to n x_i的值上推广有: 定理1 ...关于不等式multiply from i=1 to n(x_i+(1/x_i))≥(n+(1/n))~n(x_i为正数,sum from i=1 to n x_i=1)的正确性,《数学通讯》已有多篇文章给出了证明,本文将这个不等式推广到较一般的情形。从sum from i=1 to n x_i的值上推广有: 定理1 (1)如果x_i∈R+(i=1,2,…,n),展开更多
Given an alphabet ∑ and a finite minimal set B of forbidden words,a combinatorial enumeration problem on bacterial complete genomes is transformed to enumerating strings of a given length which do not contain any str...Given an alphabet ∑ and a finite minimal set B of forbidden words,a combinatorial enumeration problem on bacterial complete genomes is transformed to enumerating strings of a given length which do not contain any string in B as their substrings.From the fact that a string in the language is equivalent to a path in the corresponding graph,we have obtained a polynomial time algorithm by modifying the power of the adjacency matrix in the graph.展开更多
文摘关于不等式multiply from i=1 to n(x_i+(1/x_i))≥(n+(1/n))~n(x_i为正数,sum from i=1 to n x_i=1)的正确性,《数学通讯》已有多篇文章给出了证明,本文将这个不等式推广到较一般的情形。从sum from i=1 to n x_i的值上推广有: 定理1 (1)如果x_i∈R+(i=1,2,…,n),
基金This research is supported by the National Natural Science Foundation of China (No. 10271103) Natural Science Foundation of Yunnan Province(No. 2003F0015M).
文摘Given an alphabet ∑ and a finite minimal set B of forbidden words,a combinatorial enumeration problem on bacterial complete genomes is transformed to enumerating strings of a given length which do not contain any string in B as their substrings.From the fact that a string in the language is equivalent to a path in the corresponding graph,we have obtained a polynomial time algorithm by modifying the power of the adjacency matrix in the graph.
