论文部分内容阅读
最优组合批处理码的单调性质及上下界
【机 构】
：
河北师范大学数学与信息科学学院,石家庄050024
【出 处】
：
第六届全国组合数学与图论大会
【发表日期】
：
2014年期
其他文献
Unimodality problems often arise in combinatorics, analysis, algebra, geometry, probability and statistics.In this topic, we will report some recent advance in
会议
Epidemiology of Multiple SclerosisPrevalence gradients in Northern Hemisphere-North of 37th parallet(125 cases/100,000population)-South of 37th parallet(70 case
会议
Alzheimer disease is characterized Pathologically by· Senile plaque (SP)------Aβ peptide· Neurofibrillary tangles (NFTs)------hyperphosphorylated tau· Neuro
会议
In a recent systematic study, C.Sandon and F.Zanello offered 30 conjectured identities for partitions.In this lecture, we provide proofs for all 30 conjectures
会议
Bizley studied a generalization of Dyck paths from (0, 0) to (pd, qd) (gcd(p, q) =1), which never go below the line py =qx with step set {(0, 1), (1, 0)}, and e
会议
Let G be a graph with a nonzero Laplacian eigenvalue μ of multiplicity k.A line star set for μ in G is a set Y of k edges of G such that μ is not a Laplacian
会议
Let A be a magic square of even order n.A is a Yang Hui type magic square with t-powered sum if for each e =2, 3, … , t, the sum of the elements of the first n
会议
For a given sequence {zn}n≥0 of positive real numbers, {zn}n≥0 is said to be log-concave (or log-convex) if z2n ≥ zn-1zn+1 (or zn2 ≤ zn-1zn+1) for all n ≥
会议
For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph.The competition number k(G) of a graph G i
会议
Let G be a simple undirected graph with n vertices.A stable set of a graph G is a set of vertices no two of which are adjacent.The cardinality of a maximum stab
会议