Polygon dissections and some generalizations of cluster complexes

Let $W$ be a Weyl group corresponding to the root system $A_{n-1}$ or $B_n$. We define a simplicial complex $\Delta^m_W$ in terms of polygon dissections for such a group and any positive integer $m$. For $m=1$, $\Delta^m_W$ is isomorphic to the cluster complex corresponding to $W$, defined in \cite{FZ}. We enumerate the faces of $\Delta^m_W$ and show that the entries of its $h$-vector are given by the generalized Narayana numbers $N^m_W(i)$, defined in \cite{Atha3}. We also prove that for any $m \geq 1$ the complex $\Delta^m_W$ is shellable and hence Cohen-Macaulay.Comment: 9 pages, 3 figures, the type D case has been removed, some corrections on the proof of Theorem 3.1 have been made. To appear in JCT

The maximum number of faces of the Minkowski sum of two convex polytopes

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes. For even dimensions $d\ge{}2$, the maximum values are attained when $P_1$ and $P_2$ are cyclic $d$-polytopes with disjoint vertex sets. For odd dimensions $d\ge{}3$, the maximum values are attained when $P_1$ and $P_2$ are $\lfloor\frac{d}{2}\rfloor$-neighborly $d$-polytopes, whose vertex sets are chosen appropriately from two distinct $d$-dimensional moment-like curves.Comment: 37 pages, 8 figures, conference version to appear at SODA 2012; v2: fixed typos, made stylistic changes, added figure

A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined) function on the number of vertices of the polytopes. Our results coincide with those recently proved by Adiprasito and Sanyal [2]. In contrast to Adiprasito and Sanyal's approach, which uses tools from Combinatorial Commutative Algebra, our approach is purely geometric and uses basic notions such as $f$- and $h$-vector calculus and shellings, and generalizes the methodology used in [15] and [14] for proving upper bounds on the $f$-vector of the Minkowski sum of two and three convex polytopes, respectively. The key idea behind our approach is to express the Minkowski sum $P_1+...+P_r$ as a section of the Cayley polytope $\mathcal{C}$ of the summands; bounding the $k$-faces of $P_1+...+P_r$ reduces to bounding the subset of the $(k+r-1)$-faces of $\mathcal{C}$ that contain vertices from each of the $r$ polytopes. We end our paper with a sketch of an explicit construction that establishes the tightness of the upper bounds.Comment: 43 pages; minor changes (mostly typos

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of $\Sigma$ is $\Theta(\sum_{1\le{}i\ne{}j\le{}m}n_in_j^{\lfloor\frac{d}{2}\rfloor})$, where $n_i$ is the number of spheres in $\Sigma$ with radius $\rho_i$. To prove the lower bound, we construct a set of $\Theta(n_1+n_2)$ spheres in $\mathbb{E}^d$, with $d\ge{}3$ odd, where $n_i$ spheres have radius $\rho_i$, $i=1,2$, and $\rho_2\ne\rho_1$, such that their convex hull has combinatorial complexity $\Omega(n_1n_2^{\lfloor\frac{d}{2}\rfloor}+n_2n_1^{\lfloor\frac{d}{2}\rfloor})$. Our construction is then generalized to the case where the spheres have $m\ge{}3$ distinct radii. For the upper bound, we reduce the sphere convex hull problem to the problem of computing the worst-case combinatorial complexity of the convex hull of a set of $m$ $d$-dimensional convex polytopes lying on $m$ parallel hyperplanes in $\mathbb{E}^{d+1}$, where $d\ge{}3$ odd, a problem which is of independent interest. More precisely, we show that the worst-case combinatorial complexity of the convex hull of a set $\{\mathcal{P}_1,\mathcal{P}_2,...,\mathcal{P}_m\}$ of $m$ $d$-dimensional convex polytopes lying on $m$ parallel hyperplanes of $\mathbb{E}^{d+1}$ is $O(\sum_{1\le{}i\ne{}j\le{}m}n_in_j^{\lfloor\frac{d}{2}\rfloor})$, where $n_i$ is the number of vertices of $\mathcal{P}_i$. We end with algorithmic considerations, and we show how our tight bounds for the parallel polytope convex hull problem, yield tight bounds on the combinatorial complexity of the Minkowski sum of two convex polytopes in $\mathbb{E}^d$.Comment: 22 pages, 5 figures, new proof of upper bound for the complexity of the convex hull of parallel polytopes (the new proof gives upper bounds for all face numbers of the convex hull of the parallel polytopes

Counting Shi regions with a fixed separating wall

Athanasiadis introduced separating walls for a region in the extended Shi arrangement and used them to generalize the Narayana numbers. In this paper, we fix a hyperplane in the extended Shi arrangement for type A and calculate the number of dominant regions which have the fixed hyperplane as a separating wall; that is, regions where the hyperplane supports a facet of the region and separates the region from the origin.Comment: To appear in Annals of Combinatoric