On the minimal reducible bound for outerplanar and planar graphs

Let L be the set of all additive and hereditary properties of graphs. For P₁, P₂ L we define the reducible property R = P₁ P₂ as follows: G P₁P₂ if there is a bipartition (V₁, V₂) of V(G) such that V₁ P₁ and V₂ P₂. For a property P L, a reducible property R is called a minimal reducible bound for P if P R and for each reducible property R′, R′ R → P R′. It is proved that the class of all outerplanar graphs has exactly two minimal reducible bounds in L. Some related problems for planar graphs are discussed.     

一种新型的N部件串联可修系统及其可靠性分析

本文研究一种Ⅳ部件串联可修系统的一个新模型，该模型在经典。部件串联可修系统中引入了修理工可多重延误休假的概念，并且考虑了修理工使用修理设备在修理失效部件过程中可能因修理设备失效而立即更换修理设备对整个系统可靠性造成的影响,假定修理工的延误休假时间、部件的寿命和修理设备的寿命均服从指数分布，部件的修理时间、修理设备的更换时间和修理工的休假时间均服从一般连续型分布，通过使用补充变量法和广义马尔可夫过程方法得到了系统和修理设备的一些重要可靠性指标．     

On the occupation time of an iterated process having no local time

We study the asymptotic behaviour of the occupation time process ∫^t₀ I_A(W₁(L₂(s)))ds, t 0, where W₁ is a standard Wiener process and L₂ is a Wiener local time process at zero that is independent from W₁. We prove limit laws, as well as almost sure upper and lower class theorems. Possible extensions of the obtained results are also discussed.     

Invariant record processes and applications to best choice modelling

Let X₁, X₂,…be identically distributed random variables from an unknown continuous distribution. Further let I_r(1), I_r(2),…be a sequence of indicator functions defined on X₁, X₂,…by I_r(k) = 0 if k < r, I_r(k) = 1 if X_k is a r-record AND = 0 otherwise. Suppose that we observe X₁, X₂,… at times T₁ < T₂ <… where the T_k's are realisations of some regular counting process (N(τ)) defined on the positive half-line. Having observed [0, τ], say, the problem is to predict the future behaviour of the counting processes (R_r(τ, s))_sτ = # r-records in [τ, s]. More specifically the objective of this paper is to show that these processes can be (inhomogeneous) Poisson processes even if (N(τ))_τ0 has dependent increments.

The strong link between optimal selection and optimal stopping of record sequences or record processes, perhaps not fully recognized so far, is pointed out in this paper. It is shown to lead to a unification of the treatment of problems which, at first sight, are rather different. Moreover the stopping of record processes in continuous time can lead to rigorous and elegant solutions in cases where dynamic programming is bound to fail. Several examples will be given to facilitate a comparison with other methods.     

Neighborhood unions and cyclability of graphs

A graph G is said to be cyclable if for each orientation of G, there exists a set S of vertices such that reversing all the arcs of with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n36. In this paper, we show that if for any three independent vertices x₁, x₂ and x₃, |N(x₁)N(x₂)|+|N(x₂)N(x₃)|+|N(x₃)N(x₁)|2n+1, then G is cyclable.     

两类具有N-策略和单重休假的M/G/1排队系统的最优控制策略

本文考虑两类具有N-策略和服务员单重休假的M/G/1排队系统,其中一类是休假不可中断,另一类是休假可中断。利用系统稳态队长的随机分解特性导出稳态队长的概率母函数,并讨论了系统空闲率与附加平均队长对系统一些参数的敏感性。进一步,在建立费用结构的基础上,应用更新报酬过程理论导出了系统长期运行单位时间内所产生的成本期望费用的显示表达式,同时通过数值计算实例确定了使得系统在长期运行单位时间内所产生的成本期望费用最小的控制策略N^*,以及当休假时间为定长T时的二维最优控制策略（N^*,T^*）。     

Cases of equality for the spectral norm submultiplicativity of the hadamard product

In this note, we characterize those pairs of nonzero r-by-d complex matrices that satisfy N₂(A ∘ B) = N₂(A)N₂(B), in which N₂(·) is the spectral norm and · is the Hadamard product.     

Gowers norms and pseudorandom measures of subsets

