Algorithms for Highly Symmetric Linear and Integer Programs

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

Space group symmetry fractionalization in a chiral kagome Heisenberg antiferromagnet

The anyonic excitations of a spin-liquid can feature fractional quantum numbers under space-group symmetries. Detecting these fractional quantum numbers, which are analogs of the fractional charge of Laughlin quasiparticles, may prove easier than the direct observation of anyonic braiding and statistics. Motivated by the recent numerical discovery of spin-liquid phases in the kagome Heisenberg antiferromagnet, we theoretically predict the pattern of space group symmetry fractionalization in the kagome lattice chiral spin liquid. We provide a method to detect these fractional quantum numbers in finite-size numerics which is simple to implement in DMRG. Applying these developments to the chiral spin liquid phase of a kagome Heisenberg model, we find perfect agreement between our theoretical prediction and numerical observations.Comment: 5 pages plus appendi

Breaking Instance-Independent Symmetries In Exact Graph Coloring

Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI, such as planning, time-tabling and scheduling. Provably optimal solutions may be desirable for commercial and defense applications. Additionally, for applications such as register allocation and code optimization, naturally-occurring instances of graph coloring are often small and can be solved optimally. A recent wave of improvements in algorithms for Boolean satisfiability (SAT) and 0-1 Integer Linear Programming (ILP) suggests generic problem-reduction methods, rather than problem-specific heuristics, because (1) heuristics may be upset by new constraints, (2) heuristics tend to ignore structure, and (3) many relevant problems are provably inapproximable. Problem reductions often lead to highly symmetric SAT instances, and symmetries are known to slow down SAT solvers. In this work, we compare several avenues for symmetry breaking, in particular when certain kinds of symmetry are present in all generated instances. Our focus on reducing CSPs to SAT allows us to leverage recent dramatic improvement in SAT solvers and automatically benefit from future progress. We can use a variety of black-box SAT solvers without modifying their source code because our symmetry-breaking techniques are static, i.e., we detect symmetries and add symmetry breaking predicates (SBPs) during pre-processing. An important result of our work is that among the types of instance-independent SBPs we studied and their combinations, the simplest and least complete constructions are the most effective. Our experiments also clearly indicate that instance-independent symmetries should mostly be processed together with instance-specific symmetries rather than at the specification level, contrary to what has been suggested in the literature

An Integer Programming Approach to Fuzzy Symmetry Detection

The problem of exact symmetry detection in general graphs has received much attention recently. In spite of its NP-hardness, two different algorithms have been presented that in general can solve this problem quickly in practice. However, as most graphs do not admit any exact symmetry at all, the much harder problem of fuzzy symmetry detection arises: a minimal number of certain modifications of the graph should be allowed in order to make it symmetric. We present a general approach to this problem: we allow arbitrary edge deletions and edge creations; every single modification can be given an individual weight. We apply integer programming techniques to solve this problem exactly or heuristically and give runtime results for a first implementation

Bose-Fermi duality and entanglement entropies

Entanglement (Renyi) entropies of spatial regions are a useful tool for characterizing the ground states of quantum field theories. In this paper we investigate the extent to which these are universal quantities for a given theory, and to which they distinguish different theories, by comparing the entanglement spectra of the massless Dirac fermion and the compact free boson in two dimensions. We show that the calculation of Renyi entropies via the replica trick for any orbifold theory includes a sum over orbifold twists on all cycles. In a modular-invariant theory of fermions, this amounts to a sum over spin structures. The result is that the Renyi entropies respect the standard Bose-Fermi duality. Next, we investigate the entanglement spectrum for the Dirac fermion without a sum over spin structures, and for the compact boson at the self-dual radius. These are not equivalent theories; nonetheless, we find that (1) their second Renyi entropies agree for any number of intervals, (2) their full entanglement spectra agree for two intervals, and (3) the spectrum generically disagrees otherwise. These results follow from the equality of the partition functions of the two theories on any Riemann surface with imaginary period matrix. We also exhibit a map between the operators of the theories that preserves scaling dimensions (but not spins), as well as OPEs and correlators of operators placed on the real line. All of these coincidences can be traced to the fact that the momentum lattice for the bosonized fermion is related to that of the self-dual boson by a 45 degree rotation that mixes left- and right-movers.Comment: 40 pages; v3: improvements to presentation, new section discussing entanglement negativit

Symmetry Breaking for Answer Set Programming

In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. We also propose an encoding of symmetry-breaking constraints in terms of permutation cycles and use only generators in this process which implicitly represent symmetries and always with exponential compression. These ideas are formulated as preprocessing and implemented in a completely automated flow that first detects symmetries from a given answer set program, adds symmetry-breaking constraints, and can be applied to any existing answer set solver. We demonstrate computational impact on benchmarks versus direct application of the solver. Furthermore, we explore symmetry breaking for answer set programming in two domains: first, constraint answer set programming as a novel approach to represent and solve constraint satisfaction problems, and second, distributed nonmonotonic multi-context systems. In particular, we formulate a translation-based approach to constraint answer set solving which allows for the application of our symmetry detection and symmetry breaking methods. To compare their performance with a-priori symmetry breaking techniques, we also contribute a decomposition of the global value precedence constraint that enforces domain consistency on the original constraint via the unit-propagation of an answer set solver. We evaluate both options in an empirical analysis. In the context of distributed nonmonotonic multi-context system, we develop an algorithm for distributed symmetry detection and also carry over symmetry-breaking constraints for distributed answer set programming.Comment: Diploma thesis. Vienna University of Technology, August 201