17,757 research outputs found

    Classifying C∗C^*-algebras with both finite and infinite subquotients

    Full text link
    We give a classification result for a certain class of C∗C^{*}-algebras A\mathfrak{A} over a finite topological space XX in which there exists an open set UU of XX such that UU separates the finite and infinite subquotients of A\mathfrak{A}. We will apply our results to C∗C^{*}-algebras arising from graphs.Comment: Version III: No changes to the text. We only report that Lemma 4.5 is not correct as stated. See arXiv:1505.05951 for the corrected version of Lemma 4.5. As noted in arXiv:1505.05951, the main results of this paper are true verbatim. Version II: Improved some results in Section 3 and loosened the assumptions in Definition 4.

    Enclosings of Decompositions of Complete Multigraphs in 22-Edge-Connected rr-Factorizations

    Full text link
    A decomposition of a multigraph GG is a partition of its edges into subgraphs G(1),…,G(k)G(1), \ldots , G(k). It is called an rr-factorization if every G(i)G(i) is rr-regular and spanning. If GG is a subgraph of HH, a decomposition of GG is said to be enclosed in a decomposition of HH if, for every 1≤i≤k1 \leq i \leq k, G(i)G(i) is a subgraph of H(i)H(i). Feghali and Johnson gave necessary and sufficient conditions for a given decomposition of λKn\lambda K_n to be enclosed in some 22-edge-connected rr-factorization of μKm\mu K_{m} for some range of values for the parameters nn, mm, λ\lambda, μ\mu, rr: r=2r=2, μ>λ\mu>\lambda and either m≥2n−1m \geq 2n-1, or m=2n−2m=2n-2 and μ=2\mu = 2 and λ=1\lambda=1, or n=3n=3 and m=4m=4. We generalize their result to every r≥2r \geq 2 and m≥2n−2m \geq 2n - 2. We also give some sufficient conditions for enclosing a given decomposition of λKn\lambda K_n in some 22-edge-connected rr-factorization of μKm\mu K_{m} for every r≥3r \geq 3 and m=(2−C)nm = (2 - C)n, where CC is a constant that depends only on rr, λ\lambda and~μ\mu.Comment: 17 pages; fixed the proof of Theorem 1.4 and other minor change

    Hurwitz equivalence of braid monodromies and extremal elliptic surfaces

    Get PDF
    We discuss the equivalence between the categories of certain ribbon graphs and subgroups of the modular group Γ\Gamma and use it to construct exponentially large families of not Hurwitz equivalent simple braid monodromy factorizations of the same element. As an application, we also obtain exponentially large families of {\it topologically} distinct algebraic objects such as extremal elliptic surfaces, real trigonal curves, and real elliptic surfaces
    • …
    corecore