Presentation	2000/6/19 COMP2000-17 Counting of the topological dissections by Reduct-Seq Representation Keishi SAKANUSHI, Yoji KAJITANI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	A rectangular dissection is a partition of a given rectangle into n rectangles. We introduce a new representation of the rectangular dissection called the Reduct-Seq. The Reduct-Seq is a sequence of length 3n whose entities are room names and two kinds of incident signs. The Reduct-Seq is Characterized by simple four properties. Then it is shown that there is a 1-1 correspondece between the Reduct-Seq's and the rectangular dissections. We present the counting formular of the exact number of the distinct rectangular dissections by using the Reduct-Seq, and an upper bound of that number.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Reduct-Seq / rectangular dissections / counting
Paper #	COMP2000-17
Date of Issue

Conference Information
Committee	COMP
Conference Date	2000/6/19(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Theoretical Foundations of Computing (COMP)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	COMP2000-17 Counting of the topological dissections by Reduct-Seq Representation
Sub Title (in English)
Keyword(1)	Reduct-Seq
Keyword(2)	rectangular dissections
Keyword(3)	counting
1st Author's Name	Keishi SAKANUSHI
1st Author's Affiliation	Department of Communications and Integrated Systems, Tokyo Institute of Technology()
2nd Author's Name	Yoji KAJITANI
2nd Author's Affiliation	Department of Communications and Integrated Systems, Tokyo Institute of Technology
Date	2000/6/19
Paper #	COMP2000-17
Volume (vol)	vol.100
Number (no)	144
Page	pp.pp.-
#Pages	8
Date of Issue