Disjoint Intersection Problem For Steiner Triple Systems
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Rodger, Chris | |
| dc.contributor.advisor | Hoffman, Dean G. | en_US |
| dc.contributor.advisor | Lindner, Charles C. | en_US |
| dc.contributor.advisor | Johnson, Peter D., Jr. | en_US |
| dc.contributor.advisor | Billor, Nedret | en_US |
| dc.contributor.author | Srinivasan, Sangeetha | en_US |
| dc.date.accessioned | 2008-09-09T21:14:07Z | |
| dc.date.available | 2008-09-09T21:14:07Z | |
| dc.date.issued | 2007-12-15 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10415/111 | |
| dc.description.abstract | Let (S, T_1) and (S, T_2) be two Steiner Triple systems on the set S of symbols with the set of triples T_1 and T_2 respectively. They are said to intersect in m blocks if |T_1 intersection T_2| = m. Further, if the blocks in T_1 intersection T_2 are pairwise disjoint then (S, T_1) and (S, T_2) are said to intersect in m pairwise disjoint blocks and are said to have disjoint intersection. The Disjoint Intersection Problem for Steiner Triple Systems is to completely determine Int_d(v) = set of all m such that, there exist two Steiner triple systems of order v intersecting in m pairwise disjoint blocks. Int_d(v) was determined by Chee. Here we describe a different proof of his result using a modification of the Bose and Skolem Constructions. | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Disjoint Intersection Problem For Steiner Triple Systems | en_US |
| dc.type | Thesis | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |