Homotopy Structures for Algebras over a Monad

Let T be a monad over a category A. Then a homotopy structure for A, defined by a cocylinder P : A A, or path-endofunctor, can be lifted to the category A ^T of Eilenberg–Moore algebras over T, provided that P is consistent with T in a natural sense, i.e. equipped with a natural transformation : T P P T satisfying some obvious axioms. In this way, homotopy can be lifted from well-known, basic situations to various categories of algebras for instance, from topological spaces to topological semigroups, or spaces over a fixed space (fibrewise homotopy), or actions of a fixed topological group (equivariant homotopy); from categories to strict monoidal categories; from chain complexes to associative chain algebras. The interest is given by the possibility of lifting the homotopy operations (as faces, degeneracy, connections, reversion, interchange, vertical composition, etc.) and their axioms from A to A ^T , just by verifying the consistency between these operations and : T P P T. When this holds, the structure we obtain on our category of algebras is sufficiently powerful to ensure the main general properties of homotopy.     

A Moore space with a -base which cannot be densely embedded in any Moore space with the Baire property

The author answers a question raised in the literature about twenty five years ago and raised again more recently in Open Problems in Topology, by G. M. Reed, concerning the conjecture that every Moore space with a -discrete -base can be densely embedded in a Moore space having the Baire property. Even though closely related results have made this conjecture seem likely to be true, the author shows that, surprisingly, the conjecture is false.

     

关于精确结构静力重分析法的注记

结构重分析是与结构优化设计紧密相关的分析环节。位移约束条件、载荷与单元刚度矩阵可修改的精确结构静力重分析是较新的一种方法，文献[1,2]提出其结构静力重分析的列式，这一重分析方法被多篇综述文章引用。本文从另一角度推导结构修改的基本方程，并给出广义柔度矩阵的简便可行算法，推导过程简单明了，力学意义明显。     

Further study of alternating iterations for rectangular matrices

Theory of matrix splittings is a useful tool in the analysis of iterative methods for solving systems of linear equations. When two splittings are given, it is of interest to compare the spectral radii of the corresponding iteration matrices. This helps to arrive at the conclusion that which splitting should one choose so that one can reach the desired solution of accuracy or the exact solution in a faster way. In the case of many splittings are provided, the comparison of the spectral radii is time-consuming. Such a situation can be overcome by introducing another iteration scheme which converges to the same solution of interest in a much faster way. In this direction, the theory of alternating iterations for real rectangular matrices is recently proposed. In this note, some more results to the theory of alternating iterations are added. A comparison result of two different alternating iteration schemes is then presented which will help us to choose the iteration scheme that will guarantee the faster convergence of the alternating iteration scheme. In addition to these results, a comparison result for proper weak regular splittings is also obtained.     

Structural properties of graphs of diameter 2 with maximal repeats

It was shown using eigenvalue analysis by Erdös et al. that with the exception of C₄, there are no graphs of diameter 2, of maximum degree d and of order d², that is, one less than the Moore bound. These graphs belong to a class of regular graphs of diameter 2, and having certain interesting structural properties, which will be proved in this paper.