On the invariant faces associated with a cone-preserving map

For an nonnegative matrix , an isomorphism is obtained between the lattice of initial subsets (of ) for and the lattice of -invariant faces of the nonnegative orthant . Motivated by this isomorphism, we generalize some of the known combinatorial spectral results on a nonnegative matrix that are given in terms of its classes to results for a cone-preserving map on a polyhedral cone, formulated in terms of its invariant faces. In particular, we obtain the following extension of the famous Rothblum index theorem for a nonnegative matrix: If leaves invariant a polyhedral cone , then for each distinguished eigenvalue of for , there is a chain of distinct -invariant join-irreducible faces of , each containing in its relative interior a generalized eigenvector of corresponding to (referred to as semi-distinguished -invariant faces associated with ), where is the maximal order of distinguished generalized eigenvectors of corresponding to , but there is no such chain with more than members. We introduce the important new concepts of semi-distinguished -invariant faces, and of spectral pairs of faces associated with a cone-preserving map, and obtain several properties of a cone-preserving map that mostly involve these two concepts, when the underlying cone is polyhedral, perfect, or strictly convex and/or smooth, or is the cone of all real polynomials of degree not exceeding that are nonnegative on a closed interval. Plentiful illustrative examples are provided. Some open problems are posed at the end.

     

关于预测误差平方和最小准则的几点看法

在应用桃棣荣等提出的预测误差平方和（ＰＲＥＳＳ）最小准则逐步算法的过程中，发现单纯应用ＰＲＥＳＳ值来控制引进因子数目有时不很有效。因此建议：１）当引进因子过多时，采用赤池信息准则对因子数做进一步控制。２）当引进因子过少时，取消原算法中关于ＰＲＥＳＳ值上界的规定和增加候选因子数以增加引进因子数。最后，对应用ＰＲＥＳＳ准则时所选因子的优良性进行了讨论     

拓扑空间中的连续逼近选择和几乎不动点

本文研究连续逼近选择问题 研究结果表明 ,几乎下半连续的集值映射有连续逼近选择 .从而 ,著名的Michael连续逼近选择定理被改进 .应用这个结果 ,一个几乎不动点定理被获得     

The center conjecture for non-exceptional buildings

We prove the center conjecture for spherical buildings of non-exceptional type. Our proof uses the point-line spaces associated with these buildings.     

关于图的若干介值问题

对连通图G,以C_i(G),■(G)分别表G的有i条边的连通支撑子图之集与连通子图之集,以C~i(G),(?)(G)分别表G的顶点数为i的子树集与连通子图之集.本文讨论了这四类子图簇对若干基本参数及端点数的介值性,从而对已有的一些结果作了若干有意义的拓广.     

Resistance characterizations of equiarboreal graphs

A weighted (unweighted) graph $G$ is called equiarboreal if the sum of weights (the number) of spanning trees containing a given edge in $G$ is independent of the choice of edge. In this paper, we give some resistance characterizations of equiarboreal weighted and unweighted graphs, and obtain the necessary and sufficient conditions for $k$-subdivision graphs, iterated double graphs, line graphs of regular graphs and duals of planar graphs to be equiarboreal. Applying these results, we obtain new infinite families of equiarboreal graphs, including iterated double graphs of 1-walk-regular graphs, line graphs of triangle-free 2-walk-regular graphs, and duals of equiarboreal planar graphs.     

Elementary submodels in infinite combinatorics

The use of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary submodels. We also present a new proof of Nash-Williams’s theorem on cycle decomposition of graphs, and finally we improve a decomposition theorem of Laviolette concerning bond-faithful decompositions of graphs.     

拓扑空间关于子基的紧致性

覆盖方法的应用在粗糙集理论研究中越来越受到重视,其中拓扑空间的子集关于子基的内部和闭包两个概念尤为重要.在由它们导入的关于子基的开集,闭集的基础上,给出了拓扑空间关于子基的紧致性概念,并研究它的性质,得到一般拓扑空间中紧致性的一种推广.     

Finding a representative nondominated set for multi-objective mixed integer programs

In this paper, we develop algorithms to find small representative sets of nondominated points that are well spread over the nondominated frontiers for multi-objective mixed integer programs. We evaluate the quality of representations of the sets by a Tchebycheff distance-based coverage gap measure. The first algorithm aims to substantially improve the computational efficiency of an existing algorithm that is designed to continue generating new points until the decision maker (DM) finds the generated set satisfactory. The algorithm improves the coverage gap value in each iteration by including the worst represented point into the set. The second algorithm, on the other hand, guarantees to achieve a desired coverage gap value imposed by the DM at the outset. In generating a new point, the algorithm constructs territories around the previously generated points that are inadmissible for the new point based on the desired coverage gap value. The third algorithm brings a holistic approach considering the solution space and the number of representative points that will be generated together. The algorithm first approximates the nondominated set by a hypersurface and uses it to plan the locations of the representative points. We conduct computational experiments on randomly generated instances of multi-objective knapsack, assignment, and mixed integer knapsack problems and show that the algorithms work well.     

A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order

The even Aztec diamond AD_n is known to have precisely four times more spanning trees than the odd Aztec diamond OD_n—this was conjectured by Stanley and first proved by Knuth. We present a short combinatorial proof of this fact in the case of odd n. Our proof works also for the more general case of odd-by-odd Aztec rectangles.