首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we consider combinatorial numbers (Cm,k)m1,k0, mentioned as Catalan triangle numbers where Cm,k?m?1k?m?1k?1. These numbers unify the entries of the Catalan triangles Bn,k and An,k for appropriate values of parameters m and k, i.e., Bn,k=C2n,n?k and An,k=C2n+1,n+1?k. In fact, these numbers are suitable rearrangements of the known ballot numbers and some of these numbers are the well-known Catalan numbers Cn that is C2n,n?1=C2n+1,n=Cn.We present identities for sums (and alternating sums) of Cm,k, squares and cubes of Cm,k and, consequently, for Bn,k and An,k. In particular, one of these identities solves an open problem posed in Gutiérrez et al. (2008). We also give some identities between (Cm,k)m1,k0 and harmonic numbers (Hn)n1. Finally, in the last section, new open problems and identities involving (Cn)n0 are conjectured.  相似文献   

2.
3.
The generalized Ramsey number R(G1,G2) is the smallest positive integer N such that any red–blue coloring of the edges of the complete graph KN either contains a red copy of G1 or a blue copy of G2. Let Cm denote a cycle of length m and Wn denote a wheel with n+1 vertices. In 2014, Zhang, Zhang and Chen determined many of the Ramsey numbers R(C2k+1,Wn) of odd cycles versus larger wheels, leaving open the particular case where n=2j is even and k<j<3k2. They conjectured that for these values of j and k, R(C2k+1,W2j)=4j+1. In 2015, Sanhueza-Matamala confirmed this conjecture asymptotically, showing that R(C2k+1,W2j)4j+334. In this paper, we prove the conjecture of Zhang, Zhang and Chen for almost all of the remaining cases. In particular, we prove that R(C2k+1,W2j)=4j+1 if j?k251, k<j<3k2, and j212299.  相似文献   

4.
5.
TextFor any given two positive integers k1 and k2, and any set A of nonnegative integers, let rk1,k2(A,n) denote the number of solutions of the equation n=k1a1+k2a2 with a1,a2A. In this paper, we determine all pairs k1,k2 of positive integers for which there exists a set A?N such that rk1,k2(A,n)=rk1,k2(N?A,n) for all n?n0. We also pose several problems for further research.VideoFor a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=EnezEsJl0OY.  相似文献   

6.
7.
8.
9.
10.
For bipartite graphs G1,G2,,Gk, the bipartite Ramsey number b(G1,G2,,Gk) is the least positive integer b so that any coloring of the edges of Kb,b with k colors will result in a copy of Gi in the ith color for some i. In this paper, our main focus will be to bound the following numbers: b(C2t1,C2t2) and b(C2t1,C2t2,C2t3) for all ti3,b(C2t1,C2t2,C2t3,C2t4) for 3ti9, and b(C2t1,C2t2,C2t3,C2t4,C2t5) for 3ti5. Furthermore, we will also show that these mentioned bounds are generally better than the bounds obtained by using the best known Zarankiewicz-type result.  相似文献   

11.
12.
13.
14.
Let G be a finite group, written multiplicatively. The Davenport constant of G is the smallest positive integer D(G) such that every sequence of G with D(G) elements has a non-empty subsequence with product 1. Let D2n be the Dihedral Group of order 2n and Q4n be the Dicyclic Group of order 4n. Zhuang and Gao (2005) showed that D(D2n)=n+1 and Bass (2007) showed that D(Q4n)=2n+1. In this paper, we give explicit characterizations of all sequences S of G such that |S|=D(G)?1 and S is free of subsequences whose product is 1, where G is equal to D2n or Q4n for some n.  相似文献   

15.
16.
17.
18.
《Discrete Mathematics》2006,306(19-20):2438-2449
  相似文献   

19.
In this work, we prove the existence of convex solutions to the following k-Hessian equation
Sk[u]=K(y)g(y,u,Du)
in the neighborhood of a point (y0,u0,p0)Rn×R×Rn, where gC,g(y0,u0,p0)>0, KC is nonnegative near y0, K(y0)=0 and Rank(Dy2K)(y0)n?k+1.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号