Title	The Distinguishing Number and Posets, Part II
Creator	Collins, Karen
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-09-20T17:05
Description	We introduce two distinguishing chromatic numbers of partially ordered sets, one based on incomparability and the other on comparability. This study has given us the opportunity to apply classic results in poset theory to obtain results about these parameters. We use Dilworth's Theorem to obtain a bound for the parameter based on incomparability. In distinguishing chromatic bounds based on comparability, we use the proof of Birkoff's Fundamental Theorem of Distributive Lattices. In contrast, we provide a bound for the Boolean lattice, $B_n$, based on its high degree of symmetry.
Extent	35.0
Subject	Mathematics; Combinatorics; Group theory and generalizations; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Wesleyan University
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-03-20
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377189
URI	http://hdl.handle.net/2429/68959
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos