Gradient extremals and valley floor bifurcations on potential energy surfaces

Gradient extremals are curves in configuration space denned by the condition that the gradient of the potential energy is an eigenvector of the Hessian matrix. Solutions of a corresponding equation go along a valley floor or along a crest of a ridge, if the norm of the gradient is a minimum, and along a cirque or a cliff or a flank of one of the two if the gradient norm is a maximum. Properties of gradient extremals are discussed for simple 2D model surfaces including the problem of valley bifurcations.     

Mathematical studies of Kekulé structures

The perfect matching vector and forcing and the Kekulé-vector of cata-benzenoids are defined. Two theorems are given which set the sufficient and necessary conditions for HKZ-vector (Harary et al. J Math Chem 6:295, 1991) and Kekulé-vector in cata-benzenoids. Additional two theorems are obtained which give sharp bounds for the modules of HKZ- and Kekulé vectors. Dedicated to Professor Tadeusz Marek Krygowski on the happy occasion of his 70th birthday.     

On the Randić Index of Acyclic Conjugated Molecules

The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))^−1/2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. We give a sharp lower bound on the Randić index of conjugated trees (trees with a perfect matching) in terms of the number of vertices. A sharp lower bound on the Randić index of trees with a given size of matching is also given Mei Lu: Partially supported by NNSFC (No. 60172005) Lian-zhu Zhang: Partially supported by NNSFC (No. 10271105) Feng Tian: Partially supported by NNSFC (No. 10431020)     

Performance of quantitative analyses by liquid chromatography–electrospray ionisation tandem mass spectrometry: from external calibration to isotopomer-based exact matching

Liquid chromatography–tandem mass spectrometry (LC-MS/MS) is a versatile coupling system which combines both selectivity and sensitivity and certainty. Hence, it is generally considered as the most reliable technique to quantify chemical compounds in complex matrices. In the present paper, we evaluate the performance of LC-MS/MS methods for the quantification of 3-nitrotyrosine in human urine in order to point out its dependence on the design of the quantification method, and emphasize the role of matrix effects in the performance. We compare external and internal calibrations, isotope dilution and isotopomer-based exact matching. The role of both sample preparation and multiple transitions monitoring is particularly addressed.     

Data loci in algebraic optimization

We consider parametric optimization problems from an algebraic viewpoint. The idea is to find all of the critical points of an objective function thereby determining a global optimum. For generic parameters (data) in the objective function the number of critical points remains constant. This number is known as the algebraic degree of an optimization problem. In this article, we go further by considering the inverse problem of finding parameters of the objective function so it gives rise to critical points exhibiting a special structure. For example if the critical point is in the singular locus, has some symmetry, or satisfies some other algebraic property. Our main result is a theorem describing such parameters.     

曲率流的参数化有限元逼近

许多物理现象可以在数学上描述为受曲率驱动的自由界面运动,例如薄膜和泡沫的演变、晶体生长,等等.这些薄膜和界面的运动常依赖于其表面曲率,从而可以用相应的曲率流来描述,其相关自由界面问题的数值计算和误差分析一直是计算数学领域中的难点.参数化有限元法是曲率流的一类有效计算方法,已经能够成功模拟一些曲面在几类基本的曲率流下的演化过程.本文重点讨论曲率流的参数化有限元逼近,它的产生、发展和当前的一些挑战.     

The density and minimal gap of visible points in some planar quasicrystals

It has previously been observed that the limiting gap distribution of the directions to visible points of planar quasicrystals may vanish near zero, that is, there exist planar quasicrystals with a positive limiting minimal normalised gap between the angles of visible points. The exact values of these limiting minimal normalised gaps have not been determined. In this paper we give explicit formulas for the densities of visible points for planar quasicrystals from several families, which include the Ammann–Beenker point set and the vertex sets of some rhombic Penrose tilings. Combining these results with a known characterisation of the limiting minimal gap in terms of a probability measure on an associated homogeneous space of quasicrystals, we give explicit values of the limiting minimal normalised gap between the angles of visible points for several families of planar quasicrystals, in particular, for the Ammann–Beenker point set and for the vertex sets of some rhombic Penrose tilings. We also compare our results with numerical observations.     

Lines of curvature near umbilical points on surfaces immersed in R4

LetM be a compact orientable surface,I:M R⁴ an immersion of classC ^r and a normal unitary smooth vector field. We prove that in the space of pairs (I, ) the family of pairs all whose umbilical points are Darbouxian is generic.     

On invexity-type nonlinear programming problems

In this paper, we propose a new class of nonlinear programing, called SFJ-invex programming. The optimality characterization shows that a problem is SFJ-invex if and only if a Fritz John point together with its multiplier, is a Fritz John saddle point of the problem. Under any constraint qualification assumption, a problem is SFJ-invex if and only if a Kuhn-Tucker point together with its multiplier is a Kuhn-Tucker saddle point of the problem. Furthermore, a generalization of the SFJ-invex, class is developed; the applications to (h, )-convex programming, particularly geometric programming, and to generalized fractional programming provide a relaxation in constraint qualification for differentiable problems to get saddle-point type optimality criteria.The author wishes to thank the referee for helpful comments.