Stiefel-Whitney surfaces and decompositions of 3-manifolds into handlebodies

Every closed nanorientable 3-manifold M can be obtained as the union of three orientable handlebodies V₁, V₂, V₃ whose interiors are pairwise disjoint. If g_i denotes the genus of V_i, g₁g₂g₃, we say that M has tri-genus (g₁, g₂, g₃), if in terms of lexicographical ordering, the triple (g₁, g₂, g₃) is minimal among all such decompositions of M into orientable handlebodies. We relate the tri-genus of M to the genus of a surface that represents the dual of the first Stiefel-Whitney class of M. This is used to determine g₁ and g₂.     

Embeddings of the base and bundle isomorphisms

Let π_i :E_i→M, i=1,2, be oriented, smooth vector bundles of rank k over a closed, oriented n-manifold with zero sections s_i :M→E_i. Suppose that U is an open neighborhood of s₁(M) in E₁ and F :U→E₂ a smooth embedding so that π₂Fs₁ :M→M is homotopic to a diffeomorphism f. We show that if k>[(n+1)/2]+1 then E₁ and the induced bundle f^*E₂ are isomorphic as oriented bundles provided that f have degree +1; the same conclusion holds if f has degree −1 except in the case where k is even and one of the bundles does not have a nowhere-zero cross-section. For n≡0(4) and [(n+1)/2]+1<kn we give examples of nonisomorphic oriented bundles E₁ and E₂ of rank k over a homotopy n-sphere with total spaces diffeomorphic with orientation preserved, but such that E₁ and f^*E₂ are not isomorphic oriented bundles. We obtain similar results and counterexamples in the more difficult limiting case where k=[(n+1)/2]+1 and M is a homotopy n-sphere.     

最大匹配的路变换图

图G的最大匹配的路变换图NM(G)是这样一个图,它以G的最大匹配为顶点,如果两个最大匹配M_1与M_2的对称差导出的图是一条路(长度没有限制),那么M_1和M_2在NM(G)中相邻.研究了这个变换图的连通性,分别得到了这个变换图是一个完全图或一棵树或一个圈的充要条件.     

Zagreb indices of graphs

The first Zagreb index M₁(G) is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index M₂(G) is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying molecular graph G. In this paper, we obtain lower and upper bounds on the first Zagreb index M₁(G) of G in terms of the number of vertices (n), number of edges (m), maximum vertex degree (Δ), and minimum vertex degree (δ). Using this result, we find lower and upper bounds on M₂(G). Also, we present lower and upper bounds on M₂(G) +M₂(G) in terms of n, m, Δ, and δ, where G denotes the complement of G. Moreover, we determine the bounds on first Zagreb coindex M₁(G) and second Zagreb coindex M₂(G). Finally, we give a relation between the first Zagreb index and the second Zagreb index of graph G.     

考虑非周期检测的视情维修与备件订购联合策略优化

针对单部件系统/关键部件提出视情维修与备件订购联合策略,其中系统退化服从两阶段延迟时间过程且采用非周期检测策略,退化初期以检测间隔T₁检查系统状态,而在第一次识别缺陷状态时,缩短检测周期为T₂、订购备件且进行不完美维修;若系统在随后的退化中被识别处于缺陷状态,执行不完美维修直至超过阈值次数N_max并采取预防性更换,但若在检测周期内发生故障则进行更换。根据系统状态和备件状态分析各种可能更新事件及相应的联合决策,利用更新报酬理论构建最小化单位时间内期望成本的目标函数,优化T₁,T₂, N_max。与对比模型策略相比,算例结果表明所提出的联合策略能有效降低单位时间内的期望成本。     

π-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.     

具有学习效应的两台机上最优混合流水作业算法

研究相同工件在两台机器（分别称为机器M₁和M₂）上的混合流水作业问题,每个给定工件有两个任务,分别称之为任务A和任务B,任务B只能在任务A完工后才能开始加工,每个工件有两种加工模式供选择：模式1是将两个任务都安排在机器M₂上加工;模式2是将任务A和B分别安排在机器M₁和M₂上加工.假设在加工工件时,机器具有学习效应,即工件的实际加工时间与工件的加工位置有关.目标函数是最小化最大完工时间.分别讨论了具有无缓冲区与无限缓冲区两种加工环境情况,两种情况下都得到了最优算法.     

On Word Equations Originated from Discrete Dynamical Systems Related to Antisymmetric Cubic Maps with Some Applications

In this article, we solve some word equations originated from discrete dynamical systems related to antisymmetric cubic map. These equations emerge when we work with primitive and greatest words. In particular, we characterize all the cases for which <β₁β₁>=<β₂β₂> where β₁ and β₂ are the greatest words in <<β₁>> and <<β₂>> of M(n).     

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.     

Algorithms for finding a Kth best valued assignment

We consider a new problem, the Kth best valued assignment problem. Given a bipartite graph G and a cost vector w on its edge set, this is the problem of finding a perfect matching M_k in G such that there exist perfect matchings M₁,…,M_K−1 satisfying w(M₁) < < w(M_K−1) < w(M_K), and w(M_K) < w(M) for all perfect matchings M with w(M) ≠ w(M₁),…,w(M_K). Here w(M) denotes the sum of costs of edges in M. In this paper, we propose two algorithms for solving this problem and verify the efficiency of our algorithms by our preliminary computational experiments.     

