VERTEX-FAULT-TOLERANT CYCLES EMBEDDING ON ENHANCED HYPERCUBE NETWORKS

In this paper, we study the enhanced hypercube, an attractive variant of the hypercube and obtained by adding some complementary edges from a hypercube, and focus on cycles embedding on the enhanced hypercube with faulty vertices. Let Fu be the set of faulty vertices in the n-dimensional enhanced hypercube Qn,k （n ≥ 3, 1 ≤ k 〈≤n - 1）. When IFvl = 2, we showed that Qn,k - Fv contains a fault-free cycle of every even length from 4 to 2n - 4 where n （n ≥ 3） and k have the same parity; and contains a fault-free cycle of every even length from 4 to 2n - 4, simultaneously, contains a cycle of every odd length from n-k ＋ 2 to 2^n-3 where n （≥ 3） and k have the different parity. Furthermore, when ｜Fv｜ = fv ≤ n - 2, we prove that there exists the longest fault-free cycle, which is of even length 2^n - 2fv whether n （n ≥ 3） and k have the same parity or not; and there exists the longest fault-free cycle, which is of odd length 2^n - 2fv ＋ 1 in Qn,k - Fv where n （≥ 3） and k have the different parity.     

由圈长分布确定的二部图~$K_{n,n r}-A\ (|A|\leq 3)$

The cycle length distribution of a graph G of order n is a sequence （c1 （G）,…, cn （G））, where ci （G） is the number of cycles of length i in G. In general, the graphs with cycle length distribution （c1（G） ,…,cn（G）） are not unique. A graph G is determined by its cycle length distribution if the graph with cycle length distribution （c1 （G）,…, cn （G）） is unique. Let Kn,n＋r be a complete bipartite graph and A lohtaib in E（Kn,n＋r）. In this paper, we obtain： Let s 〉 1 be an integer. （1） If r = 2s, n 〉 s（s - 1） ＋ 2｜A｜, then Kn,n＋r - A （A lohtain in E（Kn,n＋r）,｜A｜ ≤ 3） is determined by its cycle length distribution; （2） If r = 2s ＋ 1,n 〉 s^2 ＋ 2｜A｜, Kn,n＋r - A （A lohtain in E（Kn,n＋r）, ｜A｜ ≤3） is determined by its cycle length distribution.     

Generalization for Laplacian energy

Let G be a simple graph with n vertices and m edges. Let λ1, λ2,…, λn, be the adjacency spectrum of G, and let μ1, μ2,…, μn be the Laplacian spectrum of G. The energy of G is E（G） = n∑i=1｜λi｜, while the Laplacian energy of G is defined as LE（G） = n∑i=1｜μi-2m/n｜ Let γ1, γ2, ~ …, γn be the eigenvalues of Hermite matrix A. The energy of Hermite matrix as HE（A） = n∑i=1｜γi-tr（A）/n｜ is defined and investigated in this paper. It is a natural generalization of E（G） and LE（G）. Thus all properties about energy in unity can be handled by HE（A）.     

Minor and minimum cycle bases of a 3-connected planar graph

In this paper, we prove that if any set of ｜E（G）｜- ｜V（G）｜ ＋ 1 facial cycles of a 3-connected planar graph G embedded in the plane doesn＇t form a minimum cycle base of G, then any minimum cycle base of G contains a separating cycle, and G has a minor isomorphic to T6, where T6 is the graph obtained from the complete graph K6 by deleting a path with four edges.     

A Covering Lemma on the Unit Sphere and Application to the Fourier-Laplace Convergence

A covering lemma on the unit sphere is established and then is applied to establish an almost everywhere convergence test of Marcinkiewicz type for the Fourier-Laplace series on the unit sphere which can be stated as follows： Theorem Suppose f ∈ L（En-1）, n≥ 3. If f satisfies the condition 1/θ^n-1∫D（x,θ）｜f（y）-f（x）｜dy=O（1/｜logθ｜）,as θ→0＋, at every point x in a set E of positive measure in Σn-1, then the Cesàro means of critical order ,n-2/2 of the Fourier-Laplace series of f converge to f at almost every point x in E.     

Bahadur representation of nonparametric M-estimators for spatial processes

Under some mild conditions, we establish a strong Bahadur representation of a general class of nonparametric local linear M-estimators for mixing processes on a random field. If the socalled optimal bandwidth hn = O（｜n｜^-1/5）, n ∈ Z^d, is chosen, then the remainder rates in the Bahadur representation for the local M-estimators of the regression function and its derivative are of order O（｜n｜^-4/5 log ｜n｜）. Moreover, we derive some asymptotic properties for the nonparametric local linear M-estimators as applications of our result.     

On the Number of Limit Cycles in Small Perturbations of a Piecewise Linear Hamiltonian System with a Heteroclinic Loop

