On Lattices Embeddable into Lattices of Order-Convex Sets. II Star-like Posets

We find a syntactic characterization of the class \(\mathrm{\mathbf{SUB}}(\mathcal{S})\cap\mathrm{Fin}\) of finite lattices embeddable into convexity lattices of a certain class of posets which we call star-like posets and which is a proper subclass in the class of N-free posets. The characterization implies that the class \(\mathrm{\mathbf{SUB}}(\mathcal{S})\cap\mathrm{Fin}\) forms a pseudovariety.     

Embedding Ordered Sets into Distributive Lattices

This paper investigates the class of ordered sets that are embeddable into a distributive lattice in such a way that all existing finite meets and joins are preserved. The main result is that the following decision problem is NP-complete: Given a finite ordered set, is it embeddable into a distributive lattice with preservation of existing meets and joins? The NP-hardness of the problem is proved by polynomial reduction of the classical 3SAT decision problem into it, and the NP-completeness by presenting a suitable NP-algorithm.     

L-可定义集与L-粗糙概念格

对基于剩余格L的L-广形式背景引入了L-可定义集概念,研究L-可定义集的性质及其与L-粗糙概念之间的关系.培出L-广可定义集的刻画;得到常值L-案均为L-可定义集的若干等价条件;证明全体L-可定义集在L-集包含序下是相应L-幂集格及L-粗糙概念格的子完备格;给出全体L-可定义集恰为全体L-粗糙概念外延的一个充要条件.     

Inflation of Finite Lattices Along All-or-nothing Sets

We introduce a new generalization of Alan Day’s doubling construction. For ordered sets \(\mathcal {L}\) and \(\mathcal {K}\) and a subset \(E \subseteq \ \leq _{\mathcal {L}}\) we define the ordered set \(\mathcal {L} \star _{E} \mathcal {K}\) arising from inflation of \(\mathcal {L}\) along E by \(\mathcal {K}\). Under the restriction that \(\mathcal {L}\) and \(\mathcal {K}\) are finite lattices, we find those subsets \(E \subseteq \ \leq _{\mathcal {L}}\) such that the ordered set \(\mathcal {L} \star _{E} \mathcal {K}\) is a lattice. Finite lattices that can be constructed in this way are classified in terms of their congruence lattices.A finite lattice is binary cut-through codable if and only if there exists a 0?1 spanning chain \(\left \{\theta _{i}\colon 0 \leq i \leq n \right \}\) in \(Con(\mathcal {L})\) such that the cardinality of the largest block of ?? _i /?? _i?1 is 2 for every i with 1≤i≤n. These are exactly the lattices that can be constructed by inflation from the 1-element lattice using only the 2-element lattice. We investigate the structure of binary cut-through codable lattices and describe an infinite class of lattices that generate binary cut-through codable varieties.     

Geometric Limit Sets of Higher Rank Lattices

Let G be a semisimple Lie group of R-rank at least 2 and adiscrete subgroup of G. We consider the limit set of in thegeometric boundary of the symmetric space associated with G.We define the notion of conical and horospherical limit points.In the case of irreducible non-uniform lattices, by using thetwo Tits building structures, we distinguish the location oftheir conical limit points. The limit sets of generalized Schottkygroups contained in Hilbert modular groups are studied. 2000Mathematics Subject Classification 22E40 (primary), 53C35 (secondary).     

Large Sets of Lattices without Order Embeddings

Let I and μ be an infinite index set and a cardinal, respectively, such that |I| ≤ μ and, starting from ?₀, μ can be constructed in countably many steps by passing from a cardinal λ to 2^λ at successor ordinals and forming suprema at limit ordinals. We prove that there exists a system X = {L_i: i ∈ I} of complemented lattices of cardinalities less than |I| such that if i, j ∈ I and φ: L_i → L_j is an order embedding, then i = j and φ is the identity map of L_i. If |I| is countable, then, in addition, X consists of finite lattices of length 10. Stating the main result in other words, we prove that the category of (complemented) lattices with order embeddings has a discrete full subcategory with |I| many objects. Still in other words, the class of these lattices has large antichains (that is, antichains of size |I|) with respect to the quasiorder “embeddability.” As corollaries, we trivially obtain analogous statements for partially ordered sets and semilattices.     

Join-Independent and Meet-Independent Sets in Complete Lattices

In this paper join-independent and meet-independent sets in a complete lattice are defined. The relations between them are presented and substructures of a complete lattice induced by such sets are investigated.     

