首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 359 毫秒
1.
Packings of the complete directed graph with m-circuits   总被引:2,自引:0,他引:2  
A packing of the complete directed symmetric graph DKv with m-circuits, denoted by(v,m)-DCP, is defined to he a family of are-disjoint m-circuits of DK, such that any one arc of DKv occurs in at most one m circuit. The packing number P(v,m) is the maximum number of m-circults in such a packing. The packing problem is to determine the value P(v,m) for everyinteger v ≥ m. In this paper, the problem is reduced to the case m 6 ≤v≤2m-[(4m-3的平方极) 1/2],for any fixed even integer m≥4,In particular,the values of P(v,m) are completely determined for m=12,14 and 16.  相似文献   

2.
The adaptive regularization method is first proposed by Ryzhikov et al. in [6] for the deconvolution in elimination of multiples which appear frequently in geoscience and remote sensing. They have done experiments to show that this method is very effective. This method is better than the Tikhonov regularization in the sense that it is adaptive, i.e., it automatically eliminates the small eigenvalues of the operator when the operator is near singular. In this paper, we give theoretical analysis about the adaptive regularization. We introduce an a priori strategy and an a posteriori strategy for choosing the regularization parameter, and prove regularities of the adaptive regularization for both strategies. For the former, we show that the order of the convergence rate can approach O(||n||^4v/4v+1) for some 0 〈 v 〈 1, while for the latter, the order of the convergence rate can be at most O(||n||^2v/2v+1) for some 0 〈 v 〈 1.  相似文献   

3.
A Latin squares of order v with ni missing sub-Latin squares (holes) of order hi (1 〈= i 〈 k), which are disjoint and spanning (i.e. ∑k i=l1 nihi = v), is called a partitioned incomplete Latin squares and denoted by PILS. The type of PILS is defined by (h1n1 h2n2…hknk ). If any two PILS inaset of t PILS of type T are orthogonal, then we denote the set by t-HMOLS(T). It has been proved that 3-HMOLS(2n31) exist for n ≥6 with 11 possible exceptions. In this paper, we investigate the existence of 3-HMOLS(2nu1) with u ≥ 4, and prove that 3-HMOLS(2~u1) exist if n ≥ 54 and n ≥7/4u + 7.  相似文献   

4.
An m-cycle system of order v and index λ, denoted by m-CS(v,λ), is a collection of cycles of length m whose edges partition the edges of λKv. An m-CS(v,λ) is α-resolvable if its cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a design are m|λv(v-1)/2,2|λ(v -1),m|αv,α|λ(v-1)/2. It is shown in this paper that these conditions are also sufficient when m = 4.  相似文献   

5.
In this paper, we study how the shape of the graph of a(z) affects on the number of positive solutions of -△v+μb(z)v=a(z)vp-1+λh(z)vq-1,inRN.(0.1) We prove for large enough λ,μ〉 0, there exist at least k+ 1 positive solutions of the this semilinear elliptic equations where 1 ≤ q 〈 2 〈 p 〈 2* = 2N/(N-2) forN ≥ 3.  相似文献   

6.
The spectrum of path factorization of bipartite multigraphs   总被引:1,自引:0,他引:1  
LetλK_(m,n)be a bipartite multigraph with two partite sets having m and n vertices, respectively.A P_v-factorization ofλK_(m,n)is a set of edge-disjoint P_v-factors ofλK_(m,n)which partition the set of edges ofλK_(m,n).When v is an even number,Ushio,Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P_v-factorization ofλK_(m,n).When v is an odd number,we have proposed a conjecture.Very recently,we have proved that the conjecture is true when v=4k-1.In this paper we shall show that the conjecture is true when v = 4k 1,and then the conjecture is true.That is,we will prove that the necessary and sufficient conditions for the existence of a P_(4k 1)-factorization ofλK_(m,n)are(1)2km≤(2k 1)n,(2)2kn≤(2k 1)m,(3)m n≡0(mod 4k 1),(4)λ(4k 1)mn/[4k(m n)]is an integer.  相似文献   

7.
Let Ф(u ×v, k, Aa, Ac) be the largest possible number of codewords among all two- dimensional (u ×v, k, λa, λc) optical orthogonal codes. A 2-D (u× v, k, λa, λ)-OOC with Ф(u× v, k, λa, λc) codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D (u × v, 4, 1, 3)-OOC has been determined.  相似文献   