In this paper, the authors consider limit cycle bifurcations for a kind of nonsmooth polynomial differential systems by perturbing a piecewise linear Hamiltonian system with a center at the origin and a heteroclinic loop around the origin. When the degree of perturbing polynomial terms is n(n ≥ 1), it is obtained that n limit cycles can appear near the origin and the heteroclinic loop respectively by using the first Melnikov function of piecewise near-Hamiltonian systems, and that there are at most n + [(n+1)/2] limit cycles bifurcating from the periodic annulus between the center and the heteroclinic loop up to the first order in ε. Especially, for n = 1, 2, 3 and 4, a precise result on the maximal number of zeros of the first Melnikov function is derived.     

Coexistence of unbounded solutions and periodic solutions of Liénard equations with asymmetric nonlinearities at resonance

In this paper, we deal with the existence of unbounded orbits of the mapping {θ1 = θ 2nπ 1/ρμ(θ) o(ρ-1),ρ1=ρ c-μ′(θ) o(1), ρ→∞,where n is a positive integer, c is a constant and μ(θ) is a 2π-periodic function. We prove that if c ＞ 0 and μ(θ) ≠ 0, θ∈ [0, 2π], then every orbit of the given mapping goes to infinity in the future for ρ large enough; if c ＜ 0 and μ(θ) ≠ 0, θ∈ [0, 2π], then every orbit of the given mapping goes to infinity in the past for ρ large enough. By using this result, we prove that the equation x″ f(x)x′ ax -bx- φ(x) =p(t) has unbounded solutions provided that a, b satisfy 1/√a 1/√b = 2/n and F(x)(= ∫x0 f(s)ds),and φ(x) satisfies some limit conditions. At the same time, we obtain the existence of 2π-periodic solutions of this equation.     

Exponential sums involving Maass forms

We study the exponential sums involving l：burmr coeffcients ot Maass forms and exponential functions of the form e（anZ）, where 0 ≠ α∈R and 0 〈 β 〈 1. An asymptotic formula is proved for the nonlinear exponential sum ∑x〈n≤2x λg（n）e（αnβ）, when β = 1/2 and ｜α｜ is close to 2√ q C Z＋, where Ag（n） is the normalized n-th Fourier coefficient of a Maass cusp form for SL2 （Z）. The similar natures of the divisor function 7（n） and the representation function r（n） in the circle problem in nonlinear exponential sums of the above type are also studied.     

$\alpha$-可分解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.     

A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING

Recently, computational results demonstrated remarkable superiority of a so-called ＂largest-distance＂ rule and ＂nested pricing＂ rule to other major rules commonly used in practice, such as Dantzig＇s original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient.     

STRONG APPROXIMATION FOR MOVING AVERAGE PROCESSES UNDER DEPENDENCE ASSUMPTIONS

Let {Xt,t ≥ 1} be a moving average process defined by Xt = ∑^∞ k=0 αkξt-k, where {αk,k ≥ 0} is a sequence of real numbers and {ξt,-∞ 〈 t 〈 ∞} is a doubly infinite sequence of strictly stationary dependent random variables. Under the conditions of {αk, k ≥ 0} which entail that {Xt, t ≥ 1} is either a long memory process or a linear process, the strong approximation of {Xt, t ≥ 1} to a Gaussian process is studied. Finally, the results are applied to obtain the strong approximation of a long memory process to a fractional Brownian motion and the laws of the iterated logarithm for moving average processes.     

On Universally Left-stability of ε-Isometry

LetX,Y be two real Banach spaces andε≥0.A map f:X→Y is said to be a standardε-isometry if|f(x)f(y)x y|≤εfor all x,y∈X and with f(0)=0.We say that a pair of Banach spaces(X,Y)is stable if there existsγ0 such that,for every suchεand every standardε-isometry f:X→Y,there is a bounded linear operator T:L(f)≡spanf(X)→X so that T f(x)x≤γεfor all x∈X.X(Y)is said to be universally left-stable if(X,Y)is always stable for every Y(X).In this paper,we show that if a dual Banach space X is universally left-stable,then it is isometric to a complemented w-closed subspace of∞(Γ)for some setΓ,hence,an injective space;and that a Banach space is universally left-stable if and only if it is a cardinality injective space;and universally left-stability spaces are invariant.     

NONLINEAR RANK-ONE MODIFICATION OF THE SYMMETRIC EIGENVALUE PROBLEM

Nonlinear rank-one modification of the symmetric eigenvalue problem arises from eigenvibrations of mechanical structures with elastically attached loads and calculation of the propagation modes in optical fiber. In this paper, we first study the existence and uniqueness of eigenvalues, and then investigate three numerical algorithms, namely Picard iteration, nonlinear Rayleigh quotient iteration and successive linear approximation method （SLAM）. The global convergence of the SLAM is proven under some mild assumptions. Numerical examples illustrate that the SLAM is the most robust method.     

VARIABLE STEP-SIZE IMPLICIT-EXPLICIT LINEAR MULTISTEP METHODS FOR TIME-DEPENDENT PARTIAL DIFFERENTIAL EQUATIONS

Implicit-explicit （IMEX） linear multistep methods are popular techniques for solving partial differential equations （PDEs） with terms of different types. While fixed timestep versions of such schemes have been developed and studied, implicit-explicit schemes also naturally arise in general situations where the temporal smoothness of the solution changes. In this paper we consider easily implementable variable step-size implicit-explicit （VSIMEX） linear multistep methods for time-dependent PDEs. Families of order-p, pstep VSIMEX schemes are constructed and analyzed, where p ranges from 1 to 4. The corresponding schemes are simple to implement and have the property that they reduce to the classical IMEX schemes whenever constant time step-sizes are imposed. The methods are validated on the Burgers＇ equation. These results demonstrate that by varying the time step-size, VSIMEX methods can outperform their fixed time step counterparts while still maintaining good numerical behavior.     

A NEW PRECONDITIONING STRATEGY FOR SOLVING A CLASS OF TIME-DEPENDENT PDE-CONSTRAINED OPTIMIZATION PROBLEMS

In this paper, by exploiting the special block and sparse structure of the coefficient matrix, we present a new preconditioning strategy for solving large sparse linear systems arising in the time-dependent distributed control problem involving the heat equation with two different functions. First a natural order-reduction is performed, and then the reduced- order linear system of equations is solved by the preconditioned MINRES algorithm with a new preconditioning techniques. The spectral properties of the preconditioned matrix are analyzed. Numerical results demonstrate that the preconditioning strategy for solving the large sparse systems discretized from the time-dependent problems is more effective for a wide range of mesh sizes and the value of the regularization parameter.     

A Gorni-Zampieri Pair of a Homogeneous Polynomial Map

In this paper, we improve the algorithm and rewrite the function make- Pairing for computing a Gorni-Zampieri pair of a homogeneous polynomial map. As an application, some counterexamples to PLDP （dependence problem for power lin- car maps） are obtained, including one in the lowest dimension （n = 48） in all suchcounterexamples one has found up to now.     

Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes

It has become common knowledge that constructing q-ary quantum MDS codes with minimum distance bigger than \(q/2+1\) is significantly more difficult than constructing those with minimum distance less than or equal to \(q/2+1\). Despite of various constructions of q-ary quantum MDS codes, all known q-ary quantum MDS codes have minimum distance bounded by \(q/2+1\) except for some lengths. The purpose of the current paper is to provide some new q-ary quantum MDS codes with minimum distance bigger than \(q/2+1\). In this paper, we provide several classes of quantum MDS codes with minimum distance bigger than \(q/2+1\). For instance, some examples in these classes include q-ary \([n,n-2k, k+1]\)-quantum MDS codes for cases: (i) \(q\equiv -1\bmod {5}, n=(q^2+4)/5\) and \(1\le k\le (3q-2)/5\); (ii) \(q\equiv -1\bmod {7}, n=(q^2+6)/7\) and \(1\le k\le (4q-3)/7\); (iii) \(2|q, q\equiv -1\bmod {3}, n=2(q^2-1)/3\) and \(1\le k\le (2q-1)/3\); and (iv) \(2|q, q\equiv -1\bmod {5}, n=2(q^2-1)/5\) and \(1\le k\le (3q-2)/5\).     

ON CONTRACTION AND SEMI-CONTRACTION FACTORS OF GSOR METHOD FOR AUGMENTED LINEAR SYSTEMS

The generalized successive overrelaxation （GSOR） method was presented and studied by Bai, Parlett and Wang [Numer. Math. 102（2005）, pp.1-38] for solving the augmented system of linear equations, and the optimal iteration parameters and the corresponding optimal convergence factor were exactly obtained. In this paper, we further estimate the contraction and the semi-contraction factors of the GSOR method. The motivation of the study is that the convergence speed of an iteration method is actually decided by the contraction factor but not by the spectral radius in finite-step iteration computations. For the nonsingular augmented linear system, under some restrictions we obtain the contraction domain of the parameters involved, which guarantees that the contraction factor of the GSOR method is less than one. For the singular but consistent augmented linear system, we also obtain the semi-contraction domain of the parameters in a similar fashion. Finally, we use two numerical examples to verify the theoretical results and the effectiveness of the GSOR method.     

On extensions of partial n-quasigroups of order 4

We prove that every collection of pairwise compatible (nowhere coinciding) n-ary quasigroups of order 4 can be extended to an (n + 1)-ary quasigroup. In other words, every Latin 4×??×4 × l-parallelepiped, where l = 1, 2, 3, can be extended to a Latin hypercube.