2,514 research outputs found

    The complexity of classifying separable Banach spaces up to isomorphism

    Full text link
    It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism provide complete invariants for a great number of mathematical structures up to their corresponding notion of isomorphism. The same is shown to hold for (1) complete separable metric spaces up to uniform homeomorphism, (2) separable Banach spaces up to Lipschitz isomorphism, and (3) up to (complemented) biembeddability, (4) Polish groups up to topological isomorphism, and (5) Schauder bases up to permutative equivalence. Some of the constructions rely on methods recently developed by S. Argyros and P. Dodos

    STS: a structural theory of sets

    Get PDF

    Codes from adjacency matrices of uniform subset graphs

    Get PDF
    Studies of the p-ary codes from the adjacency matrices of uniform subset graphs Γ(n,k,r)Γ(n,k,r) and their reflexive associates have shown that a particular family of codes defined on the subsets are intimately related to the codes from these graphs. We describe these codes here and examine their relation to some particular classes of uniform subset graphs. In particular we include a complete analysis of the p-ary codes from Γ(n,3,r)Γ(n,3,r) for p≥5p≥5 , thus extending earlier results for p=2,3p=2,3
    • …
    corecore