✦ LIBER ✦

Tree-Properties for Ordered Sets

✍ Scribed by Olivier Esser; Roland Hinnion

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 142 KB
Volume: 48
Category: Article
ISSN: 0044-3050
DOI: 10.1002/1521-3870(200202)48:2<213::aid-malq213>3.0.co;2-r

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we study the notion of arborescent ordered sets, a generalization of the notion of tree-property for cardinals. This notion was already studied previously in the case of directed sets. Our main result gives a geometric condition for an order to be ℵ0-arborescent.

📜 SIMILAR VOLUMES

Some homological properties of partially

Some homological properties of partially ordered sets

✍ Andrea Brini 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Combinatorial Criteria for Ramifiable Or

Combinatorial Criteria for Ramifiable Ordered Sets

✍ Olivier Esser; Roland Hinnion 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

New Algorithm for Ordered Tree-to-Tree C

New Algorithm for Ordered Tree-to-Tree Correction Problem

✍ Weimin Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB

number of leaves of S and D D denotes the depth of S. The previous best S Ž< < < < Ä 4 Ä 4 . Ž algorithms for this problem run in O S T min L L , D D min L L , D D time K.

Well Quasi-Ordered Sets

✍ F. Richman; G. Stolzenberg 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 322 KB

More Efficient Algorithm for Ordered Tre

More Efficient Algorithm for Ordered Tree Inclusion

✍ Weimin Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Given two ordered trees S S and T T, the tree inclusion problem is to determine whether it is possible to obtain S S from T T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for Ž< Ž .< < <. structured text databases. In this paper we prese

Matroids on Partially Ordered Sets

✍ Marilena Barnabei; Giorgio Nicoletti; Luigi Pezzoli 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 346 KB

## L dimension may be chosen within each of the subspaces L in the set S that are ''in general position.'' For example, in the real projective space of dimension 3, consider a plane , a line r not belonging to , the point P [ r l , and two distinct points Q, R both different from P, lying on the l