47,471 research outputs found

    Combinatorial tools for computational group theory

    Full text link

    Merging Combinatorial Design and Optimization: the Oberwolfach Problem

    Get PDF
    The Oberwolfach Problem OP(F)OP(F), posed by Gerhard Ringel in 1967, is a paradigmatic Combinatorial Design problem asking whether the complete graph KvK_v decomposes into edge-disjoint copies of a 22-regular graph FF of order vv. In Combinatorial Design Theory, so-called difference methods represent a well-known solution technique and construct solutions in infinitely many cases exploiting symmetric and balanced structures. This approach reduces the problem to finding a well-structured 22-factor which allows us to build solutions that we call 11- or 22-rotational according to their symmetries. We tackle OPOP by modeling difference methods with Optimization tools, specifically Constraint Programming (CPCP) and Integer Programming (IPIP), and correspondingly solve instances with up to v=120v=120 within 60s60s. In particular, we model the 22-rotational method by solving in cascade two subproblems, namely the binary and group labeling, respectively. A polynomial-time algorithm solves the binary labeling, while CPCP tackles the group labeling. Furthermore, we prov ide necessary conditions for the existence of some 11-rotational solutions which stem from computational results. This paper shows thereby that both theoretical and empirical results may arise from the interaction between Combinatorial Design Theory and Operation Research

    Identification of control targets in Boolean molecular network models via computational algebra

    Get PDF
    Motivation: Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. Experimentally, node manipulation requires technology to completely repress or fully activate a particular gene product while edge manipulations only require a drug that inactivates the interaction between two gene products. Results: This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network.Comment: 12 pages, 4 figures, 2 table

    Computational Mechanism Design: A Call to Arms

    No full text
    Game theory has developed powerful tools for analyzing decision making in systems with multiple autonomous actors. These tools, when tailored to computational settings, provide a foundation for building multiagent software systems. This tailoring gives rise to the field of computational mechanism design, which applies economic principles to computer systems design

    Computational complexity of reconstruction and isomorphism testing for designs and line graphs

    Get PDF
    Graphs with high symmetry or regularity are the main source for experimentally hard instances of the notoriously difficult graph isomorphism problem. In this paper, we study the computational complexity of isomorphism testing for line graphs of tt-(v,k,λ)(v,k,\lambda) designs. For this class of highly regular graphs, we obtain a worst-case running time of O(vlog⁥v+O(1))O(v^{\log v + O(1)}) for bounded parameters t,k,λt,k,\lambda. In a first step, our approach makes use of the Babai--Luks algorithm to compute canonical forms of tt-designs. In a second step, we show that tt-designs can be reconstructed from their line graphs in polynomial-time. The first is algebraic in nature, the second purely combinatorial. For both, profound structural knowledge in design theory is required. Our results extend earlier complexity results about isomorphism testing of graphs generated from Steiner triple systems and block designs.Comment: 12 pages; to appear in: "Journal of Combinatorial Theory, Series A

    Fourteenth Biennial Status Report: MĂ€rz 2017 - February 2019

    No full text
    • 

    corecore