首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 140 毫秒
1.
§ 1 IntroductionLet V(G) and E(G) be the vertex setand the edge setof a graph G,respectively.Fori=1 ,...,p,if V(Gi) V(G) ,E(Gi)∩ E(Gj) = for i≠ j,and∪pi=1 E(Gi) =E(G) ,then wecall{ G1 ,...,GP} a decomposition of G.Let[i,j] be the integer interval including i and j.Let Knbe a complete graph with the vertex set[1 ,n] .For m disjointsubsets A1 ,...Amof[1 ,n] ,let K(A1 ,...,Am) be a complete m-partite graph having partite-sets A1 ,...,Am.If| Ai| =1 ,Ai is called a S-set;otherwi…  相似文献   

2.
§ 1 IntroductionLet F be a field,F[λ] be the polynomial ring over F,Fm× n( or Fm× n[λ] ) be the setofall m×n matrices over F( or F[λ] ) .Let M(i) be the ith column of M∈Fm× m[λ] ,i=1 ,...,n.A g-inverse of M∈Fm× n will be denoted by M- and understood as a matrix for whichMM- M=M.In this paper,we discuss the linear matrix equation ki=0Ai XBi =C, ( 1 )where A∈Fm× m,Bi∈Fn× q,i=0 ,1 ,...,k,and C∈Fm× q.Equation( 1 ) is called universally solvable if ithas a solution f…  相似文献   

3.
Let G be the finite cyclic group Z_2 and V be a vector space of dimension 2n with basis x_1,...,x_n,y_1,...,y_n over the field F with characteristic 2.If σ denotes a generator of G,we may assume that σ(x_i)= ayi,σ(y_i)= a~-1x_i,where a ∈ F.In this paper,we describe the explicit generator of the ring of modular vector invariants of F[V]~G.We prove that F[V]~G = F[l_i = x_i + ay_i,q_i = x_iy_i,1 ≤ i ≤ n,M_I = X_I + a~-I-Y_I],where I∈An = {1,2,...,n},2 ≤-I-≤ n.  相似文献   

4.
An invariant σ2(G) of a graph is defined as follows: σ2(G) := min{d(u) + d(v)|u, v ∈V(G),uv ∈ E(G),u ≠ v} is the minimum degree sum of nonadjacent vertices (when G is a complete graph, we define σ2(G) = ∞). Let k, s be integers with k ≥ 2 and s ≥ 4, G be a graph of order n sufficiently large compared with s and k. We show that if σ2(G) ≥ n + k- 1, then for any set of k independent vertices v1,..., vk, G has k vertex-disjoint cycles C1,..., Ck such that |Ci| ≤ s and vi ∈ V(Ci) for all 1 ≤ i ≤ k.
The condition of degree sum σs(G) ≥ n + k - 1 is sharp.  相似文献   

5.
刘颖  马红平  苗正科 《东北数学》2008,24(4):311-318
For a symmetric sign pattern S1 the inertia set of S is defined to be the set of all ordered triples si(S) = {i(A) : A = A^T ∈ Q(S)} Consider the n × n sign pattern Sn, where Sn is the pattern with zero entry (i,j) for 1 ≤ i = j ≤ n or|i -j|=n- 1 and positive entry otherwise. In this paper, it is proved that si(Sn) = {(n1, n2, n - n1 - n2)|n1≥ 1 and n2 ≥ 2} for n ≥ 4.  相似文献   

