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

S. Parameshwara Bhatta; H. Shashirekha

Czechoslovak Mathematical Journal (2004)

  • Volume: 54, Issue: 1, page 267-272
  • ISSN: 0011-4642

Abstract

top
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).

How to cite

top

Bhatta, S. Parameshwara, and Shashirekha, H.. "Some characterizations of completeness for trellises in terms of joins of cycles." Czechoslovak Mathematical Journal 54.1 (2004): 267-272. <http://eudml.org/doc/30857>.

@article{Bhatta2004,
abstract = {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).},
author = {Bhatta, S. Parameshwara, Shashirekha, H.},
journal = {Czechoslovak Mathematical Journal},
keywords = {pseudo-ordered set; trellis; $p$-chain; ascending well-ordered $p$-chain; cycle-complete trellis; complete trellis; pseudo-ordered set; trellis; -chain; ascending well-ordered -chain; cycle-complete trellis; complete trellis},
language = {eng},
number = {1},
pages = {267-272},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Some characterizations of completeness for trellises in terms of joins of cycles},
url = {http://eudml.org/doc/30857},
volume = {54},
year = {2004},
}

TY - JOUR
AU - Bhatta, S. Parameshwara
AU - Shashirekha, H.
TI - Some characterizations of completeness for trellises in terms of joins of cycles
JO - Czechoslovak Mathematical Journal
PY - 2004
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 54
IS - 1
SP - 267
EP - 272
AB - 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).
LA - eng
KW - pseudo-ordered set; trellis; $p$-chain; ascending well-ordered $p$-chain; cycle-complete trellis; complete trellis; pseudo-ordered set; trellis; -chain; ascending well-ordered -chain; cycle-complete trellis; complete trellis
UR - http://eudml.org/doc/30857
ER -

References

top
  1. Algebraic Theory of Lattices, Prentice Hall, Inc., Englewood Cliffs, 1973. (1973) 
  2. Tournaments and non-associative lattices, Ann. Univ. Sci. Budapest, Sect. Math. 13 (1970), 151–164. (1970) MR0321837
  3. 10.4064/cm-27-2-215-221, Colloq. Math. 27 (1973), 215–221. (1973) MR0327590DOI10.4064/cm-27-2-215-221
  4. 10.1007/BF02945138, Algebra Universalis 3 (1973), 341–344. (1973) Zbl0318.06002MR0349502DOI10.1007/BF02945138
  5. 10.1007/s000120050189, Algebra Universalis 44 (2000), 305–308. (2000) MR1816026DOI10.1007/s000120050189
  6. 10.1007/BF02944982, Algebra Universalis 1 (1971), 218–233. (1971) Zbl0242.06003MR0302523DOI10.1007/BF02944982

NotesEmbed ?

top

You must be logged in to post comments.