54 research outputs found

    Integer flows and Modulo Orientations

    Get PDF
    Tutte\u27s 3-flow conjecture (1970\u27s) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. A graph G admits a nowhere-zero 3-flow if and only if G has an orientation such that the out-degree equals the in-degree modulo 3 for every vertex. In the 1980ies Jaeger suggested some related conjectures. The generalized conjecture to modulo k-orientations, called circular flow conjecture, says that, for every odd natural number k, every (2k-2)-edge-connected graph has an orientation such that the out-degree equals the in-degree modulo k for every vertex. And the weaker conjecture he made, known as the weak 3-flow conjecture where he suggests that the constant 4 is replaced by any larger constant.;The weak version of the circular flow conjecture and the weak 3-flow conjecture are verified by Thomassen (JCTB 2012) recently. He proved that, for every odd natural number k, every (2k 2 + k)-edge-connected graph has an orientation such that the out-degree equals the in-degree modulo k for every vertex and for k = 3 the edge-connectivity 8 suffices. Those proofs are refined in this paper to give the same conclusions for 9 k-edge-connected graphs and for 6-edge-connected graphs when k = 3 respectively

    Informationally Complete Measurements and Optimal Representations of Quantum Theory

    Get PDF
    Minimal informationally complete quantum measurements (MICs) furnish probabilistic representations of quantum theory. These representations cleanly present the Born rule as an additional constraint in probabilistic decision theory, a perspective advanced by QBism. Because of this, their structure illuminates important ways in which quantum theory differs from classical physics. MICs have, however, so far received relatively little attention. In this dissertation, we investigate some of their general properties and relations to other topics in quantum information. A special type of MIC called a symmetric informationally complete measurement makes repeated appearances as the optimal or extremal solution in distinct settings, signifying they play a significant foundational role. Once the general structure of MICs is more fully explicated, we speculate that the representation will have unique advantages analogous to the phase space and path integral formulations. On the conceptual side, the reasons for QBism continue to grow. Most recently, extensions to the Wigner\u27s friend paradox have threatened the consistency of many interpretations. QBism\u27s resolution is uniquely simple and powerful, further strengthening the evidence for this interpretation

    35th Symposium on Theoretical Aspects of Computer Science: STACS 2018, February 28-March 3, 2018, Caen, France

    Get PDF

    36th International Symposium on Theoretical Aspects of Computer Science: STACS 2019, March 13-16, 2019, Berlin, Germany

    Get PDF

    LIPIcs, Volume 248, ISAAC 2022, Complete Volume

    Get PDF
    LIPIcs, Volume 248, ISAAC 2022, Complete Volum

    27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany

    Get PDF

    Security of Ubiquitous Computing Systems

    Get PDF
    The chapters in this open access book arise out of the EU Cost Action project Cryptacus, the objective of which was to improve and adapt existent cryptanalysis methodologies and tools to the ubiquitous computing framework. The cryptanalysis implemented lies along four axes: cryptographic models, cryptanalysis of building blocks, hardware and software security engineering, and security assessment of real-world systems. The authors are top-class researchers in security and cryptography, and the contributions are of value to researchers and practitioners in these domains. This book is open access under a CC BY license

    Proceedings of the Seventh Congress of the European Society for Research in Mathematics Education

    Get PDF
    International audienceThis volume contains the Proceedings of the Seventh Congress of the European Society for Research in Mathematics Education (ERME), which took place 9-13 February 2011, at Rzeszñw in Poland

    Towards efficient proofs of storage and verifiable outsourced database in cloud computing

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH
    corecore