8.
For a connected simple graph G, the eccentricity ec(v) of a vertex v in G is the distance from v to a vertex farthest from v, and d(v) denotes the degree of a vertex v. The eccentric connectivity index of G, denoted by ξc(G), is defined as v∈V(G)d(v)ec(v). In this paper, we will determine the graphs with maximal eccentric connectivity index among the connected graphs with n vertices and m edges(n ≤ m ≤ n + 4), and propose a conjecture on the graphs with maximal eccentric connectivity index among the connected graphs with n vertices and m edges(m ≥ n + 5).  相似文献   

9.
The existence of even cycles with specific lengths in Wenger’s graph   总被引:1,自引:0,他引:1  
Wenger's graph Hm(q) is a q-regular bipartite graph of order 2qm constructed by using the mdimensional vector space Fq^m over the finite field Fq. The existence of the cycles of certain even length plays an important role in the study of the accurate order of the Turan number ex(n; C2m) in extremal graph theory. In this paper, we use the algebraic methods of linear system of equations over the finite field and the “critical zero-sum sequences” to show that: if m ≥ 3, then for any integer l with l ≠ 5, 4 ≤ l ≤ 2ch(Fq) (where ch(Fq) is the character of the finite field Fq) and any vertex v in the Wenger's graph Hm(q), there is a cycle of length 21 in Hm(q) passing through the vertex v.  相似文献   

10.
The main purpose of this article is to establish an effective version of the Grunwald-Wang theorem,which asserts that given a family of local characters χvof K *vof exponent m, where v ∈ S for a finite set S of primes of K, there exists a global character χ of the idele class group CK of exponent m(unless some special case occurs, when it is 2m) whose local component at v is χv. The effectiveness problem for this theorem is to bound the norm N(χ) of the conductor of χ in terms of K, m, S and N(χv)(v ∈ S). The Kummer case(when K contains μm) is easy since it is almost an application of the Chinese remainder theorem. In this paper, we solve this problem completely in general case, and give three versions of bound, one is with GRH, and the other two are unconditional bounds. These effective results have some interesting applications in concrete situations. To give a simple example, if we fix p and l, one gets a good least upper bound for N such that p is not an l-th power mod N. One also gets the least upper bound for N such that lr| φ(N) and p is not an l-th power mod N.Some part of this article is adopted(with some revision) from the unpublished thesis by Wang(2001).  相似文献   

11.
Let z α and t ν,α denote the upper 100α% points of a standard normal and a Student’s t ν distributions respectively. It is well-known that for every fixed $0<\alpha <\frac{1}{2}$ and degree of freedom ν, one has t ν,α ?>?z α and that t ν,α monotonically decreases to z α as ν increases. Recently, Mukhopadhyay (Methodol Comput Appl Probab, 2009) found a new and explicit expression b ν (?>?1) such that t ν,α ?>?b ν z α for every fixed $0<\alpha <\frac{1}{2}$ and ν. He also showed that b ν converges to 1 as ν increases. In this short note, we prove three key results: (i) $\log(b_{\nu+1}/b_{\nu})\sim -\frac{1}{4}\nu^{-2}$ for large enough ν, (ii) b ν strictly decreases as ν increases, and (iii) $b_{\nu}\sim 1+\frac14\nu^{-1}+\frac1{32}\nu^{-2}$ for large enough ν.  相似文献   