Let $A \subset {{\Bbb Z}_N}$, and ${f_A}(s) = \left\{ {\begin{array}{*{20}{l}}{1 - \frac{{|A|}}{N},}&{{\rm{for}}\;s \in A,}\\{ - \frac{{|A|}}{N},}&{{\rm{for}}\;s \notin A.}\end{array}} \right.$ We define the pseudorandom measure of order k of the subset A as follows, P_k(A, N) = $\begin{array}{*{20}{c}}{\max }\\D\end{array}$|$\mathop \Sigma \limits_{n \in {\mathbb{Z}_N}}$f_A(n + c₁)f_A(n + c₂) … f_A(n + c_k)|, where the maximum is taken over all D = (c₁, c₂, . . . , c_k) ∈ ${\mathbb{Z}^k}$ with 0 ≤ c₁ < c₂ < … < c_k ≤ N - 1. The subset A ⊂ ${{\mathbb{Z}_N}}$ is considered as a pseudorandom subset of degree k if P_k(A, N) is “small” in terms of N. We establish a link between the Gowers norm and our pseudorandom measure, and show that “good” pseudorandom subsets must have “small” Gowers norm. We give an example to suggest that subsets with “small” Gowers norm may have large pseudorandom measure. Finally, we prove that the pseudorandom subset of degree L(k) contains an arithmetic progression of length k, where L(k) = 2·lcm(2, 4, . . . , 2|$\frac{k}{2}$|), for k ≥ 4, and lcm(a₁, a₂, . . . , a_l) denotes the least common multiple of a₁, a₂, . . . , a_l.     

π-Armendariz rings relative to a monoid

Let Mbe a monoid. A ring Ris called M-π-Armendariz if whenever α = a₁g₁+ a₂g₂+ · · · + a_ng_n, β = b₁h₁+ b₂h₂+ · · · + b_mh_m ∈ R[M] satisfy αβ ∈ nil(R[M]), then aibj ∈ nil(R) for all i, j. A ring R is called weakly 2-primal if the set of nilpotent elements in R coincides with its Levitzki radical. In this paper, we consider some extensions of M-π-Armendariz rings and further investigate their properties under the condition that R is weakly 2-primal. We prove that if R is an M-π-Armendariz ring then nil(R[M]) = nil(R)[M]. Moreover, we study the relationship between the weak zip-property (resp., weak APP-property, nilpotent p.p.-property, weak associated prime property) of a ring R and that of the monoid ring R[M] in case R is M-π-Armendariz.     

Upper bounds for Ramsey numbers

The Ramsey number R(G₁,G₂,…,G_k) is the least integer p so that for any k-edge coloring of the complete graph K_p, there is a monochromatic copy of G_i of color i. In this paper, we derive upper bounds of R(G₁,G₂,…,G_k) for certain graphs G_i. In particular, these bounds show that R(9,9)6588 and R(10,10)23556 improving the previous best bounds of 6625 and 23854.     

Generalized equivalence of pairs of matrices

Pairs (A₁B₁) and (A₂B₂) of matrices over a principal ideal domain R are called the generalized equivalent pairs if A₂=UA₁V₁B₂=UB₁V₂ for some invertible matrices UV₁V₂ over R. A special form is established to which a pair of matrices can be reduced by means of generalized equivalent transformations. Besides necessary and sufficient conditions are found, under which a pair of matrices is generalized equivalent to a pair of diagonal matrices. Applications are made to study the divisibility of matrices and multiplicative property of the Smith normal form.     

On the Equation n_1n_2= n_3n_4 Restricted to Factor Closed Sets

We study the number of solutions N(B,F) of the diophantine equation n_1n_2 = n_3 n_4,where 1 ≤ n_1 ≤ B,1 ≤ n_3 ≤ B,n_2,n_4 ∈ F and F[1,B] is a factor closed set.We study more particularly the case when F={m = p_1~(ε1)···p_k~(εk),ε_j∈{0,1},1 ≤ j ≤ k},p_1,...,p_k being distinct prime numbers.     

An extended result of Kleitman and Saks concerning binary trees

In a recent paper, D.J. Kleitman and M.E. Saks gave a proof of Huang's conjecture on alphabetic binary trees.

Given a set E = {e_i}, I = 0, 1, 2, …, m and assigned positive weights to its elements and supposing the elements are indexed such that w(e₀) ≤ w(e₁) ≤ … ≤w (e_m), where w(e_i) is the weight of e_i, we call the following sequence E^* a ‘saw-tooth’ sequence

E^*=(e₀,e_m,e₁,…,e_j,e_m−j,…).

Huang's conjecture is: E^* is the most expensive sequence for alphabetic binary trees. This paper shows that this property is true for the L-restricted alphabetic binary trees, where L is the maximum length of the leaves and log₂(m + 1) ≤L≤m.     

专职修理工多重休假且修理设备可更换的k/n(G)表决系统研究

讨论专职修理工多重休假,修理设备可发生失效且可更换的k/n（G）表决可修系统.当系统中没有故障部件时,专职修理工开始一次休假,在此期间,若有工作部件发生故障,则立即指派普通修理工修理故障部件,一直持续到系统中无故障部件或专职修理工休假回来.利用马尔可夫过程理论和矩阵解法,给出了系统瞬态和稳态下的可用度和故障频度、可靠度、系统首次故障前的平均时间、修理设备处于更换状态的概率等指标的表达式.在此基础上,基于不同的初始条件研究了相关指标随时间的变化情况.最后,特殊情形的讨论验证了所得结果的正确性.     

Uniqueness implies existence for three-point boundary value problems for dynamic equations

Shooting methods are used to obtain solutions of the three-point boundary value problem for the second-order dynamic equation, y^ΔΔ = f (x, y, y^Δ), y(x₁) = y₁, y(x₃) − y(x₂) = y₂, where f : (a, b)_T × ² → is continuous, x₁ < x₂ < x₃ in (a, b)_T, y₁, y₂ ε , and T is a time scale. It is assumed such solutions are unique when they exist.     

Conservative schemes for the symmetric Regularized Long Wave equations

In this paper, we study the Symmetric Regularized Long Wave (SRLW) equations by finite difference method. We design some numerical schemes which preserve the original conservative properties for the equations. The first scheme is two-level and nonlinear-implicit. Existence of its difference solutions are proved by Brouwer fixed point theorem. It is proved by the discrete energy method that the scheme is uniquely solvable, unconditionally stable and second-order convergent for U in L_∞ norm, and for N in L₂ norm on the basis of the priori estimates. The second scheme is three-level and linear-implicit. Its stability and second-order convergence are proved. Both of the two schemes are conservative so can be used for long time computation. However, they are coupled in computing so need more CPU time. Thus we propose another three-level linear scheme which is not only conservative but also uncoupled in computation, and give the numerical analysis on it. Numerical experiments demonstrate that the schemes are accurate and efficient.     

On neighborhood condition for graphs to have [a,b]-factors

Let G be a graph of order n, and let a and b be integers such that 1a<b. Let δ(G) be the minimum degree of G. Then we prove that if δ(G)(k−1)a, n(a+b)(k(a+b)−2)/b, and |N_G(x₁)N_G(x₂)N_G(x_k)|an/(a+b) for any independent subset {x₁,x₂,…,x_k} of V(G), where k2, then G has an [a,b]-factor. This result is best possible in some sense.     

On meromorphic solutions of a certain type of nonlinear differential equations

We consider transcendental meromorphic solutions with N(r,f) = S(r,f) of the following type of nonlinear differential equations:f~n + Pn-2(f) = p1(z)e~(α1(z)) +p2(z)e~(α2(z)),where n≥ 2 is an integer, Pn-2(f) is a differential polynomial in f of degree not greater than n-2 with small functions of f as its coefficients, p1(z), p2(z) are nonzero small functions of f, and α1(z), α2(z)are nonconstant entire functions. In particular, we give out the conditions for ensuring the existence of meromorphic solutions and their possible forms of the above equation. Our results extend and improve some known results obtained most recently.     

Elasticity of factorizations in integral domains

For an atomic integral domain R, define(R)=sup{mn|x₁x_m=y₁y_n, each x_i,y_jεR is irreducible}. We investigate (R), with emphasis for Krull domains R. When R is a Krull domain, we determine lower and upper bounds for (R); in particular,(R)≤max{|Cl(R)| 2, 1}. Moreover, we show that for any real numbers r≥1 or R=∞, there is a Dedekind domain R with torsion class group such that (R)=r.     

Coupling and harmonic functions in the case of continuous time Markov processes

Consider two transient Markov processes (X^v_t)_tεR·, (X^μ_t)_tεR· with the same transition semigroup and initial distributions v and μ. The probability spaces supporting the processes each are also assumed to support an exponentially distributed random variable independent of the process.

We show that there exist (randomized) stopping times S for (X^v_t), T for (X^μ_t) with common final distribution, L(X^v_S|S < ∞) = L(X^μ_T|T < ∞), and the property that for t < S, resp. t < T, the processes move in disjoint portions of the state space. For such a coupling (S, T) it is shown

where denotes the bounded harmonic functions of the Markov transition semigroup. Extensions, consequences and applications of this result are discussed.