Skip to main content

Upper Semi-lattice Algebras and Combinatorics

  • Chapter
  • 1113 Accesses

Part of the book series: Trends in Mathematics ((TM))

Abstract

We characterize upper semi-lattice algebras and study their relationship with other classes of Tail algebras. Using the notion of support of nonzero elements, we derive some finite combinatorics on lengths of elements within this class of algebras.

To the memory of the first author’s mother

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bekkali. Pseudo Treealgebras. Notre Dame Journal of Formal Logic, volume 42, Number 1 (101–108), 2001

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Bekkali and D. Zhani. Tail and free poset algebras. Revista Matematica Complutence(17)Núm.1, (2003), 169–179.

    Google Scholar 

  3. M. Bekkali and D. Zhani. Upper semi-lattice algebras. Accepted in New Zealand Journal of Mathematics (2004).

    Google Scholar 

  4. G. Brenner, J.D. Monk. Tree algebras and chains. Lecture Notes in Mathematics (1004) (Springer-Verlag), 54–66.

    Google Scholar 

  5. E. Evans. The Boolean ring universal over a meet semilattice. J. Austral. Math. Soc.(23) (Series A)(1977), 402–415.

    Article  MATH  Google Scholar 

  6. G. Grätzer. General Lattice Theory. Second edition (2003), Birkhäuser.

    Google Scholar 

  7. L. Heindorf. Boolean semigroup rings and exponentials of compact zero-dimensional spaces. Fundamenta Mathematicae (135) (1990), 37–47.

    Google Scholar 

  8. L. Heindorf. On subalgebras of Boolean interval algebras. preprint, 1995.

    Google Scholar 

  9. S. Koppelberg. Handbook on Boolean Algebras. Vol. 1, Ed. Monk, J.D., and Bonnet, R., North Holland, 1989.

    Google Scholar 

  10. S. Koppelberg, and J.D. Monk. Pseudo-Trees and Boolean algebra. Order 8, 359–374, 1992.

    Google Scholar 

  11. J.D. Monk, R. Bonnet. (editors). Handbook on Boolean Algebras. (3 volumes) North-Holland. Amsterdam 1989.

    Google Scholar 

  12. K. Numakura. Theorems on compact totally disconnected semigroups and lattices. Proc. Amer. Math. Soc. 8, 623–636, 1957.

    Article  MATH  MathSciNet  Google Scholar 

  13. D.R. Popescu, I. Tomescu. Negative cycles in complete signed graphs. Discrete Applied Mathematics 68 (1996), 145–152.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Pouzet, I. Rival. Every countable lattice is a retract of a direct product of chains. Algebra universalis (18) (1984), 295–307.

    Google Scholar 

  15. H. SiKaddour. A note on the length of members of an interval algebra. Algebra universalis (44) (2000), 195–198.

    Google Scholar 

  16. D. Zhani. Length of elements in pseudo tree algebras. To appear in New Zealand Journal of Mathematics

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Birkhäuser Verlag Basel/Switzerland

About this chapter

Cite this chapter

Bekkali, M., Zhani, D. (2006). Upper Semi-lattice Algebras and Combinatorics. In: Bagaria, J., Todorcevic, S. (eds) Set Theory. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/3-7643-7692-9_2

Download citation

Publish with us

Policies and ethics