Research articles
ScienceAsia 42(2016): 150157 doi:
10.2306/scienceasia15131874.2016.42.150
Optimal partitioning of a square: a numerical approach
Supanut Chaidee^{a,b}, Wacharin Wichiramala^{b,*}
ABSTRACT: Optimal partitioning of a square is the search for the leastdiameter way to partition a unit square into n pieces. The problem is here solved for some small n values. Although this problem has recently been approached by transforming the problem into a graphical enumeration, the algorithm had too large a computational cost for cases of n≥7. In this paper, the existence of solutions in a more general sense is established and the graphical transformation method is improved by generating dual graphs of the combinatorial patterns. In particular, combinatorial patterns were generated using the triangulation of planar graphs. Theorems to eliminate some unnecessary partitions are presented and numerical optimization by convex programming is used to find the minimum diameters. Our results confirm the earlier reported cases for n=9 and 10 and the predictions made for the case of n=11.
Download PDF
5 Downloads 148 Views
^{a} 
Graduate School of Advanced Mathematical Sciences, Meiji University, 4211 Nakano, Nakanoku, Tokyo 1648525, Japan 
^{b} 
Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, 254 Phayathai Road, Pathumwan, Bangkok 10330 Thailand 
* Corresponding author, Email: wacharin.w@chula.ac.th
Received 9 Mar 2015, Accepted 0 0000
