17 research outputs found

    On the Densest Packing of Polycylinders in Any Dimension

    Get PDF

    Bounding basis reduction properties

    Get PDF
    The paper describes improved analysis techniques for basis reduction that allow one to prove strong complexity bounds and reduced basis guarantees for traditional reduction algorithms and some of their variants. This is achieved by a careful exploitation of the linear equations and inequalities relating various bit sizes before and after one or more reduction steps

    Badly approximable points on manifolds

    Get PDF
    Addressing a problem of Davenport we show that any finite intersection of the sets of weighted badly approximable points on any analytic nondegenerate manifold in has full dimension. This also extends Schmidt's conjecture on badly approximable points to arbitrary dimensions

    G-birational rigidity of the projective plane

    No full text

    Geometric Sets of Permutations

    No full text
    corecore