19 research outputs found

    Polyhedral representation conversion up to symmetries

    Full text link

    Automorphism groups of root system matroids

    Get PDF
    AbstractGiven a root system R, the vector system R̃ is obtained by taking a representative v in each antipodal pair {v,−v}. The matroid M(R) is formed by all independent subsets of R̃. The automorphism group of a matroid is the group of permutations preserving its independent subsets. We prove that the automorphism groups of all irreducible root system matroids M(R) are uniquely determined by their independent sets of size 3. As a corollary, we compute these groups explicitly, and thus complete the classification of the automorphism groups of root system matroids

    Computing symmetry groups of polyhedra

    Full text link
    Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a polyhedron. In each case we give algorithmic methods to compute the corresponding group and discuss some practical experiences. For practical purposes the linear symmetry group is the most important, as its computation can be directly translated into a graph automorphism problem. We indicate how to compute integral subgroups of the linear symmetry group that are used for instance in integer linear programming.Comment: 20 pages, 1 figure; containing a corrected and improved revisio

    Algorithms for Highly Symmetric Linear and Integer Programs

    Get PDF
    This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of lower dimension. Combining this approach with knowledge of the geometry of feasible integer solutions yields an algorithm for solving highly symmetric integer linear programs which only takes time which is linear in the number of constraints and quadratic in the dimension.Comment: 21 pages, 1 figure; some references and further comments added, title slightly change
    corecore