We discuss the polynomial convexity of compact sets in C^n by applying Kallin’s separation lemma. For example, finite number of balls in C^n, 3 disjoint polydiscs in C^2, edges of tetrahedron in C^2 and trees.
1.E. Kallin, Polynomial convexity: The three spheres problem, conference on complex analysis held in Minneapolis, 1964, Springer-Verlag, Berlin, 1965, pp. 301-304.
Yao, G. C. (2015). 利用線性規劃針對非線性多項式函數在隨機電路上之合成的研究 [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-1802201617063311
Chen, S. Y. (2011). 非常好覆蓋圖形獨立多項式之單峰性及對數凹性與一些互相連結網路之拓撲性質 [doctoral dissertation, Chung Yuan Christian University]. Airiti Library. https://doi.org/10.6840/CYCU.2011.00025