Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

矩阵特征值的几个不等式

研究矩阵特征值的上、下界以及特征值的实部、虚部的不等式 ,给出了特征值一些新的上界和下界     

求解非线性规划问题的光滑路径跟踪方法

通过对非线性规划问题的K-T点的光滑路径跟踪方法研究，得出一种针对于既有不等式约束条件又有等式约束条件的优化问题光滑路径跟踪方法，证明了光滑跟踪路径的存在性。     

On the Patterson–Sullivan Measure for Geometrically Finite Groups Acting on Complex or Quaternionic Hyperbolic Space

The goal of this paper is to provide a tool, the Global Measure Formula, that will facilitate the study of the limit set of discrete geometrically finite groups of isometries of the rank one symmetric spaces. We consider the shadow of a ball from a fixed reference point onto the boundary, and prove a formula that describes the measure of the shadow in terms of the center of the shadowed ball, generalizing a result from real hyperbolic geometry.     

On the successive supersymmetric rank‐1 decomposition of higher‐order supersymmetric tensors

In this paper, a successive supersymmetric rank‐1 decomposition of a real higher‐order supersymmetric tensor is considered. To obtain such a decomposition, we design a greedy method based on iteratively computing the best supersymmetric rank‐1 approximation of the residual tensors. We further show that a supersymmetric canonical decomposition could be obtained when the method is applied to an orthogonally diagonalizable supersymmetric tensor, and in particular, when the order is 2, this method generates the eigenvalue decomposition for symmetric matrices. Details of the algorithm designed and the numerical results are reported in this paper. Copyright © 2007 John Wiley & Sons, Ltd.     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

How to Express a Parallel Sum of k Matrices

We present an alternative expression for the parallel sum of k Hermitian nonnegative definite matrices by using the Moore-Penrose inverse of a block matrix.     

我国AB股双重上市公司经营业绩变化的实证分析

本文以46家在上海和深圳同时上市AB股的公司的样本,分析了公司实行双重上市前1年及其后4年的经营业绩的变化趋势以及股权结构和上市顺序对它的影响。研究表明,双重上市当年及其后4年经营业绩显著下降;股权结构和上市顺序对公司经营业绩影响明显。最后,文章提出了改善AB股公司经营业绩的对策建议。     

Codimension-one minimal projections onto Haar subspaces

Let H_n be an n-dimensional Haar subspace of and let H_n−1 be a Haar subspace of H_n of dimension n−1. In this note we show (Theorem 6) that if the norm of a minimal projection from H_n onto H_n−1 is greater than 1, then this projection is an interpolating projection. This is a surprising result in comparison with Cheney and Morris (J. Reine Angew. Math. 270 (1974) 61 (see also (Lecture Notes in Mathematics, Vol. 1449, Springer, Berlin, Heilderberg, New York, 1990, Corollary III.2.12, p. 104) which shows that there is no interpolating minimal projection from C[a,b] onto the space of polynomials of degree n, (n2). Moreover, this minimal projection is unique (Theorem 9). In particular, Theorem 6 holds for polynomial spaces, generalizing a result of Prophet [(J. Approx. Theory 85 (1996) 27), Theorem 2.1].     

Generalized double affine Hecke algebras of rank 1 and quantized del Pezzo surfaces

Let D be a simply laced Dynkin diagram of rank r whose affinization has the shape of a star (i.e., D₄,E₆,E₇,E₈). To such a diagram one can attach a group G whose generators correspond to the legs of the affinization, have orders equal to the leg lengths plus 1, and the product of the generators is 1. The group G is then a 2-dimensional crystallographic group: G=Z??Z², where ? is 2, 3, 4, and 6, respectively. In this paper, we define a flat deformation H(t,q) of the group algebra C[G] of this group, by replacing the relations saying that the generators have prescribed orders by their deformations, saying that the generators satisfy monic polynomial equations of these orders with arbitrary roots (which are deformation parameters). The algebra H(t,q) for D₄ is the Cherednik algebra of type C^∨C₁, which was studied by Noumi, Sahi, and Stokman, and controls Askey-Wilson polynomials. We prove that H(t,q) is the universal deformation of the twisted group algebra of G, and that this deformation is compatible with certain filtrations on C[G]. We also show that if q is a root of unity, then for generic t the algebra H(t,q) is an Azumaya algebra, and its center is the function algebra on an affine del Pezzo surface. For generic q, the spherical subalgebra eH(t,q)e provides a quantization of such surfaces. We also discuss connections of H(t,q) with preprojective algebras and Painlevé VI.