198 research outputs found

    Geometrical Frustration: A Study of 4d Hard Spheres

    Full text link
    The smallest maximum kissing-number Voronoi polyhedron of 3d spheres is the icosahedron and the tetrahedron is the smallest volume that can show up in Delaunay tessalation. No periodic lattice is consistent with either and hence these dense packings are geometrically frustrated. Because icosahedra can be assembled from almost perfect tetrahedra, the terms "icosahedral" and "polytetrahedral" packing are often used interchangeably, which leaves the true origin of geometric frustration unclear. Here we report a computational study of freezing of 4d hard spheres, where the densest Voronoi cluster is compatible with the symmetry of the densest crystal, while polytetrahedral order is not. We observe that, under otherwise comparable conditions, crystal nucleation in 4d is less facile than in 3d. This suggest that it is the geometrical frustration of polytetrahedral structures that inhibits crystallization.Comment: 4 pages, 3 figures; revised interpretatio

    On colouring point visibility graphs

    Full text link
    In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can also be constructed in polynomial time. We show that the problem of deciding whether the visibility graph of a point set is 5-colourable, is NP-complete. We give an example of a point visibility graph that has chromatic number 6 while its clique number is only 4

    On Approximately Symmetric Informationally Complete Positive Operator-Valued Measures and Related Systems of Quantum States

    Full text link
    We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension nn consisting of n2n^2 operators of rank one which have an inner product close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. However, SIC-POVMs are notoriously hard to construct and despite some success of constructing them numerically, there is no analytic construction known. We present two constructions of approximate versions of SIC-POVMs, where a small deviation from uniformity of the inner products is allowed. The first construction is based on selecting vectors from a maximal collection of mutually unbiased bases and works whenever the dimension of the system is a prime power. The second construction is based on perturbing the matrix elements of a subset of mutually unbiased bases. Moreover, we construct vector systems in \C^n which are almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on results of analytic number theory.Comment: 29 pages, LaTe

    On the Low Rank Solutions for Linear Matrix Inequalities

    Full text link
    • …
    corecore