Files in this item
Files  Description  Format 

application/pdf 9712315.pdf (4MB)  (no description provided) 
Description
Title:  On Tait's colortiling problem 
Author(s):  Hu, ZhuXin 
Doctoral Committee Chair(s):  Weichsel, Paul M. 
Department / Program:  Mathematics 
Discipline:  Mathematics 
Degree Granting Institution:  University of Illinois at UrbanaChampaign 
Degree:  Ph.D. 
Genre:  Dissertation 
Subject(s):  Mathematics 
Abstract:  In this thesis, we study a problem that generalizes a color tiling problem studied by the Scottish mathematician P. G. Tait in 1883, which has been of interest in China for many decades. Let l, m, t be positive integers with $m\mid l$ and let $n\sb1,\ n\sb2,\...,\ n\sb{t}$ be nonnegative integers. We consider sequences (also called strings) with $n\sb1+n\sb2+\...+n\sb{t}+l$ positions in a line. Of these positions, $n\sb1$ are filled with tiles of color 1, $n\sb2$ are filled with tiles of color 2, $\...,$ $n\sb{t}$ are filled with tiles of color t, and the remaining l are left empty, indicated by 0. A segment of a string is a substring consisting of tiles or empty positions in contiguous positions. A solid segment is a segment containing no empty positions. An Osegment is a segment consisting of contiguous empty positions (like 00$\...$0). We say an Osegment is a maximal Osegment if it is not a part of a longer Osegment. A sequence is called a $(l,m;n\sb2,\...,n\sb{t})$sequence if (a) the length of its longest solid segment is at least m, and (b) the length of each of its maximal Osegments is a multiple of m. An membedding permutation (mEP) on a $(l,m;n\sb1,n\sb2,\... n\sb{t})$sequence is a transformation that moves m contiguous pieces (without alternating their relative positions) into m contiguous empty positions such that the resulting sequence is also a $(l,m;n\sb1,n\sb2,\... n\sb{t})$sequence. For any two $(l,m;n\sb1,n\sb2,\... n\sb{t})$sequences X and Y, we define $d(X, Y)$ to be the minimum number of mEPs to transform X into Y if it can be done so otherwise we define $d(X, Y)=\infty.$ In Chapter 1, we study the general tcolor $(l,m;n\sb1,n\sb2,\...,n\sb{t})$sequences. We obtained conditions with which the distance between any two $(l,m;n\sb1,n\sb2,\..., n\sb{t})$sequences is bounded above by a linear function of $l+n\sb1+n\sb2+\...+n\sb{t}.$ In Chapter 2, we prove a longstanding conjecture. Let $X\sb0=(12)\sp{n}0\sp3,$ and $B(3, 3; n, n)=\{1\sp{n}2\sp{n}0\sp3,\ 2\sp{n}1\sp{n}0\sp3,\ 0\sp32\sp{n}1\sp{n}\}.$ C. Y. Chiang, in a paper in 1936, made the following conjecture: If n is an even integer $\ge$6, then for any $X\in B(3, 3; n, n),$ we have $d(X\sb0,X)=n+1.$ A consequence of the results of Chapter 2 is that Chiang's conjecture is true. 
Issue Date:  1996 
Type:  Text 
Language:  English 
URI:  http://hdl.handle.net/2142/20585 
ISBN:  9780591199055 
Rights Information:  Copyright 1996 Hu, ZhuXin 
Date Available in IDEALS:  20110507 
Identifier in Online Catalog:  AAI9712315 
OCLC Identifier:  (UMI)AAI9712315 
This item appears in the following Collection(s)

Graduate Dissertations and Theses at Illinois
Graduate Theses and Dissertations at Illinois 
Dissertations and Theses  Mathematics