共查询到20条相似文献,搜索用时 31 毫秒
1.
Ke-Ang Fu 《Journal of Mathematical Analysis and Applications》2009,356(1):280-287
Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively. 相似文献
2.
A (d,1)-total labelling of a graph G assigns integers to the vertices and edges of G such that adjacent vertices receive distinct labels, adjacent edges receive distinct labels, and a vertex and its incident edges receive labels that differ in absolute value by at least d. The span of a (d,1)-total labelling is the maximum difference between two labels. The (d,1)-total number, denoted , is defined to be the least span among all (d,1)-total labellings of G. We prove new upper bounds for , compute some for complete bipartite graphs Km,n, and completely determine all for d=1,2,3. We also propose a conjecture on an upper bound for in terms of the chromatic number and the chromatic index of G. 相似文献
3.
This paper studies the game chromatic number and game colouring number of the square of graphs. In particular, we prove that if G is a forest of maximum degree Δ≥9, then , and there are forests G with . It is also proved that for an outerplanar graph G of maximum degree Δ, , and for a planar graph G of maximum degree Δ, . 相似文献
4.
Let be the signed edge domination number of G. In 2006, Xu conjectured that: for any 2-connected graph G of order n(n≥2), . In this article we show that this conjecture is not true. More precisely, we show that for any positive integer m, there exists an m-connected graph G such that . Also for every two natural numbers m and n, we determine , where Km,n is the complete bipartite graph with part sizes m and n. 相似文献
5.
Generalized Steiner systems were first introduced by Etzion and used to construct optimal constant weight codes over an alphabet of size g+1 with minimum Hamming distance 2k−3, in which each codeword has length v and weight k. As to the existence of a , a lot of work has been done for k=3, while not so much is known for k=4. The notion k-∗GDD was first introduced by Chen et al. and used to construct . The necessary condition for the existence of a is v≥14. In this paper, it is proved that there exists a for any prime power and v≥19. By using this result, the known results on the existence of optimal quaternary constant weight codes are then extended. 相似文献
6.
In this paper we study the maximal operators and the convolution operators Tδ associated with multipliers of the form
7.
The strong Stieltjes moment problem for a bisequence consists of finding positive measures μ with support in [0,∞) such that
8.
A pair of sequences such that and
9.
Jian-Hua Yin 《Discrete Mathematics》2009,309(8):2579-6276
An r-graph is a loopless undirected graph in which no two vertices are joined by more than r edges. An r-complete graph on m+1 vertices, denoted by , is an r-graph on m+1 vertices in which each pair of vertices is joined by exactly r edges. A non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is r-graphic if it is realizable by an r-graph on n vertices. Let be the smallest even integer such that each n-term r-graphic sequence with term sum of at least is realizable by an r-graph containing as a subgraph. In this paper, we determine the value of for sufficiently large n, which generalizes a conjecture due to Erd?s, Jacobson and Lehel. 相似文献
10.
We prove that an analytic function f on the unit ball B with Hadamard gaps, that is, (the homogeneous polynomial expansion of f) satisfying nk+1/nk?λ>1 for all k∈N, belongs to the space if and only if . Moreover, we show that the following asymptotic relation holds . Also we prove that limr→1(1-r2)α‖Rfr‖p=0 if and only if . These results confirm two conjectures from the following recent paper [S. Stevi?, On Bloch-type functions with Hadamard gaps, Abstr. Appl. Anal. 2007 (2007) 8 pages (Article ID 39176)]. 相似文献
11.
Takao Satoh 《Journal of Pure and Applied Algebra》2006,204(2):334-348
The automorphism group and outer automorphism group of a free group Fn of rank n act on the abelianized group H of Fn and the dual group H* of H. The twisted first homology groups of and with coefficients in H and H* are calculated. 相似文献
12.
Hua Wang 《Journal of Mathematical Analysis and Applications》2011,381(1):134-145
In this paper, by using the atomic decomposition and molecular characterization of the homogeneous and non-homogeneous weighted Herz-type Hardy spaces , we obtain some weighted boundedness properties of the Bochner-Riesz operator and the maximal Bochner-Riesz operator on these spaces for α=n(1/p−1/q), 0<p?1 and 1<q<∞. 相似文献
13.
Jin-Xin Zhou 《Discrete Mathematics》2010,310(12):1725-2267
A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and Gv the stabilizer of a vertex v∈V(X) in G. If X has valency 5 and Gv is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that Gv is isomorphic to the cyclic group Z5, the dihedral group D10 or the dihedral group D20 for s=1, the Frobenius group F20 or F20×Z2 for s=2, or F20×Z4 for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and . 相似文献
14.
Gustav Nordh 《Discrete Applied Mathematics》2010,158(8):964-966
The purpose of this note is to give upper bounds (assuming different from ) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi-Skolem sequences and generalized Skolem sequences are strongly -complete. These results are significant strengthenings and simplifications of the recent -completeness result for generalized multi-Skolem sequences. 相似文献
15.
The existence of graph designs for the two nonisomorphic graphs on five vertices and eight edges is determined in the case of index one, with three possible exceptions in total. It is established that for the unique graph with vertex sequence (3, 3, 3, 3, 4), a graph design of order n exists exactly when and n≠16, with the possible exception of n=48. For the unique graph with vertex sequence (2,3,3,4,4), a graph design of order n exists exactly when , with the possible exceptions of n∈{32,48}. 相似文献
16.
Let −L be the Laplacian. In this paper, we prove that on a compact Lie group G of dimension n, the multiplier operator , s∈(0,1], extends to a bounded operator on the Hardy space Hp(G), 0<p<∞, if and only if . The result is an analogue of a well-known theorem in Euclidean space. 相似文献
17.
18.
Andrew Bakan 《Journal of Mathematical Analysis and Applications》2008,339(1):197-216
For the sets , 1?p<∞, of positive finite Borel measures μ on the real axis with the set of algebraic polynomials P dense in Lp(R,dμ), we establish a majorization principle of their “boundaries,” i.e. for every there exists such that dμ/dν?1. A corresponding principle holds for the sets , p>0, of non-negative upper semi-continuous on R functions (weights) w such that P is dense in the space : For every there exists such that w?ω. 相似文献
19.
Sachin Gautam Ashish Kumar Srivastava Amitabha Tripathi 《Discrete Applied Mathematics》2008,156(12):2423-2428
Given graphs , where k≥2, the notation
20.
We show that the absolute numerical index of the space Lp(μ) is (where ). In other words, we prove that