6.
Let G(V, E) be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V(Cm). The G - E(Cm) are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui : i = 1, 2 , m}. Let κ = ec+1. Forj = 1,2,...,k- 1, let δij = max{dv : dist(v, ui) = j,v ∈ Ti}, δj = max{δij : i = 1, 2,..., m}, δ0 = max{dui : ui ∈ V(Cm)}. Then λ1(G)≤max{max 2≤j≤k-2 (√δj-1-1+√δj-1),2+√δ0-2,√δ0-2+√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 (G) is the largest eigenvalue of the adjacency matrix of G.  相似文献   

7.
Let{Xn;n≥1}be a sequence of i.i.d, random variables with finite variance,Q(n)be the related R/S statistics. It is proved that lim ε↓0 ε^2 ∑n=1 ^8 n log n/1 P{Q(n)≥ε√2n log log n}=2/1 EY^2,where Y=sup0≤t≤1B(t)-inf0≤t≤sB(t),and B(t) is a Brownian bridge.  相似文献   

8.
Several Results on Systems of Residue Classes   总被引:2,自引:0,他引:2  
Let (m,n) and a(n) denote the g.c.d, of m, n and the residue class {x∈Z∶x≡α (mod n)} respectively. Any period of the characteristic function ofkU a_i(n_i) is called a covering period of {a_i(n_i)}_(i-1)~k.i-ITheorem Let A = {a_i(n_i)}_(i-1)~k. be a disjoint system (i. e. a_I(n_I,...,a_k(n_k) are pairwise disjoint). Let [n_I,...,n_k] (the I.c.m. of n_1,...,n_k) have the prime faetorization [n_1,...,n_k] = Πp_i~ai and T = Πp_iβi(β_i≥0 be the smallest positive covering period of A. Then  相似文献   

9.
Let L^2([0, 1], x) be the space of the real valued, measurable, square summable functions on [0, 1] with weight x, and let n be the subspace of L2([0, 1], x) defined by a linear combination of Jo(μkX), where Jo is the Bessel function of order 0 and {μk} is the strictly increasing sequence of all positive zeros of Jo. For f ∈ L^2([0, 1], x), let E(f, n) be the error of the best L2([0, 1], x), i.e., approximation of f by elements of n. The shift operator off at point x ∈[0, 1] with step t ∈[0, 1] is defined by T(t)f(x)=1/π∫0^π f(√x^2 +t^2-2xtcosO)dθ The differences (I- T(t))^r/2f = ∑j=0^∞(-1)^j(j^r/2)T^j(t)f of order r ∈ (0, ∞) and the L^2([0, 1],x)- modulus of continuity ωr(f,τ) = sup{||(I- T(t))^r/2f||:0≤ t ≤τ] of order r are defined in the standard way, where T^0(t) = I is the identity operator. In this paper, we establish the sharp Jackson inequality between E(f, n) and ωr(f, τ) for some cases of r and τ. More precisely, we will find the smallest constant n(τ, r) which depends only on n, r, and % such that the inequality E(f, n)≤ n(τ, r)ωr(f, τ) is valid.  相似文献   

10.
In this paper,a two-stage semi-hybrid flowshop problem which appears in graphics processing is studied. For this problem, there are two machines M1 and M2, and a set of independent jobs J= {J1 ,J2 ,…,Jn }. Each Ji consists of two tasks Ai and Bi ,and task Ai must be completed before task Bi can start. Furthermore ,task Ai can be processed on M1 for ai time units ,or on Mw for ai^J time units ,while task Bi can only be processed on M2 for bi time units. Jobs and machines are available at time zero and no preemption is allowed. The objective is to minimize the maximum job completion time. It is showed that this problem is NP-hard. And a pseudo-polynomial time optimal algorithm is presented. A polynomial time approximation algorithm with worst-case ratio 2 is also presented.  相似文献   

11.
Given a continuous semimartingale M = (Mt)t≥〉0 and a d-dimensional continuous process of locally bounded variation V = (V^1,……, V^d), the multidimensional Ito Formula states that f(Mt, Vt) - f(M0, V0) = ∫[0, t] Dx0f(Ms, Vs)dMs+∑i=1^d∫[0, t] Dxi F(Ms, Vs)dVs^i+1/2∫[0, t] Dx0^2 f(Ms, Vs)d 〈M〉s if f(x0,……,xd) is of C^2-type with respect to x0 and of C^1-type with respect to the other arguments This formula is very useful when solving various optimal stopping problems based on Brownian motion. However, in such application the function f typically fails to satisfy the stated conditions in that its first partial derivative with respect to x0 is only absolutely continuous. We prove that the formula remains true for such functions and demonstrate its use with two examples from Mathematical Finance.  相似文献   

12.
In this paper, we discuss the moving-average process Xk = ∑i=-∞ ^∞ ai+kεi, where {εi;-∞ 〈 i 〈 ∞} is a doubly infinite sequence of identically distributed ψ-mixing or negatively associated random variables with mean zeros and finite variances, {ai;-∞ 〈 i 〈 -∞) is an absolutely solutely summable sequence of real numbers.  相似文献   

13.
Let D be an increasing sequence of positive integers, and consider the divisor functions: d(n, D) =∑d|n,d∈D,d≤√n1, d2(n,D)=∑[d,δ]|n,d,δ∈D,[d,δ]≤√n1, where [d,δ]=1.c.m.(d,δ). A probabilistic argument is introduced to evaluate the series ∑n=1^∞and(n,D) and ∑n=1^∞and2(n,D).  相似文献   

14.
In this paper, we prove that the maximal operatorsatisfiesis homogeneous of degree 0, has vanishing moment up to order M and satisfies Lq-Dini condition for some  相似文献   

15.
Some oscillation theorems are given for the nonlinear second order elliptic equationsum from i,j=1 to N D_i[a_(ij)(x)Ψ(y)||▽y||~(p-2)D_(jy)] c(x)f(y)=0.The results are extensions of modified Riccati techniques and include recent results of Usami.  相似文献   

16.
Estimates for deviations are established for a large class of linear methods of approximation of periodic functions by linear combinations of moduli of continuity of different orders. These estimates are sharp in the sense of constants in the uniform and integral metrics. In particular, the following assertion concerning approximation by splines is proved: Suppose that is odd, . Then
moreover, for it is impossible to decrease the constants on . Here, are some explicitly constructed constants, is the modulus of continuity of order r for the function f, and are explicitly constructed linear operators with the values in the space of periodic splines of degree of minimal defect with 2n equidistant interpolation points. This assertion implies the sharp Jackson-type inequality
. Bibliography: 17 titles.  相似文献   

17.
We establish the existence of fundamental solutions for the anisotropic porous medium equation, ut = ∑n i=1(u^mi)xixi in R^n × (O,∞), where m1,m2,..., and mn, are positive constants satisfying min1≤i≤n{mi}≤ 1, ∑i^n=1 mi 〉 n - 2, and max1≤i≤n{mi} ≤1/n(2 + ∑i^n=1 mi).  相似文献   

18.
In this paper, we establish the generalized Hyers–Ulam–Rassias stability of C*-ternary ring homomorphisms associated to the Trif functional equation
  相似文献   

19.
For an integer m ≥ 4, we define a set of 2[m/2] × 2[m/2] matrices γj (m), (j = 0, 1,..., m - 1) which satisfy γj (m)γk (m) +γk (m)γj (m) = 2ηjk (m)I[m/2], where (ηjk (m)) 0≤j,k≤m-1 is a diagonal matrix, the first diagonal element of which is 1 and the others are -1, I[m/2] is a 2[m/1] × 2[m/2] identity matrix with [m/2] being the integer part of m/2. For m = 4 and 5, the representation (m) of the Lorentz Spin group is known. For m≥ 6, we prove that (i) when m = 2n, (n ≥ 3), (m) is the group generated by the set of matrices {T|T=1/√ξ((I+k) 0 + 0 I-K) ( U 0 0 U), (ii) when m = 2n + 1 (n≥ 3), (m) is generated by the set of matrices {T|T=1/√ξ(I -k^- k I)U,U∈ (m-1),ξ=1-m-2 ∑k,j=0 ηkja^k a^j〉0, K=i[m-3 ∑j=0 a^j γj(m-2)+a^(m-2) In],K^-=i[m-3∑j=0 a^j γj(m-2)-a^(m-2) In]}  相似文献   

20.
Remarks on the Extremal Functions for the Moser-Trudinger Inequality   总被引:1,自引:0,他引:1  
We will show in this paper that if A is very close to 1, then I(M,λ,m) =supu∈H0^1,n(m),∫m|△↓u|^ndV=1∫Ω(e^αn|u|^n/(n-1)-λm∑k=1|αnun/(n-1)|k/k!)dV can be attained, where M is a compact-manifold with boundary. This result gives a counter-example to the conjecture of de Figueiredo and Ruf in their paper titled "On an inequality by Trudinger and Moser and related elliptic equations" (Comm. Pure. Appl. Math., 55, 135-152, 2002).  相似文献   

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

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