The distinguishing number and distinguishing chromatic number for posets

DOI10.1007/S11083-021-09583-2arXiv1905.09858MaRDI QIDQ6319264FDOQ6319264

Publication date: 23 May 2019

Abstract: In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice

L

and its set

Q_{L}

of join-irreducibles, we use classic lattice theory to show that any linear extension of

Q_{L}

generates a distinguishing 2-coloring of

L

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

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

This page was built for publication: The distinguishing number and distinguishing chromatic number for posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6319264)