The distinguishing number and distinguishing chromatic number for posets

preprint2020arXivOpen access

Abstract

In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice LL and its set QLQ_L of join-irreducibles, we use classic lattice theory to show that any linear extension of QLQ_L generates a distinguishing 2-coloring of LL. We prove general upper bounds for the distinguishing chromatic number and particular upper bounds for the Boolean lattice and for divisibility lattices. In addition, we show that the distinguishing number of any twin-free Cohen-Macaulay planar lattice is at most 2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.