Some characterizations of completeness for trellises in terms of joins of cycles

Title:

Some characterizations of completeness for trellises in terms of joins of cycles

Creator:

Bhatta, S. Parameshwara and Shashirekha, H.

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:6117ce1a-aa41-4ed6-9f57-ac819d60c35a
uuid:6117ce1a-aa41-4ed6-9f57-ac819d60c35a

Subject:

pseudo-ordered set, trellis, $p$-chain, ascending well-ordered $p$-chain, cycle-complete trellis, and complete trellis

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

This paper gives some new characterizations of completeness for trellises by introducing the notion of a cycle-complete trellis. One of our results yields, in particular, a characterization of completeness for trellises of finite length due to K. Gladstien (see K. Gladstien: Characterization of completeness for trellises of finite length, Algebra Universalis 3 (1973), 341–344).

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

267-272

Source:

Czechoslovak Mathematical Journal | 2004 Volume:54 | Number:1

Harvested from:

CDK

Metadata only:

false