P(n，k)的计数及其良域

设P(n,k)为整数n分为k部的无序分拆的个数,每个分部≥1;P(n)为n的全分拆的个数.P(n,k)是用途广泛的、且又十分难予计算的数.本文证明了下述定理：当n＜k,P(n,k)=0;当k≤n≤2k,P(n,k)=P(n-k);当k=1,4≤n≤5,或者当k≥2,2k+1≤n≤3k+2,P(n,k)=P(n-k)-(?)P(t)还定义了P(n,k)的良城,因面可借助若干个P(n)的值,迅速地计算大量的P(n,k)的值.     

快速造P(n,k)大表的左肩法则和斜线法则

设Ｐ（ｎ,ｋ）为整数ｎ分为ｋ部的无序分拆的个数,每个分部≥１,它为大师欧拉所建立（１７０７－１７８３）．它是组合图论和数论里最重要的数据之一．然而,它却十分难于计数和造表．本文,由公式Ｐ（ｎ,ｋ）＝Ｐ（ｎ－１,ｋ－１）＋Ｐ（ｎ－ｋ,ｋ）定义了Ｐ（ｎ,ｋ）的左肩数和锐角数,并由此得到求Ｐ（ｎ,ｋ）的左肩法则（第一法则）．还根据本文作者［５］的一些重要定理得到求 Ｐ（ｎ,ｋ）的斜线法则（第二法则）．使用这些法则得到造Ｐ（ｎ,ｋ）大表的有趣原理．为方便计,我们仅用第一法则设计了计算机程序,用此程序即可快速造出任意大的Ｐ（ｎ,ｋ）表．     

Hamiltonian[k,k+1]-因子

本文考虑n/2-临界图中Hamiltonian[k,k+1]-因子的存在性。Hamiltonian[k,k+1]-因子是指包含Hamiltonian圈的[k,k+1]-因子;给定阶数为n的简单图G,若δ(G)≥n/2而δ(G\e)相似文献   

n进制中非零数字之积函数的均值公式

设 N =a1nk1+ a2 nk2 +… + asnks( 1 aik2 >… >ks 0 ) ,a( N,n) =a1a2 … as,本文给出了均值 Ar( N ,n) =∑m相似文献   

再论无穷多个无穷小量的乘积

对文[6]提出的质疑给出回答,表明由于不同的无穷小量趋近于0的速度有快有慢,因此无穷多个无穷小量的乘积∏∞k=1{x_n~(k)}∞n=1,有可能不是无穷小量(其中对每个正整数k,{x_n~(k)}_(n=1)~∞表示极限为0的数列),而验证∏∞k=1{x_n~(k)}∞n=1是否是无穷多个无穷小量的乘积,只需验证对每个正整数k,当n→+∞时,{x_n~(k))_(n=1)~∞是否趋近于0,而无需考虑函数列{{x_n~(k)}_(n=1)~∞}_(k=1)~∞的极限limk→∞x_n~(k)是不是无穷小量.进而,对无穷多个无穷小量的乘积是无穷小量或不是无穷小量给出了一些充分条件,     

一类加强不等式的推广

本文给出了 n个正数 x1 ,x2 ,… ,xn 的如下不等式 :∏nk=1( xαk+x-αk )≥ ( Aαn( x) +A-αn ( x) ) n ,每个 xk≤ xα,∏nk=1( xαk+x-αk )≤ ( Aαn( x) +A-αn ( x) ) n ,每个 xk≥ e.其中 α>0 ,xα=[4α2 +1 +2 α]12α ,常数 e=2 .71 81 82 81 8… ,An( x) =1n∑nk=1xk.     

关于Erdos-Jacobson-Lehel 问题的门槛

