Results 221 to 230 of about 1,634,119 (265)

A geometric criterion links HIV-1 capsid topography to its biophysical properties and function. [PDF]

Nat Commun
Li W, Peeples CA, Rey JS, Perilla JR, Twarock R.   +4 more
europepmc   +1 more source

Free lattices generated by partially ordered sets

, 1968
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Embedding Ordered Sets into Distributive Lattices

Order, 2015
In this paper, the author investigates the decision problem: DistPO: Given a finite ordered set, is it embeddable into a distributive lattice with preservation of existing meets and joins? The main result of the paper is that DistPO is NP-complete.
exaly   +4 more sources

Ordered sets, lattices, and universal algebra

1994
Abstract It is of course impossible to give a full account of ordered sets, lattices, and universal algebra in a few pages, so we refer the reader to the various books cited in the bibliography. Nevertheless, in order to make this monograph reasonably selfcontained, we shall summarise in this introductory chapter the fundamental notions ...
T S Blyth, J C Varlet
exaly   +2 more sources

Completely lattice L-ordered sets with and without L-equality

Fuzzy Sets and Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martinek, Pavel
core   +5 more sources

Ordered Sets and Lattices

, 1989
This book is another publication in the recent surveys of ordered sets and lattices. The papers, which might be characterized as "reviews of reviews," are based on articles reviewed in the Referativnyibreve Zhurnal: Matematika from 1978 to 1982.
Kh. Drashkovicheva, T. Fofanova, V. Igoshin, T. Katrinyak, M. Kolibiar, A. Mikhalëv, V. Saliĭ, L. Skornyakov   +7 more
openaire   +2 more sources

Lattices of Extensions of Cyclically Ordered Sets and Compactifications of Generalized Cyclically Ordered Spaces

Mathematical Notes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

On lattice ordered soft sets

Applied Soft Computing, 2015
Graphical abstractDisplay Omitted HighlightsConcept of lattice ordered soft sets is introduced.This type of soft sets can help to represent linguistic terms having certain order.Properties of lattice order soft sets have been studied.Some algebraic structures associated with this type of soft sets have been given.In certain decision making problems ...
Muhammad Irfan Ali, Tahir Mahmood 0002, M. Muti Ur Rehman, Muhammad Aslam 0003   +3 more
openaire   +2 more sources

The Lattice of Completions of an Ordered Set

Order, 1997
The join dense completions of an ordered set \(P\) form a complete lattice \(K(P)\). Its least element is \(\mathcal O(P)\), the lattice of all order ideals of \(P\), and its greatest element is \(\mathcal M(P)\), the Dedekind-MacNeille completion of \(P\). It is isomorphic to an ideal of the lattice of all closure operators on \(\mathcal O(P)\).
Nation, J. B., Pogel, Alex
openaire   +2 more sources

Lattices of Order-Convex Sets of Forests

Order, 2009
Let \((P,\leq)\) be a partially ordered set. A set \(A\subseteq P\) is order-convex if for any \(x,y\in A\), \(x \leq z\leq y\) implies that \(z\in A\). Let \(\mathbf{Co}(P)\) denote the lattice of convex subsets of \(P\) under inclusion; such lattices will be called convexity lattices. For a class \(\mathcal{K}\) of posets, let \(\mathbf{Co}(\mathcal {
Marina V. Semenova, Anna Zamojska-Dzienio   +1 more
openaire   +2 more sources