Kazhdan-Lusztig Polynomials for 321-Hexagon-Avoiding Permutations

In (Deodhar, Geom. Dedicata, 36(1) (1990), 95–119), Deodhar proposes a combinatorial framework for determining the Kazhdan-Lusztig polynomials P _x , _w in the case where W is any Coxeter group. We explicitly describe the combinatorics in the case where (the symmetric group on n letters) and the permutation w is 321-hexagon-avoiding. Our formula can be expressed in terms of a simple statistic on all subexpressions of any fixed reduced expression for w. As a consequence of our results on Kazhdan-Lusztig polynomials, we show that the Poincaré polynomial of the intersection cohomology of the Schubert variety corresponding to w is (1+q) ^l(w) if and only if w is 321-hexagon-avoiding. We also give a sufficient condition for the Schubert variety X _w to have a small resolution. We conclude with a simple method for completely determining the singular locus of X _w when w is 321-hexagon-avoiding. The results extend easily to those Weyl groups whose Coxeter graphs have no branch points (B C _n , F ₄, G ₂).     

Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models. II. Extended Results for Square-Lattice Chromatic Polynomial

We study the chromatic polynomials for m×n square-lattice strips, of width 9m13 (with periodic boundary conditions) and arbitrary length n (with free boundary conditions). We have used a transfer matrix approach that allowed us also to extract the limiting curves when n. In this limit we have also obtained the isolated limiting points for these square-lattice strips and checked some conjectures related to the Beraha numbers.     

Roots of Independence Polynomials of Well Covered Graphs

Let G be a well covered graph, that is, all maximal independent sets of G have the same cardinality, and let i_k denote the number of independent sets of cardinality k in G. We investigate the roots of the independence polynomial i(G, x) = i_kx^k. In particular, we show that if G is a well covered graph with independence number , then all the roots of i(G, x) lie in in the disk |z| (this is far from true if the condition of being well covered is omitted). Moreover, there is a family of well covered graphs (for each ) for which the independence polynomials have a root arbitrarily close to –.     

Initial guess by improved population-based intelligent algorithms for large inter-frame deformation measurement using digital image correlation

Digital image correlation (DIC) has received a widespread research and application in experimental mechanics. In DIC, the performance of subpixel registration algorithm (e.g., Newton-Raphson method, quasi-Newton method) relies heavily on the initial guess of deformation. In the case of small inter-frame deformation, the initial guess could be found by simple search scheme, the coarse-fine search for instance. While for large inter-frame deformation, it is difficult for simple search scheme to robustly estimate displacement parameters and deformation parameters simultaneously with low computational cost. In this paper, we proposed three improving strategies, i.e. Q-stage evolutionary strategy (T), parameter control strategy (C) and space expanding strategy (E), and then combined them into three population-based intelligent algorithms (PIAs), i.e. genetic algorithm (GA), differential evolution (DE) and particle swarm optimization (PSO), and finally derived eighteen different algorithms to calculate the initial guess for qN. The eighteen algorithms were compared in three sets of experiments including large rigid body translation, finite uniaxial strain and large rigid body rotation, and the results showed the effectiveness of proposed improving strategies. Among all compared algorithms, DE-TCE is the best which is robust, convenient and efficient for large inter-frame deformation measurement.     

线性自治NDDE与CDDE解空间为有限维的充要条件

本文把文［２］中关于 Ｒ Ｄ Ｄ Ｅ 解空间为有限维的结果完整地推广到 Ｎ Ｄ Ｄ Ｅ 和 Ｃ Ｄ Ｄ Ｅ 上去，给出了相应的充要条件     

weyl群的定义关系及其应用

首 先深化 Ｒ． Ｓｔｅｉｎｂｅｒｇ 关于 Ｗ ｅｙｌ 群定义 关系的一个定 理，作为应 用，对 Ｂｌ ， Ｃｌ 型 Ｗ ｅｙｌ群分别构造了一 个指数为２的正 规子群     

梯田式人工湿地出水致突变性研究

应用蚕豆根尖细胞微核技术对梯田式人工湿地出水进行致突变性研究，测定了生活污水、梯田式人工湿地出水、常规垂直流人工湿地出水及自来水的蚕豆根尖细胞微核千分率（MCN‰）及污染指数（PI），并对各水样的MCN‰进行了舱验．结果表明：梯田式人工湿地出水的致突变性（MCN％。为1.8‰）与生活污水（MCN‰为10．2‰）有显著差异，低于常规垂直流人工湿地（MCN‰为3．2‰），与自来水无明显差异（MCN‰为1．6‰），出水无致突变性，具有安全性．     

n次单位根在代数问题中的应用

主要论述n次单位根在一些组合数求和、多项式的整除、因式分解中的应用,说明了n次单位根法可拓宽解题思路,是一种方便、快捷的数学解题方法.     

A note on iterative roots of PM functions

In this paper we study iterative roots of PM functions, a special class of non-monotone functions. Problem 2 in [W. Zhang, PM functions, their characteristic intervals and iterative roots, Ann. Polon. Math. LXV (1997) 119-128] is solved partly and Theorem 4 in that paper is generalized.     

On the sharpness of two-sided bounds for the Perron Root and of the related eigenvalue inclusion sets

The paper considers the sharpness problem for certain two-sided bounds for the Perron root of an irreducible nonnegative matrix. The results obtained are applied to prove the sharpness of the related eigenvalue inclusion sets in classes of matrices with fixed diagonal entries, bounded above deleted absolute row sums, and a partly specified irreducible sparsity pattern.