Conjectures and Results Involving Orderings, Posets, and Lattices

Presentation Type

Poster/Portfolio

Presenter Major(s)

Computer Science, Mathematics

Mentor Information

Brian Drake

Department

Mathematics

Location

KC97

Start Date

11-4-2012 12:00 PM

Keywords

Creativity/ Innovation, Mathematical Science

Abstract

In discrete mathematics, there are partial orders on permutations relating how much they are disordered. One of these orders, the weak order, has some additional structure called a lattice. Our work presents conjectures and results from combining the weak order with other orders to form larger posets with the aim that these posets exhibit properties of a lattice. Our ideas include the use of alternative representations such as binary matrices.

This document is currently not available here.

Share

COinS
 
Apr 11th, 12:00 PM

Conjectures and Results Involving Orderings, Posets, and Lattices

KC97

In discrete mathematics, there are partial orders on permutations relating how much they are disordered. One of these orders, the weak order, has some additional structure called a lattice. Our work presents conjectures and results from combining the weak order with other orders to form larger posets with the aim that these posets exhibit properties of a lattice. Our ideas include the use of alternative representations such as binary matrices.