Find results with:

Add another field

Search by date

to

Searching collections:

Dartmouth Dissertations

Add or remove collections

Home Dartmouth Dissertations Page 1

Reference URL

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Bijective combinatorics of reduced decompositions / by Zachary Hamaker.

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Back to top

Powered by CONTENTdm®

Author	Hamaker, Zachary (Zachary R.)
Title	Bijective combinatorics of reduced decompositions / by Zachary Hamaker.
Date	2014
Abstract	We study the bijective combinatorics of reduced words. These are fundamental objects in the study of Coxeter groups. We restrict our focus to reduced words of permutations and signed permutations. Our results can all be situated within the context of two parallels. The first parallel is between the enumerative theory of reduced words and that of Coxeter group elements. The second parallel is between the combinatorics of permutations and that of signed permutations. The enumerative properties of reduced words have been studied widely since Stanley first proposed the problem of counting reduced words of permutations. One approach is via the Little map, a bijection introduced by David Little. We introduce a Little map for reduced words of signed permutations and explain how to think of these maps as an analogue jeu de taquin for the setting of reduced words. We also extend dual equivalence and Rothe diagrams graphs to the setting of signed permutations. In the former case, this leads to a new description of reduced words for signed permutations as balanced labelings of diagrams. Much of the work introduced in this thesis appeared for the first time in [17], joint with Benjamin Young, and in [6], joint with Sara Billey, Austin Roberts and Benjamin Young.
Description	vi, 115 leaves : ill. (some col.)
Format	application/pdf
College	Dartmouth College. Department of Mathematics.
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D.)--Dartmouth College.
Copyright	All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means without permission in writing from the author.
DOI	http://dx.doi.org/10.1349/ddlp.1225

Title	Page 1
Full Text	BIJECTIVE COMBINATORICS OF REDUCED DECOMPOSITIONS A Thesis Submitted to the Faculty in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics by Zachary Hamaker DARTMOUTH COLLEGE Hanover, New Hampshire June 2014 Examining Committee: Peter Winkler, Chair Sergi Elizalde Rosa Orellana Sara Billey F. Jon Kull, Ph.D. Dean of Graduate Studies

Find results with:

Searching collections:

Home Dartmouth Dissertations Page 1

Bijective combinatorics of reduced decompositions / by Zachary Hamaker.

Object Description

Description

Bijective combinatorics of reduced decompositions / by...

Bijective combinatorics of reduced decompositions / by...

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12