Reflexivity of Inductive Limits

An inductive locally convex limit of reflexive topological spaces is reflexive iff it is almost regular.     

Generalization of perfectly continuous,regular set-connected and clopen functions

Summary Noiri in 1984, Dontchev, Ganster and Reilly in recent years and Reilly and Vamanamurthy in 1983 introduced the notion of perfectly continuous, regular set-connected and clopen functions, respectively. The aim of this paper is to introduce the notion of a new class of functions which is called almost clopen functions including the classes of perfectly continuous, regular set-connected and clopen functions. Furthermore, properties of almost clopen functions are obtained and relationships among almost clopenness, perfect continuity, regular set-connectedness, clopenness and almost continuity are investigated.     

On Regular Rings Satisfying Almost Comparability

In this article, we study regular rings satisfying almost comparability. We first show that, for regular rings, almost comparability is inherited by finitely generated projective modules and finite matrix rings, and, as a main result, we prove that the strict cancellation property holds for the family of all finitely generated projective modules over directly finite regular rings satisfying almost comparability.     

Fuzzy S-Regular Spaces and S-Almost Regular Spaces

ＦｕｚｚｙＳＲｅｇｕｌａｒＳｐａｃｅｓａｎｄＳＡｌｍｏｓｔＲｅｇｕｌａｒＳｐａｃｅｓＦａｎｇＪｉｎｍｉｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＯｃｅａｎＵｎｉｖｅｒｓｉｔｙｏｆＱｉｎｇｄａｏ，Ｑｉｎｇｄａｏ，２６６０...     

Regular Rings Satisfying Generalized Almost Comparability

We study regular rings satisfying generalized almost comparability. First, we determine the forms of regular rings satisfying generalized almost comparability. Next, using the above result, we treat the strict cancellation property and the strict unperforation property for regular rings satisfying generalized almost comparability.     

Almost strongly regular matrices and a core theorem for double sequences

The idea of almost convergence for double sequences was introduced by Moricz and Rhoades [Math. Proc. Cambridge Philos. Soc. 104 (1988) 283-294] and they also characterized the four dimensional strong regular matrices. In this paper we define and characterize the almost strongly regular matrices for double sequences and apply these matrices to establish a core theorem.     

具有拟理想正则*-断面的正则半群

本文提出了具有正则*-断面正则半群的概念，所给出的例子表明具有拟理想正则*-断面的正则半群类真包含了具有拟理想逆断面的正则半群类和正则*-半群类；最后刻画了具有拟理想正则*-断面的正则半群的结构．     

Depth of almost strictly sign regular matrices

The concept of depth of an almost strictly sign regular matrix is introduced and used to simplify some algorithmic characterizations of these matrices.     

On the chromatic number of a random 5‐regular graph

It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5‐regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5‐regular graph is asymptotically almost surely equal to 3, provided a certain four‐variable function has a unique maximum at a given point in a bounded domain. We also describe extensive numerical evidence that strongly suggests that the latter condition holds. The proof applies the small subgraph conditioning method to the number of locally rainbow balanced 3‐colorings, where a coloring is balanced if the number of vertices of each color is equal, and locally rainbow if every vertex is adjacent to at least one vertex of each of the other colors. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 157–191, 2009     

具有正则*-断面的正则半群的结构

设S是一个正则半群,如果存在一个S的子半群S~*及上的一元运算*满足条件：(1)(?)x∈S,x~*∈S~*∩V(x)；(2)(?)x∈S~*,(x~*)~*=x；(3)(?)x,y∈S,(x~*y)~*=y~*x~(**),(xy~*)~*=y~(xx)x~*则称S~*是S的一个正则*_-断面．本文刻画了具有正则*_-断面的正则半群的结构。     

关于β-正则与一致β-正则诱导极限

本文举出反例说明文献［７］中关于一致β－正则的充要条件是错误的，并分别给出了诱导极限为β－正则与一致β－正则的正确的充要条件．     