粗糙集代数中的剩余格结构

讨论粗糙集代数与剩余格的关系.借助近似代数上的原子及同余关系,证明了在适当选取蕴涵算子及相应的剩余算子之后,粗糙集代数就成为剩余格,并进而证明了粗糙集代数也是MV代数与R0代数.     

完全分配格上的覆盖粗糙集模型

将集合论中的覆盖概念抽象到完全分配格L上,利用它定义格L上关于覆盖的上(下)近似算子,给出格L上覆盖粗糙集模型.文中先讨论格L上覆盖的相关性质,进而研究了覆盖上(下)近似算子的性质,得到若干结果.     

Endomorphism Classes of Ordered Sets,Graphs and Lattices

Order - Given a structure S, what other structures S' on the same underlying set satisfy End S $ \subseteq$ End S'? We answer this question for the cases of ordered sets, reflexive...     

半连续格的半素极小集与序同态扩张

对完备格引入半素极小集的概念,证明完备格L为半连续格当且仅当L中的每个元在L中存在半素极小集,给出半连续格的两个序同态扩张定理.     

A Characterization of Ordered Sets and Lattices via Betweenness Relations

For a set X with at least 3 elements, we establish a canonical one to one correspondence between all betweenness relations satisfying certain axioms and all pairs of inverse orderings “<” and “>” defined on X for which the corresponding Hasse diagram is connected and all maximal chains contain at least 3 elements. For an ordering “<”, the corresponding betweenness relation B is given by $$B=\{(x,y,z)\in X^3\mid x<y<z {\rm \ or\ }z<y<x\}.$$ Moreover, by adding one more axiom, we obtain also a one to one correspondence between all pairs of dual lattices and all betweenness relations.     

Doubling Convex Sets in Lattices: Characterizations and Recognition Algorithms

We characterize lattices obtained from another lattice by a doubling of a convex set. This gives rise to a characterization of the class CN of lattices obtained by doublings of connected and convex sets when starting from a two-element lattice, and from this characterization result we derive an efficient recognition algorithm. This algorithm can be directly applied to the recognition of lattices in the subclasses of CN defined by giving some additionnal constraints on the convex sets used in the doublings.     

有限Chevalley群作用下的子代数轨道生成的格

讨论了一般情形Chevalley群作用下的子代数轨道生成的格.在同类型格中,研究了不同格之间的包含关系,并对格中子代数的特性及格的几何性进行了刻画.     

Invariant Sets in Banach Lattices and Linear Differential Equations and Delay

In this paper we characterize the invariance of some sets with respect to a C ₀-semigroup in Banach lattice. An application to a linear differential equation with delay is given.     

基于剩余格理论的P-有界分配格的理想集代数

讨论P-有界分配格的理想集代数与剩余格的关系.证明了在适当选取蕴涵算子及相应的剩余算子之后,P-有界分配格的理想集代数就成为剩余格.定义了生成理想,并借助格论上的原子定义了P-有界分配格,然后讨论了它的一些性质,得到了一些好的结论.最后证明了P-有界分配格的理想集代数也是MV代数与R0代数.     

Computing Optimal Distances to Pareto Sets of Multi-Objective Optimization Problems in Asymmetric Normed Lattices

Given a finite dimensional asymmetric normed lattice, we provide explicit formulae for the optimization of the associated (non-Hausdorff) asymmetric “distance” among a subset and a point. Our analysis has its roots and finds its applications in the current development of effective algorithms for multi-objective optimization programs. We are interested in providing the fundamental theoretical results for the associated convex analysis, fixing in this way the framework for this new optimization tool. The fact that the associated topology is not Hausdorff forces us to define a new setting and to use a new point of view for this analysis. Existence and uniqueness theorems for this optimization are shown. Our main result is the translation of the original abstract optimal distance problem to a clear optimization scheme. Actually, this justifies the algorithms and shows new aspects of the numerical and computational methods that have been already used in visualization of multi-objective optimization problems.

     

拟半连续格和交半连续格

作为半连续格的推广, 引入了拟半连续格的概念. 讨论了拟半连续格的基本性质. 在拟半连续格上得到了类似于拟连续偏序集的一些主要结果. 同时探讨了半连续格、拟半连续格、交半连续格、交连续格、强连续格几种不同结构之间的关系. 最后,讨论了半连续函数空间仍是半连续格的条件.