12.
Let $\left\{ X,X_{i},i=1,2,...\right\} $ denote independent positive random variables having common distribution function (d.f.) F(x) and, independent of X, let ν denote an integer valued random variable. Using X 0=0, the random sum Z=∑ i=0 ν X i has d.f. $G(x)=\sum_{n=0}^{\infty }\Pr\{\nu =n\}F^{n\ast }(x)$ where F n?(x) denotes the n-fold convolution of F with itself. If F is subexponential, Kesten’s bound states that for each ε>0 we can find a constant K such that the inequality $$ 1-F^{n\ast }(x)\leq K(1+\varepsilon )^{n}(1-F(x))\, , \qquad n\geq 1,x\geq 0 \, , $$ holds. When F is subexponential and E(1 +ε) ν <∞, it is a standard result in risk theory that G(x) satisfies $$ 1 - G{\left( x \right)} \sim E{\left( \nu \right)}{\left( {1 - F{\left( x \right)}} \right)},\,\,x \to \infty \,\,{\left( * \right)} $$ In this paper, we show that (*) holds under weaker assumptions on ν and under stronger conditions on F. Stam (Adv. Appl. Prob. 5:308–327, 1973) considered the case where $ \overline{F}(x)=1-F(x)$ is regularly varying with index –α. He proved that if α>1 and $E{\left( {\nu ^{{\alpha + \varepsilon }} } \right)} < \infty $ , then relation (*) holds. For 0<α<1, it is sufficient that Eν<∞. In this paper we consider the case where $\overline{F}(x)$ is an O-regularly varying subexponential function. If the lower Matuszewska index $\beta (\overline{F})<-1$ , then the condition ${\text{E}}{\left( {\nu ^{{{\left| {\beta {\left( {\overline{F} } \right)}} \right|} + 1 + \varepsilon }} } \right)} < \infty$ is sufficient for (*). If $\beta (\overline{F} )>-1$ , then again Eν<∞ is sufficient. The proofs of the results rely on deriving bounds for the ratio $\overline{F^{n\ast }}(x)/\overline{F} (x)$ . In the paper, we also consider (*) in the special case where X is a positive stable random variable or has a compound Poisson distribution derived from such a random variable and, in this case, we show that for n≥2, the ratio $\overline{F^{n\ast }}(x)/\overline{F}(x)\uparrow n$ as x↑∞. In Section 3 of the paper, we briefly discuss an extension of Kesten’s inequality. In the final section of the paper, we discuss a multivariate analogue of (*).  相似文献   

13.
A closed-form formula is derived for the generalized Clebsch–Gordan integral \(\int_{-1}^{1} {[}P_{\nu}(x){]}^{2}P_{\nu}(-x)\,\mathrm {d}x\) , with P ν being the Legendre function of arbitrary complex degree \(\nu\in\mathbb{C}\) . The finite Hilbert transform of P ν (x)P ν (?x), ?1<x<1 is evaluated. An analytic proof is provided for a recently conjectured identity \(\int_{0}^{1}[\mathbf{K}( \sqrt{1-k^{2}} )]^{3}\,\mathrm {d}k=6\int_{0}^{1}[\mathbf{K}(k)]^{2}\mathbf{K}( \sqrt{1-k^{2}} )k\,\mathrm {d}k=[\Gamma (\frac{1}{4})]^{8}/(128\pi^{2}) \) involving complete elliptic integrals of the first kind K(k) and Euler’s gamma function Γ(z).  相似文献   

14.
Let ${\Omega\subset\mathbb{R}^n}$ be a bounded domain, and let 1 < p < ∞ and σ < p. We study the nonlinear singular integral equation $$ M[u](x) = f_0(x)\quad {\rm in}\,\Omega$$ with the boundary condition u = g 0 on ?Ω, where ${f_0\in C(\overline\Omega)}$ and ${g_0\in C(\partial\Omega)}$ are given functions and M is the singular integral operator given by $$M[u](x)={\rm p.v.} \int\limits_{B(0,\rho(x))} \frac{p-\sigma}{|z|^{n+\sigma}}|u(x+z)-u(x)|^{p-2} (u(x+z)-u(x))\,{\rm dz},$$ with some choice of ${\rho\in C(\overline\Omega)}$ having the property, 0 < ρ(x) ≤ dist (x, ?Ω). We establish the solvability (well-posedness) of this Dirichlet problem and the convergence uniform on ${\overline\Omega}$ , as σp, of the solution u σ of the Dirichlet problem to the solution u of the Dirichlet problem for the p-Laplace equation νΔ p u = f 0 in Ω with the Dirichlet condition u = g 0 on ?Ω, where the factor ν is a positive constant (see (7.2)).  相似文献   

15.
Let Fq be a finite field of odd characteristic, m, ν the integers with 1≤m≤ν and Ka 2ν× 2ν nonsingular alternate matrix over Fq. In this paper, the generalized symplectic graph GSp2ν (q, m) relative to K over Fq is introduced. It is the graph with m-dimensional totally isotropic subspaces of the 2ν-dimensional symplectic space F(2ν)q as its vertices and two vertices P and Q are adjacent if and only if the rank of PKQT is 1 and the dimension of P ∩ Q is m-1. It is proved that the full automorphism group of the graph GSp2ν(q, m) is the projective semilinear symplectic group PΣp(2ν, q).  相似文献   