A generalized π2-diffeomorphism finiteness theorem

The π₂-diffeomorphism finiteness result of F. Fang-X. Rong and A. Petrunin-W. Tuschmann (independently) asserts that the diffeomorphic types of compact n-manifolds M with vanishing first and second homotopy groups can be bounded above in terms of n; and upper bounds on the absolute value of sectional curvature and diameter of M: In this paper, we will generalize this π₂-diffeomorphism finiteness by removing the condition that π₁(M) = 0 and asserting the diffeomorphism finiteness on the Riemannian universal cover of M:     

ContributionsChromatic Ramsey numbers

Suppose G is a graph. The chromatic Ramsey number r_c(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: for any 2-colouring of the edges of F there is a monochromatic subgraph isomorphic to G. Let M_n = min[r_c(G): χ(G) = n]. It was conjectured by Burr et al. (1976) that M_n = (n − 1)² + 1. This conjecture has been confirmed previously for n 4. In this paper, we shall prove that the conjecture is true for n = 5. We shall also improve the upper bounds for M₆ and M₇.     

Weight distribution of the bases of a binary matroid

Let M be a weighted binary matroid and w₁ < … < w_m be the increasing sequence of all possible distinct weights of bases of M. We give a sufficient condition for the property that w₁, …, w_m is an arithmetical progression of common difference d. We also give conditions which guarantee that w_i+1 − w_i ≤ d, 1 ≤ i ≤ m −1. Dual forms for these results are given also.     

A two-sided estimate in the Hsu-Robbins-Erdös law of large numbers

Let X₁, X₂, … be independent identically distributed random variables. Then, Hsu and Robbins (1947) together with Erdös (1949, 1950) have proved that

,

if and only if E[X²₁] < ∞ and E[X₁] = 0. We prove that there are absolute constants C₁, C₂ (0, ∞) such that if X₁, X₂, … are independent identically distributed mean zero random variables, then

c₁λ⁻² E[X₁²·1_{|X1|λ}]S(λ)C₂λ⁻² E[X₁²·1_{|X1|λ}]

,

for every λ > 0.     

Triangles in 3-connected matroids

A collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected matroid having a minor in F, and T is a 3-element circuit of M, then M has a minor which uses T and is isomorphic to a member of F. An efficient theorem for testing a collection of matroids for this property is presented. This test is used to obtain several results including the following extension of a result of Asano, Nishizeki, and Seymour. Let T be a 3-element circuit of a 3-connected binary nonregular matroid M with at least eight elements. Then M has a minor using T that is isomorphic to S₈ or the generalized parallel connection across T of F₇ and M(K₄).     

Almost perfect matchings in random uniform hypergraphs

We consider the following model H_r(n, p) of random r-uniform hypergraphs. The vertex set consists of two disjoint subsets V of size | V | = n and U of size | U | = (r − 1)n. Each r-subset of V × (_r−1^U) is chosen to be an edge of H ε H_r(n, p) with probability p = p(n), all choices being independent. It is shown that for every 0 < < 1 if P = (C ln n)/n^r−1 with C = C() sufficiently large, then almost surely every subset V₁ V of size | V₁ | = (1 − )n is matchable, that is, there exists a matching M in H such that every vertex of V₁ is contained in some edge of M.     

Maximal IM-unextendable graphs

A graph G is maximal IM-unextendable if G is not induced matching extendable and, for every two nonadjacent vertices x and y, G+xy is induced matching extendable. We show in this paper that a graph G is maximal IM-unextendable if and only if G is isomorphic to M_r(K_s(K_n1K_n2K_nt)), where M_r is an induced matching of size r, r1, t=s+2, and each n_i is odd.     

More limit theory for the sample correlation function of moving averages

Let X_t = Σ^∞_j=-∞ c_jZ_{t - j} be a moving average process where {Z_t} is iid with common distribution in the domain of attraction of a stable law with index , 0 < < 2. If 0 < < 2, E|Z₁| < ∞ and the distribution of |Z₁|and |Z₁Z₂| are tail equivalent then the sample correlation function of {X₁} suitably normalized converges in distribution to the ratio of two dependent stable random variables with indices and /2. This is in sharp contrast to the case E|Z₁| ^{= ∞} where the limit distribution is that of the ratio of two independent stable variables. Proofs rely heavily on point process techniques. We also consider the case when the sample correlations are asymptotically normal and extend slightly the classical result.     

On the degree of regularity of some equations

In this paper we investigate the behaviour of the solutions of equations Σ_I=1ⁿ a_ix_i = b, where Σ_i=1ⁿ, a_i = 0 and b ≠ 0, with respect to colorings of the set N of positive integers. It turns out that for any b ≠ 0 there exists an 8-coloring of N, admitting no monochromatic solution of x₃ − x₂ = x₂ − x₁ + b. For this equation, for b odd and 2-colorings, only an odd-even coloring prevents a monochromatic solution. For b even and 2-colorings, always monochromatic solutions can be found, and bounds for the corresponding Rado numbers are given. If one imposes the ordering x₁ < x₂ < x₃, then there exists already a 4-coloring of N, which prevents a monochromatic solution of x₃ − x₂ = x₂ − x₁ + b, where b ε N.