拓扑分子格的ST*分离性公理

由半开元、半拓扑概念出发在拓扑分子格中引入 ST* 分离性公理 ,给出它们的刻画 ,推广文 [2 ]中 T* 分离性公理 ,并得到 ST* 分离性与 T* 分离性之间的关系。     

L-拓扑空间的次分离性公理

在L-拓扑空间中引入称之为次分离的分离性公理,包括次T1、次T2、次T212、次T3、次T4分离性等。新的分离性公理体系协调性很好,具有预期好的性质,如:具有遗传性和可乘性,是Low en意义下“L-好的推广”,和在次T2空间中分子网收敛在一定意义下唯一等。此外,文中还初步讨论了次分离性与文献中其它分离性的关系。     

拓扑分子格的PS-T*分离公理

利用准半开邻域引入了拓扑分子格的一类新的PS-Ti*分离公理(i=0,1,2,3,4),给出了这些分离性的刻画,得到了这些分离性是PS-同胚序同态下保持不变的性质。     

拓扑分子格的S紧性和S次紧性

利用半开元等半拓扑概念在拓扑分子格中引入S紧性与S次紧性，给出了它们的刻画，推广了文[1]中的紧性与次紧性，证明了拓扑分子格的S紧性，S次紧性，STi分离性(i=-1，0，1，2)与STi^*分离性(i=0，1，2)为半拓扑性质。     

Fuzzifying半拓扑空间的分离公理

在fuzzify ing拓扑空间中,利用fuzzify ing半开集、fuzzify ing半邻域系及fuzzify ing半闭包等概念导入了ST0-,ST1-,ST2-,ST3-,ST4-分离公理,并给出这5个公里的等价命题以及它们的关系。     

模糊半开集和半分离性公理

本文改进了文[3]的模糊半开集定义，在本文定义的模糊半开集定义，不仅可以完全保留文[3]的结论，而且还能建立分明拓扑空间及其诱导拓扑空间关于半开集、半闭集等对应关系。此外，本文借助重域概念重新定义了半－R0，半－R1和半－T2空间，与[4]相比，本文定义的半分离性公理体系可以更自然地推广分明拓扑空间中的有关定理。     

L-Fuzzy拓扑空间的层分离性公理

在一般L-fuzzy拓扑空间中引入一套新的分离性公理。即层分离性公理。并研究其性质．讨论层分离性公理与L-fuzzy拓扑空间中的第一套分离性公理间的关系。表明前者比后者弱且两者有很好的协调性。     

关于连续(开)序同态与分离性的一点注记

在L-拓扑空间中,给出连续序同态和开序同态的若干特征刻画,它们推广了文[2]的相应结果。此外,给出一个例子表明了分离性关系式:T-1 次T0/T0.     

T_(5/2)LF拓扑空间和S_(5/2)LF拓扑空间的分离性

定义 ST2 12 L F拓扑空间的分离性 ,证明 T2 12 LF拓扑空间、ST2 12 LF拓扑空间与 LF拓扑空间的其他几个分离性是协调的 ,并考察它们的性质。     

T21／2LF拓扑空间和ST21／2LF拓扑空间的分离性

定义ST21／2LF拓扑空间的分离性,证明了T21／2LF拓扑空间,ST21／2LF拓扑空间与LF拓扑空间的其他几个分离性是协调的,并考察它们的性质。     

Elastic lattices: equilibrium, invariant laws and homogenization

In the recent years, lattice modelling proved to be a topic of renewed interest. Indeed, fields as distant as chemical modelling and biological tissue modelling use network models that appeal to similar equilibrium laws. In both cases, obtaining an equivalent continuous model allows to simplify numerical procedures. We define the basic properties of lattices: elasticity, frame-indifference, hyperelasticity. We determine rigorously the form that constitutive laws undertake under frame-indifference and hyperelasticity assumptions. Finally, we describe an homogenization technique designed for discrete structures that provides a limit continuum mechanics model and, in the special case of hexagonal lattices, we investigate the symmetry properties of the limit constitutive law.      

基于AFS逻辑的模糊聚类分析

应用 AFS结构[8] 和 EI代数 [8] 给出一个新的模糊聚类分析方法。它和人类根据某些模糊特征对一些对象进行聚类分析的过程类似。并通过例子说明该方法分类的结果与用直觉分类的结果相似。     

Lattices of Subalgebras of Leibniz Algebras

I describe the lattice ?(L) of subalgebras of a one-generator Leibniz algebra L. Using this, I show that, apart from one special case, a lattice isomorphism φ: ?(L) → ?(L′) between Leibniz algebras L, L′ maps the Leibniz kernel Leib(L) of L to Leib(L′).     

Chermak–Delgado Lattice Extension Theorems

If G is a finite group with subgroup H, then the Chermak–Delgado measure of H (in G) is defined as |H||C _G (H)|. The Chermak–Delgado lattice of G, denoted 𝒞𝒟(G), is the set of all subgroups with maximal Chermak–Delgado measure; this set is a moduar sublattice within the subgroup lattice of G. In this paper we provide an example of a p-group P, for any prime p, where 𝒞𝒟(P) is lattice isomorphic to 2 copies of ?₂ (a quasiantichain of width 2) that are adjoined maximum-to-minimum. We introduce terminology to describe this structure, called a 2-string of 2-diamonds, and we also give two constructions for generalizing the example. The first generalization results in a p-group with Chermak–Delgado lattice that, for any positive integers n and l, is a 2l-string of n-dimensional cubes adjoined maximum-to-minimum and the second generalization gives a construction for a p-group with Chermak–Delgado lattice that is a 2l-string of ? _p+1 (quasiantichains, each of width p + 1) adjoined maximum-to-minimum.     

General preservers of invariant subspace lattices

Let be the space of all bounded linear operators on a Banach space X and let LatA be the lattice of invariant subspaces of the operator . We characterize some maps with one of the following preserving properties: Lat(Φ(A)+Φ(B))=Lat(A+B), or Lat(Φ(A)Φ(B))=Lat(AB), or Lat(Φ(A)Φ(B)+Φ(B)Φ(A))=Lat(AB+BA), or Lat(Φ(A)Φ(B)Φ(A))=Lat(ABA), or Lat([Φ(A),Φ(B)])=Lat([A,B]).     

关于有1模格的等价定义

进一步讨论有1模格的等价定义问题,得到并证明了一个(2,2,0)型代数成为有1模格的一个充分必要条件.这样大大简化了有1模格的等价定义.     

Lattice-Based Cryptography: A Survey*

Most of current public key cryptosystems would be vulnerable to the attacks of the future quantum computers. Post-quantum cryptography offers mathematical methods to secure information and communications against such attacks, and therefore has been receiving a significant amount of attention in recent years. Lattice-based cryptography, built on the mathematical hard problems in (high-dimensional) lattice theory, is a promising post-quantum cryptography family due to its excellent efficiency, moderate size and strong security. This survey aims to give a general overview on lattice-based cryptography. To this end, the authors begin with the introduction of the underlying mathematical lattice problems. Then they introduce the fundamental cryptanalytic algorithms and the design theory of lattice-based cryptography.