7,466 research outputs found

    Twisted Permutation Codes

    Get PDF
    We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a lower bound for the minimum distance of a twisted permutation code is the minimum distance of a repetition permutation code. We give examples where this bound is tight, but more importantly, we give examples of twisted permutation codes with minimum distance strictly greater than this lower bound.Comment: 20 page

    Fastest mixing Markov chain on graphs with symmetries

    Full text link
    We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition probability matrix). Exploiting symmetry can lead to significant reduction in both the number of variables and the size of matrices in the corresponding semidefinite program, thus enable numerical solution of large-scale instances that are otherwise computationally infeasible. We obtain analytic or semi-analytic results for particular classes of graphs, such as edge-transitive and distance-transitive graphs. We describe two general approaches for symmetry exploitation, based on orbit theory and block-diagonalization, respectively. We also establish the connection between these two approaches.Comment: 39 pages, 15 figure

    Tits Geometry and Positive Curvature

    Full text link
    There is a well known link between (maximal) polar representations and isotropy representations of symmetric spaces provided by Dadok. Moreover, the theory by Tits and Burns-Spatzier provides a link between irreducible symmetric spaces of non-compact type of rank at least three and irreducible topological spherical buildings of rank at least three. We discover and exploit a rich structure of a (connected) chamber system of finite (Coxeter) type M associated with any polar action of cohomogeneity at least two on any simply connected closed positively curved manifold. Although this chamber system is typically not a Tits geometry of type M, we prove that in all cases but two that its universal Tits cover indeed is a building. We construct a topology on this universal cover making it into a compact spherical building in the sense of Burns and Spatzier. Using this structure we classify up to equivariant diffeomorphism all polar actions on (simply connected) positively curved manifolds of cohomogeneity at least two.Comment: 43 pages, to appear in Acta Mathematic

    Homogeneous compact geometries

    Full text link
    We classify compact homogeneous geometries of irreducible spherical type and rank at least 2 which admit a transitive action of a compact connected group, up to equivariant 2-coverings. We apply our classification to polar actions on compact symmetric spaces.Comment: To appear in: Transformation Group
    corecore