The completion of the classification of the regular near octagons with thick quads

Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t₂, t₃ and t satisfy s ≥ 2, t₂ ≥ 2 and t₃ ≠ t₂(t₂+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open for the near octagons corresponding with certain values of s, t₂ and t₃. In the present paper, we will also show the nonexistence of these remaining regular near octagons. MSC2000 05B25, 05E30, 51E12 Postdoctoral Fellow of the Research Foundation - Flanders     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

Fuzzy HX环的推广

为改进Fuzzy HX环的结果,使之包含Fuzzy商环,提出了弱Fuzzy HX环的概念,研究了它的性质与结构,并重新讨论了拟Fuzzy商环,证明了在正则条件下拟Fuzzy商环与弱Fuzzy HX环的统一性：同时也得到了一致弱Fuzzy HX环与普通Fuzzy商环的关系。     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

正则带的半格结构

Petrich解决了一般带的构造定理（见[1]或[2]），在此基础上，我们将证明正则带（满足等式axya=axaya的带）的一些特征，并给出一个带为正则带或右似正规带（满足等式xya=xaya的带）的充分必要条件，这些结果是Yamada和Kimura的关于正规带（满足等式axya=ayxa的带）的结果的推广，正规带被他们描述为矩形带的强半格（见[1]或[3]）。     

Weierstrass Points and Regular Maps

It was shown by G. A. Jones and the first author in [8] that underlying any map on a compact orientable surface S there is a natural complex structure making S into a Riemann surface. In this paper we consider regular maps and enquire about the Weierstrass points on the underlying Riemann surface. We are particularly interested to know when these are geometric, i.e. whether they lie at vertices, face-centres or edge-centres of the map.     

关于RNP和SCS的若干等价条件

使用切片方法，讨论了Banach空间中有界闭凸子集的RNP和SCS的若干等价条件．     

关于Delphi7的Zlib压缩库的应用

在数据库应用过程中,往往要对一些文件进行保存,如果直接保存,会浪费很多数据库空间,势必造成对数据库处理速度的影响。介绍利用Delphi7提供的Zlib压缩库在数据库存取文件时可以直接进行压缩和解压缩处理,使得在数据库中存取文件变得越来越方便。     

von-Neumann正则环与左SF-环

环R称为左SF-环,如果每个单左R-模是平坦的.众所周知,Von-Neumann正则环是SF-环,但SF-环是否是正则环至今仍是公开问题,本文主要研究左SF-环是正则环的条件,证明了:如果R是左SF-环且R的每个极大左(右)理想是广义弱理想,那么R是强正则环.并且推广了Rege[3]中的相应结果.