16.
By using the steepest descent method for Riemann–Hilbert problems introduced by Deift–Zhou (Ann Math 137:295–370, 1993), we derive two asymptotic expansions for the scaled Laguerre polynomial $L^{(\alpha)}_n(\nu z)$ as n→∞, where ν=4n+2α+2. One expansion holds uniformly in a right half-plane $\text{Re}\; z\geq \delta_1, 0<\delta_1<1$ , which contains the critical point z=1; the other expansion holds uniformly in a left half-plane $\text{Re}\; z\leq 1-\delta_2, 0<\delta_2<1-\delta_1$ , which contains the other critical point z=0. The two half-planes together cover the entire complex z-plane. The critical points z=1 and z=0 correspond, respectively, to the turning point and the singularity of the differential equation satisfied by $L^{(\alpha)}_n(\nu z)$ .  相似文献   

17.
LetX be a complex manifold of dimensionn≥3. Let Ω1, Ω2 be two open pseudoconvex submanifolds with smooth boundary such that Ω1 ? Ω2 ?X . Let Ω = Ω2 \ $\overline \Omega_1 $ . Assume thatbΩ1 andbΩ1 satisfy Catlin's condition (P). Then the compactness estimate for (p, q)-forms with 0<q<n?1 holds for the $\overline \partial$ -Neumann problem on Ω. This result implies that given a $\overline \partial$ -closed (p, q)-form α with 0<q<n?1, which isC on $\overline \Omega$ and which is cohomologous to zero on Ω, the canonical solutionu of the equation $\overline \partial$ u=α is smooth on $\overline \Omega$ .  相似文献   

18.
In this note we demonstrate that if y(t) ≥ 0, for each t in the domain of ${t \mapsto y(t)}$ , and if, in addition, ${\Delta_0^{\nu}y(t) \geq 0}$ , for each t in the domain of ${t \mapsto \Delta_0^{\nu}y(t)}$ , with 1 < ν < 2, then it holds that y is an increasing function of t. This demonstrates that, in some sense, the positivity of the νth order fractional difference has a strong connection to the monotonicity of y. Furthermore, we provide a dual result in case ${\Delta_0^{\nu}y(t) \leq 0}$ and y is nonpositive on its domain. We conclude the note by mentioning some implications of these results.  相似文献   

19.
We study the random Fibonacci sequences defined by ${F_1 = F_2 = \widetilde F_1 = \widetilde F_2 = 1}$ and for n ≥ 1, F n+2 = F n+1 ± F n (linear case) and ${\widetilde F_{n+2} = |\widetilde F_{n+1} \pm \widetilde F_{n}|}$ (non-linear case), where each ± sign is independent and either + with probability p or ? with probability 1 ? p (0 < p ≤ 1). Our main result is that the exponential growth of F n for 0 < p ≤ 1, and of ${\widetilde F_{n}}$ for 1/3 ≤ p ≤ 1 is almost surely given by $${\int \limits _0^\infty \log x\, d\nu_\alpha (x),}$$ where α is an explicit function of p depending on the case we consider, and ν α is an explicit probability distribution on ${\mathbb{R}_+}$ defined inductively on Stern–Brocot intervals. In the non-linear case, the largest Lyapunov exponent is not an analytic function of p, since we prove that it is equal to zero for 0 < p ≤ 1/3. We also give some results about the variations of the largest Lyapunov exponent, and provide a formula for its derivative.  相似文献   

20.
Letf εC[?1, 1], ?1<α,β≤0, let $f \in C[ - 1, 1], - 1< \alpha , \beta \leqslant 0$ , letS n α, β (f, x) be a partial Fourier-Jacobi sum of ordern, and let $$\nu _{m, n}^{\alpha , \beta } = \nu _{m, n}^{\alpha , \beta } (f) = \nu _{m, n}^{\alpha , \beta } (f,x) = \frac{1}{{n + 1}}[S_m^{\alpha ,\beta } (f,x) + ... + S_{m + n}^{\alpha ,\beta } (f,x)]$$ be the Vallée-Poussin means for Fourier-Jacobi sums. It was proved that if 0<a≤m/n≤b, then there exists a constantc=c(α, β, a, b) such that ‖ν m, n α, β ‖ ≤c, where ‖ν m, n α, β ‖ is the norm of the operator ν m, n α, β inC[?1,1].  相似文献   

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

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