10,796 research outputs found

    On a generalization of Littlewood's conjecture

    Full text link
    We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL lattices by first establishing a dimension bound for the set of possible exceptions. Existence of vectors (GL-vectors) in R^d with special Diophantine properties is proved by similar methods. For dimension d >= 3 we give explicit constructions of GL lattices (and in fact a much stronger property). We also show that GLC is implied by a conjecture of G. A. Margulis concerning bounded orbits of the diagonal group. The unifying theme of the methods is to exploit rigidity results in dynamics and derive results in Diophantine approximations or the geometry of numbers.Comment: 17 page

    Corporate Philanthropy as Signaling and Co-optation

    Get PDF

    Approaches to the chemical synthesis of food

    Get PDF
    Conversion of human wastes, carbon dioxide water, and urea into food for space ration

    Small Complete Minors Above the Extremal Edge Density

    Full text link
    A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the notion of high connectivity by the notion of vertex expansion. Another well known result in graph theory states that for every integer t there is a smallest real c(t) so that every n-vertex graph with c(t)n edges contains a K_t-minor. Fiorini, Joret, Theis and Wood conjectured that if an n-vertex graph G has (c(t)+\epsilon)n edges then G contains a K_t-minor of order at most C(\epsilon)log n. We use our extension of Mader's theorem to prove that such a graph G must contain a K_t-minor of order at most C(\epsilon)log n loglog n. Known constructions of graphs with high girth show that this result is tight up to the loglog n factor
    corecore