The decomposition of the hypermetric cone into L-domains

The hypermetric cone \HYP_{n+1} is the parameter space of basic Delaunay polytopes in n-dimensional lattice. The cone \HYP_{n+1} is polyhedral; one way of seeing this is that modulo image by the covariance map \HYP_{n+1} is a finite union of L-domains, i.e., of parameter space of full Delaunay tessellations. In this paper, we study this partition of the hypermetric cone into L-domains. In particular, it is proved that the cone \HYP_{n+1} of hypermetrics on n+1 points contains exactly {1/2}n! principal L-domains. We give a detailed description of the decomposition of \HYP_{n+1} for n=2,3,4 and a computer result for n=5 (see Table \ref{TableDataHYPn}). Remarkable properties of the root system $\mathsf{D}_4$ are key for the decomposition of \HYP_5.Comment: 20 pages 2 figures, 2 table

Comparing Perfect and 2nd Voronoi decompositions: the matroidal locus

We compare two rational polyhedral admissible decompositions of the cone of positive definite quadratic forms: the perfect cone decomposition and the 2nd Voronoi decomposition. We determine which cones belong to both the decompositions, thus providing a positive answer to a conjecture of V. Alexeev and A. Brunyate. As an application, we compare the two associated toroidal compactifications of the moduli space of principal polarized abelian varieties: the perfect cone compactification and the 2nd Voronoi compactification.Comment: 27 pages, 2 figures, final version, to appear in Mathematische Annale

Diamond Dicing

In OLAP, analysts often select an interesting sample of the data. For example, an analyst might focus on products bringing revenues of at least 100 000 dollars, or on shops having sales greater than 400 000 dollars. However, current systems do not allow the application of both of these thresholds simultaneously, selecting products and shops satisfying both thresholds. For such purposes, we introduce the diamond cube operator, filling a gap among existing data warehouse operations. Because of the interaction between dimensions the computation of diamond cubes is challenging. We compare and test various algorithms on large data sets of more than 100 million facts. We find that while it is possible to implement diamonds in SQL, it is inefficient. Indeed, our custom implementation can be a hundred times faster than popular database engines (including a row-store and a column-store).Comment: 29 page

Demonstration of the feasibility of automated silicon solar cell fabrication

An analysis of estimated costs indicate that for an annual output of 4,747,000 hexagonal cells (38 mm. on a side) a total factory cost of $0.866 per cell could be achieved. For cells with 14$1.22 per watt of electrical output. A laboratory model of such a facility was operated to produce a series of demonstration runs, producing hexagonal cells, 2 x 2 cm cells and 2 x 4 cm cells