Fullerenes with the maximum Clar number

The Clar number of a fullerene is the maximum number of independent resonant hexagons in the fullerene. It is known that the Clar number of a fullerene with n vertices is bounded above by [n/6]-2. We find that there are no fullerenes whose order n is congruent to 2 modulo 6 attaining this bound. In other words, the Clar number for a fullerene whose order n is congruent to 2 modulo 6 is bounded above by [n/6]-3. Moreover, we show that two experimentally produced fullerenes C80:1 (D5d) and C80:2 (D2) attain this bound. Finally, we present a graph-theoretical characterization for fullerenes, whose order n is congruent to 2 (respectively, 4) modulo 6, achieving the maximum Clar number [n/6]-3 (respectively, [n/6]-2)

Compatible 4-Holes in Point Sets

Counting interior-disjoint empty convex polygons in a point set is a typical Erd\H{o}s-Szekeres-type problem. We study this problem for 4-gons. Let $P$ be a set of $n$ points in the plane and in general position. A subset $Q$ of $P$, with four points, is called a $4$-hole in $P$ if $Q$ is in convex position and its convex hull does not contain any point of $P$ in its interior. Two 4-holes in $P$ are compatible if their interiors are disjoint. We show that $P$ contains at least $\lfloor 5n/11\rfloor {-} 1$ pairwise compatible 4-holes. This improves the lower bound of $2\lfloor(n-2)/5\rfloor$ which is implied by a result of Sakai and Urrutia (2007).Comment: 17 page

Discrete complex analysis on planar quad-graphs

We develop a linear theory of discrete complex analysis on general quad-graphs, continuing and extending previous work of Duffin, Mercat, Kenyon, Chelkak and Smirnov on discrete complex analysis on rhombic quad-graphs. Our approach based on the medial graph yields more instructive proofs of discrete analogs of several classical theorems and even new results. We provide discrete counterparts of fundamental concepts in complex analysis such as holomorphic functions, derivatives, the Laplacian, and exterior calculus. Also, we discuss discrete versions of important basic theorems such as Green's identities and Cauchy's integral formulae. For the first time, we discretize Green's first identity and Cauchy's integral formula for the derivative of a holomorphic function. In this paper, we focus on planar quad-graphs, but we would like to mention that many notions and theorems can be adapted to discrete Riemann surfaces in a straightforward way. In the case of planar parallelogram-graphs with bounded interior angles and bounded ratio of side lengths, we construct a discrete Green's function and discrete Cauchy's kernels with asymptotics comparable to the smooth case. Further restricting to the integer lattice of a two-dimensional skew coordinate system yields appropriate discrete Cauchy's integral formulae for higher order derivatives.Comment: 49 pages, 8 figure