设σ(k,n）表示最小的正整数m，使得对于每个n项正可图序列，当其项和至少为m时，有一个实现含k 1个顶点的团作为其子图。Erdos等人猜想：σ(k,n）＝（k-1)(2n-k) 2.Li等人证明了这个猜想对于k≥5，n≥（^k2））＋3是对的，并且提出如下问题：确定最小的整数N（k），使得这个猜想对于n≥N(k）成立。他们同时指出：当k≥5时，[5k-1/2]≤N(k）≤（^k2) 3.Mubayi猜想：当k≥5时，N(k）＝[5k-1/2]。在本文中，我们证明了N（8）＝20，即Mubayi猜想对于k=8是成立的。     

A family of WZ pairs and q-identities

The Ramanujan Journal - We observe that $$(F(n+k+1,k)+G(n+k,k), G(n+k,k))$$ is a WZ pair provided that (F(n, k), G(n, k)) is a WZ pair. This observation enables us to...     

关于多项式系数的整除性

设 n是正整数 ,k1 ,k2 ,… ,ks 是适合 k1 +k2 +… +ks=n的非负整数 ,正整数 nk1 k2 … ks=n!k1 !k2 !… ks!称为多项式系数 .本文讨论了当n=a0 +a1 p+a2 p2 +… +arpr ,其中 p为素数且 p≤ n,0≤ ai相似文献   

Asymptotic Behavior of a Class of Nonlinear Delay Difference Equations

In this paper, we shall study the asymptotic behavior of solutions of difference equations of the form x n +1 = x n p f ( x n m k 1 , x n m k 2 ,…, x n m k r ), n =0,1,…, where p is a positive constant and k 1 ,…, k r are (fixed) nonnegative integers. In particular, permanence and global attractivity will be discussed.     

一类组合不等式的简证与推广

利用概率方法给出了形如sum from k=1 to n(1/k)>π/4(sum from k=1 to n((-1)k-1Cnk)1/(k～1/2))与sum from k=1 to n(1/k)<2～(1/2)(sum from k=1 to n((-1)k-1Cnk)1/k2)1/2的组合不等式.     

Constructions and Properties of k out of n Visual Secret Sharing Schemes

The idea of visual k out of n secret sharing schemes was introduced in Naor. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described.Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given.     

广义Peterson图的邻点可区别的全染色

设P_(n,k)是一个简单图,其顶点集和边集分别为:V(P_(n,k))={u_0,u_1,…u_(n-1),v_0,v_1,…v_(n-1)},E(P_(n,k))={u_iu_(i+1),u_iv_i,v_iv_(1+k)},则称P_(n,k)为广义Peterson图,其中n≥5,0相似文献   

The Spectrum and Automorphism Group of the Set-Inclusion Graph

Let n,k and l be integers with 1 ≤ k ＜ l ≤ n-1.The set-inclusion graph G(n,k,l) is the graph whose vertex set consists of all k-andl-subsets of[n]={1,2,...,n},where two distinct vertices are adjacent if one of them is contained in the other.In this paper,we determine the spectrum and automorphism group of G(n,k,l).     

On the divisibility properties concerning sums of binomial coefficients

For any integer \(n> 1,\) we prove

$$\begin{aligned} 2n{2n\atopwithdelims ()n}&\bigg |\sum _{k=0}^{n-1}(3k+1){2k\atopwithdelims ()k}^3(-8)^{n-1-k},\\ 2n{2n\atopwithdelims ()n}&\bigg |\sum _{k=0}^{n-1}(6k+1){2k\atopwithdelims ()k}^3(-512)^{n-1-k},\\ 2n{2n\atopwithdelims ()n}&\bigg |\sum _{k=0}^{n-1}(42k+5){2k\atopwithdelims ()k}^3 4096^{n-1-k},\\ 2n{2n\atopwithdelims ()n}&\bigg |\sum _{k=0}^{n-1}(20k^2+8k+1){2k\atopwithdelims ()k}^5(-4096)^{n-1-k}. \end{aligned}$$

The first three results confirm three divisibility properties on sums of binomial coefficients conjectured by Z.-W. Sun.

     

Remark on the Helly number for strongly convex sets on Riemannian manifolds

Replacing convex by strongly convex we show that Helly's famous intersection theorem holds on every Riemannian n-manifold in the following form: The intersection of k relatively compact, strongly convex subsets of M (kn+i2) is nonvoid as soon as any n+i of these sets have a nonvoid intersection, where i=2 if M is homeomorphic to the standard n-sphere and i=1 otherwise.     

具有固定行列和k的阶为2k-2的(0,1)-矩阵的最大跳跃数

1992年Brualdi与Jung首次引出了最大跳跃数M(n,k),即每行每列均含k个1的阶为n的(0,1)-矩阵的跳跃数的极大数,给出了满足条件1≤k ≤n ≤10的(0,1)-矩阵的最大跳跃数M(n,k)的一个表,并提出了几个猜想,其中包括猜想M(2k-2,k)=3k-4 [k-2/2].本文证明了当k≥11时,对每个A∈∧(2k-2,k)有b(A)≥4.还得到了该猜想的另一个反例.     

一类Y~(SG)(γλ,n)∪βS_n~G形图簇的伴随分解及其补图的色等价性

设G是m阶连同图,我们用S_n~G(n=km+1)表示把kG的每个分支的d_i度点分别与星图S_k+1的k个1度点重迭后得到的图,Y~(SG)(r_1n,n)表示把r_1S_n~G中每个分支的k度点依次与图的k度点邻接后得到的图,Y~(SG)(r_2λ_1,n)表示把τ_2Y~(SG)(τ_1n,n)中每个分支的r_1+k度点依次与图S_n~G的k度点邻接后得到的图,若k≥3,用Y~(sG)(r_kλ__(k-1),n)表示把τ_kY~(sG)(r_(k-1)λ_(k-2),n)中每个分支的τ_(k-1)+k度顶点依次与图S_n~G的k度点邻接后得到的图,这里λ_k=r_kλ_(k-1)+n.运用图的伴随多项式的性质,证明了一类新的图簇Y~(sG)(r_kλ__(k-1),n)∪β_kS_n~G的伴随多项式的因式分解定理,进而得到了这类图的补图的色等价图.     

关于正三角形和正方形吻接数的一个简单证明

设 pn是任意一个正 n边形 ,最大整数 k(pn)称为 pn的吻接数 ,其中 ,在同一平面内有 k(pn)个与 pn全等的正 n边形均与 pn有非空的交集 ,但没有重叠 ,而且 k(pn)个正 n边形两两没有重叠 . Youngs (Amer.Monthly46(1 93 9) 2 0 ) ,Klamkin(Math.Mag. 68(1 995 ) 1 2 8)先后证明了 k(p3) =1 2 ,k(p4 ) =8,作者(Discrete Math.68(1 998) 2 93 )证明了当 n >6时 k(pn) =6.然而 ,Youngs、Klamkin等人关于 k(p3) =1 2 ,k(p4 ) =8的证明非常复杂 .本文将就 k(p3) =1 2 ,k(p4 ) =8给出非常简单的证明 .     

The Existence of Partitioned Generalized Balanced Tournament Designs with Block Size 3

A generalized balanced tournament design, GBTD(n, k), defined on a kn-set V, is an arrangement of the blocks of a (kn, k, k – 1)-BIBD defined on V into an n × (kn – 1) array such that (1) every element of V is contained in precisely one cell of each column, and (2) every element of V is contained in at most k cells of each row. Suppose we can partition the columns of a GBTD(n, k) into k + 1 sets B1, B2,..., Bk + 1 where |Bi| = n for i = 1, 2,..., k – 2, |Bi| = n–1 for i = k – 1, k and |Bk+1| = 1 such that (1) every element of V occurs precisely once in each row and column of Bi for i = 1, 2,..., k – 2, and (2) every element of V occurs precisely once in each row and column of Bi Bk+1 for i = k – 1 and i = k. Then the GBTD(n, k) is called partitioned and we denote the design by PGBTD(n, k). The spectrum of GBTD(n, 3) has been completely determined. In this paper, we determine the spectrum of PGBTD(n,3) with, at present, a fairly small number of exceptions for n. This result is then used to establish the existence of a class of Kirkman squares in diagonal form.