全正则子半群构成链的正则半群(英文)

本文考虑全正则子半群构成链的正则半群,得到了正则半群具有全正则子半群构成链的一个充分必要条件,这推广了Jones关于具有全正则子半群构成链的逆半群的结果.特别地,建立了具有全正则子半群构成链的完全0-单半群的结构.     

Linear codes with few weights from weakly regular plateaued functions

Linear codes with few nonzero weights have wide applications in secret sharing, authentication codes, association schemes and strongly regular graphs. Recently, Wu et al. (2020) obtained some few-weighted linear codes by employing bent functions. In this paper, inspired by Wu et al. and some pioneers' ideas, we use a kind of functions, namely, general weakly regular plateaued functions, to define the defining sets of linear codes. Then, by utilizing some cyclotomic techniques, we construct some linear codes with few weights and obtain their weight distributions. Notably, some of the obtained codes are almost optimal with respect to the Griesmer bound. Finally, we observe that our newly constructed codes are minimal for almost all cases.     

Circuit-Cocircuit Reversing Systems in Regular Matroids

We consider that two orientations of a regular matroid are equivalent if one can be obtained from the other by successive reorientations of positive circuits and/or positive cocircuits. We study the inductive deletion-contraction structure of these equivalence classes in the set of orientations, and we enumerate these classes as evaluations of the Tutte polynomial. This generalizes the results in digraphs from a previous paper. Received January 10, 2006     

Weak stability of almost regular contact foliations

We prove that on a compact manifold, a contact foliation obtained by a smallC ¹ perturbation of an almost regular contact flow has at least two closed characteristics. This solves the Weinstein conjecture for contact forms which areC ¹-close to almost regular contact forms.Supported in part by NSF Grant DMS 90-01861     

On quasi-strongly regular graphs

We study the quasi-strongly regular graphs, which are a combinatorial generalization of the strongly regular and the distance regular graphs. Our main focus is on quasi-strongly regular graphs of grade 2. We prove a “spectral gap”-type result for them which generalizes Seidel's well-known formula for the eigenvalues of a strongly regular graph. We also obtain a number of necessary conditions for the feasibility of parameter sets and some structural results. We propose the heuristic principle that the quasi-strongly regular graphs can be viewed as a “lower-order approximation” to the distance regular graphs. This idea is illustrated by extending a known result from the distance-regular case to the quasi-strongly regular case. Along these lines, we propose a number of conjectures and open problems. Finally, we list the all the proper connected quasi-strongly graphs of grade 2 with up to 12 vertices.     

循环环的正则元

本文给出了循环环的所有正则元以及它们的数目 ,同时 ,给出了循环环是正则环的一个充要条件     

On Weak Regular ^＊-semigroups

In this paper, a special kind of partial algebras called projective partial groupoids is defined.It is proved that the inverse image of all projections of a fundamental weak regular ^*-semigroup under the homomorphism induced by the maximum idempotent-separating congruence of a weak regular ^*-semigroup has a projective partial groupoid structure. Moreover, a weak regular ^*-product which connects a fundamental weak regular ^*-semigroup with corresponding projective partial groupoid is defined and characterized. It is finally proved that every weak regular ^*-product is in fact a weak regular ^*-semigroup and any weak regular ^*-semigroup is constructed in this way.     

超拟群的模糊正则关系

Regular relations play in hyperquasigroups theory a role analogous to congruences in semigroup theory.The aim of this paper is to introduce the concept of regular relations on hyperquasigroups and to investigate some related properties.Further,the notion of fuzzy regular relations on hyperquasigroups is introduced and some characterizations are discussed.     

PMS-代数中的正则理想

本文提出伪补 Ｍ Ｓ 代数（简称 Ｐ Ｍ Ｓ 代数）中正则理想、正则同余关系的概念,研究正则理想与核理想、０ 理想之间的关系,讨论正则同余关系的性质,得到若干结果