On generalized harmonic number sums

We evaluate generalized harmonic number sums with parameter in terms of values of polylogarithm functions, and several examples are given. Instances of such sums occur in diverse areas including analytic number theory, and in calculations of high energy, nuclear, and atomic physics.     

Topological multiplicity of the maximum eigenvalue of graph 1-Laplacian

In this paper, we reveal the connection between the independent number of a graph and the topological multiplicity of the maximal eigenvalue of the corresponding graph 1-Laplacian. The pseudo independent number of a graph is introduced, which provides a better lower estimate of the topological multiplicity of the maximum eigenvalue. The technique of our proof is based on the localization property of the eigenvector for graph 1-Laplacian, the Krasnoselski genus, and its relation to the topological join.     

Turing pattern formation for reaction–convection–diffusion systems in fixed domains submitted to toroidal velocity fields

We have studied the effect of advection on reaction–diffusion equations by using toroidal velocity fields. Turing patterns formation in diffusion–advection–reaction problems was studied specifically, considering the Schnackenberg and glycolysis reaction kinetics models. Four cases were analyzed and solved numerically using finite elements. For glycolysis models, the advective effect modified the form of Turing patterns obtained with diffusion–reaction; whereas for Schnackenberg problems, the original patterns distorted themselves slightly, making them rotate in direction of the velocity field. We have also determined that the advective effect surpassed the diffusive one for high values of velocity and instability driven by diffusion was eliminated. On the other hand the advective effect is not considerable for very low values in the velocity field, and there was no modification in the original Turing pattern.     

Fall colouring of bipartite graphs and cartesian products of graphs

The question of whether a graph can be partitioned into k independent dominating sets, which is the same as having a fallk-colouring, is considered. For k=3, it is shown that a graph G can be partitioned into three independent dominating sets if and only if the cartesian product G□K₂ can be partitioned into three independent dominating sets. The graph K₂ can be replaced by any graph H such that there is a mapping f:Q_n→H, where f is a type-II graph homomorphism.The cartesian product of two trees is considered, as well as the complexity of partitioning a bipartite graph into three independent dominating sets, which is shown to be NP-complete. For other values of k, iterated cartesian products are considered, leading to a result that shows for what values of k the hypercubes can be partitioned into k independent dominating sets.     

An Edgeworth expansion for functionals of Gaussian fields and its applications

This paper is concerned with the rate of convergence in the normal approximation of the sequence $\left\{F_n\right\}$, where each $F_n$ is a functional of an infinite-dimensional Gaussian field. We develop new and powerful techniques for computing the exact rate of convergence in distribution with respect to the Kolmogorov distance. As a tool for our works, the Edgeworth expansion of general orders, with an explicitly expressed remainder, will be obtained, and this remainder term will be controlled to find upper and lower bounds of the Kolmogorov distance in the case of an arbitrary sequence $\left\{F_n\right\}$. As applications, we provide the optimal fourth moment theorem of the sequence $\left\{F_n\right\}$ in the case when $\left\{F_n\right\}$ is a sequence of random variables living in a fixed Wiener chaos or a finite sum of Wiener chaoses. In the former case, our results show that the conditions given in this paper seem more natural and minimal than ones appeared in the previous works.     

Genetic Algorithm for the Jump Number Scheduling Problem

This paper introduces genetic algorithms for the jump number scheduling problem. Given a set of tasks subject to precedence constraints, the problem is to construct a schedule to minimize the number of jumps. We show that genetic algorithms outperform the previously known Knuth and Szwarcfiter's exhaustive search algorithm when applied to some classes of orders in which no polynomial time algorithms exist in solving the jump number problem. Values for various parameters of genetic jump number algorithms are tested and results are discussed.     

The Fréchet distance between multivariate normal distributions

The Fréchet distance between two multivariate normal distributions having means μ_X, μ_Y and covariance matrices Σ_X, Σ_Y is shown to be given by $\text{d}{}^2\text{= |μ}{}_{\mathrm{X}}\text{? μ}{}_{\mathrm{Y}}\text{|}{}^2\text{+}\text{tr}\text{(Σ}{}_{\mathrm{X}}\text{+ Σ}{}_{\mathrm{Y}}\text{? 2(Σ}{}_{\mathrm{X}}\text{Σ}{}_{\mathrm{Y}}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$. The quantity d₀ given by $\text{d}{}_0{}^2\text{=}\text{tr}\text{(Σ}{}_{\mathrm{X}}\text{+ Σ}{}_{\mathrm{Y}}\text{? 2(Σ}{}_{\mathrm{X}}\text{Σ}{}_{\mathrm{Y}}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$ is a natural metric on the space of real covariance matrices of given order.     

多重休假Mx/G/1排队系统的输出过程

本文首次研究服务员具有多重休假规则的成批到达Mx/G/1排队系统的输出过程.应用更新过程理论、拉普拉斯-司梯阶变换和本文提出的直接概率分解分析法,讨论了从任意初始状态出发,系统在(0,t]时间内输出顾客的平均数,以及其渐近展开,得到一些重要结果.     

Backbone colorings of graphs with bounded degree

We study backbone colorings, a variation on classical vertex colorings: Given a graph G and a subgraph H of G (the backbone of G), a backbone coloring for G and H is a proper vertex k-coloring of G in which the colors assigned to adjacent vertices in H differ by at least 2. The minimal k∈N for which such a coloring exists is called the backbone chromatic number of G. We show that for a graph G of maximum degree Δ where the backbone graph is a d-degenerated subgraph of G, the backbone chromatic number is at most Δ+d+1 and moreover, in the case when the backbone graph being a matching we prove that the backbone chromatic number is at most Δ+1. We also present examples where these bounds are attained.Finally, the asymptotic behavior of the backbone chromatic number is studied regarding the degrees of G and H. We prove for any sparse graph G that if the maximum degree of a backbone graph is small compared to the maximum degree of G, then the backbone chromatic number is at most .     

On residually ideals and projective dimension one modules

We prove that certain modules are faithful. This enables us to draw consequences about the reduction number and the integral closure of some classes of ideals.