Lower bounds for several online variants of bin packing

We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.Comment: WAOA 201

Hyperuniformity, quasi-long-range correlations, and void-space constraints in maximally random jammed particle packings. I. Polydisperse spheres

Hyperuniform many-particle distributions possess a local number variance that grows more slowly than the volume of an observation window, implying that the local density is effectively homogeneous beyond a few characteristic length scales. Previous work on maximally random strictly jammed sphere packings in three dimensions has shown that these systems are hyperuniform and possess unusual quasi-long-range pair correlations, resulting in anomalous logarithmic growth in the number variance. However, recent work on maximally random jammed sphere packings with a size distribution has suggested that such quasi-long-range correlations and hyperuniformity are not universal among jammed hard-particle systems. In this paper we show that such systems are indeed hyperuniform with signature quasi-long-range correlations by characterizing the more general local-volume-fraction fluctuations. We argue that the regularity of the void space induced by the constraints of saturation and strict jamming overcomes the local inhomogeneity of the disk centers to induce hyperuniformity in the medium with a linear small-wavenumber nonanalytic behavior in the spectral density, resulting in quasi-long-range spatial correlations. A numerical and analytical analysis of the pore-size distribution for a binary MRJ system in addition to a local characterization of the n-particle loops governing the void space surrounding the inclusions is presented in support of our argument. This paper is the first part of a series of two papers considering the relationships among hyperuniformity, jamming, and regularity of the void space in hard-particle packings.Comment: 40 pages, 15 figure

A Dense Packing of Regular Tetrahedra

We construct a dense packing of regular tetrahedra, with packing density $D > >.7786157$.Comment: full color versio

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible

We analyze the computational complexity of the many types of pencil-and-paper-style puzzles featured in the 2016 puzzle video game The Witness. In all puzzles, the goal is to draw a simple path in a rectangular grid graph from a start vertex to a destination vertex. The different puzzle types place different constraints on the path: preventing some edges from being visited (broken edges); forcing some edges or vertices to be visited (hexagons); forcing some cells to have certain numbers of incident path edges (triangles); or forcing the regions formed by the path to be partially monochromatic (squares), have exactly two special cells (stars), or be singly covered by given shapes (polyominoes) and/or negatively counting shapes (antipolyominoes). We show that any one of these clue types (except the first) is enough to make path finding NP-complete ("witnesses exist but are hard to find"), even for rectangular boards. Furthermore, we show that a final clue type (antibody), which necessarily "cancels" the effect of another clue in the same region, makes path finding $\Sigma_2$-complete ("witnesses do not exist"), even with a single antibody (combined with many anti/polyominoes), and the problem gets no harder with many antibodies. On the positive side, we give a polynomial-time algorithm for monomino clues, by reducing to hexagon clues on the boundary of the puzzle, even in the presence of broken edges, and solving "subset Hamiltonian path" for terminals on the boundary of an embedded planar graph in polynomial time.Comment: 72 pages, 59 figures. Revised proof of Lemma 3.5. A short version of this paper appeared at the 9th International Conference on Fun with Algorithms (FUN 2018