Enumerating Minimal Dominating Sets in Chordal Bipartite Graphs *

Abstract We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time. Enumeration of minimal dominating sets in graphs is equivalent to enumeration of minimal transversals in hypergraphs. Whether the minimal transversals of a hypergraph can be enumerated in output polynomial time is a well-studied and challenging question that has been open for several decades. With this result we contribute to the known cases having an affirmative reply to this important question

A Combinatorial Approach to Nonlocality and Contextuality

So far, most of the literature on (quantum) contextuality and the Kochen-Specker theorem seems either to concern particular examples of contextuality, or be considered as quantum logic. Here, we develop a general formalism for contextuality scenarios based on the combinatorics of hypergraphs which significantly refines a similar recent approach by Cabello, Severini and Winter (CSW). In contrast to CSW, we explicitly include the normalization of probabilities, which gives us a much finer control over the various sets of probabilistic models like classical, quantum and generalized probabilistic. In particular, our framework specializes to (quantum) nonlocality in the case of Bell scenarios, which arise very naturally from a certain product of contextuality scenarios due to Foulis and Randall. In the spirit of CSW, we find close relationships to several graph invariants. The recently proposed Local Orthogonality principle turns out to be a special case of a general principle for contextuality scenarios related to the Shannon capacity of graphs. Our results imply that it is strictly dominated by a low level of the Navascu\'es-Pironio-Ac\'in hierarchy of semidefinite programs, which we also apply to contextuality scenarios. We derive a wealth of results in our framework, many of these relating to quantum and supraquantum contextuality and nonlocality, and state numerous open problems. For example, we show that the set of quantum models on a contextuality scenario can in general not be characterized in terms of a graph invariant. In terms of graph theory, our main result is this: there exist two graphs $G_1$ and $G_2$ with the properties \begin{align*} \alpha(G_1) &= \Theta(G_1), & \alpha(G_2) &= \vartheta(G_2), \\[6pt] \Theta(G_1\boxtimes G_2) & > \Theta(G_1)\cdot \Theta(G_2),& \Theta(G_1 + G_2) & > \Theta(G_1) + \Theta(G_2). \end{align*}Comment: minor revision, same results as in v2, to appear in Comm. Math. Phy

Exact Transversal Hypergraphs and Application to Boolean µ-Functions

Call an hypergraph, that is a family of subsets (edges) from a finite vertex set, an exact transversal hypergraph iff each of its minimal transversals, i.e., minimal vertex subsets that intersect each edge, meets each edge in a singleton. We show that such hypergraphs are recognizable in polynomial time and that their minimal transversals as well as their maximal independent sets can be generated in lexicographic order with polynomial delay between subsequent outputs, which is impossible in the general case unless P = NP. The results obtained are applied to monotone Boolean µ-functions, that are Boolean functions defined by a monotone Boolean expression (that is, built with ∧, ∨ only) in which no variable occurs repeatedly. We also show that recognizing such functions from monotone Boolean expressions is co-NP-hard, thus complementing Mundici’s result that this problem is in co-NP. 1

Application of hypergraphs in decomposition of discrete systems

seria: Lecture Notes in Control and Computer Science ; vol. 23

Characterizing and witnessing multipartite correlations : from nonlocality to contextuality

In the past century, experimental discoveries have witnessed phenomena in Nature which challenge our everyday classical intuition. In order to explain these facts, quantum theory was developed, which so far has been able to reproduce the observed results. However, I believe that our understanding of quantum mechanics can be significantly improved by the search for an operational meaning behind its mathematical formulation, which would help to identify the limitations and possibilities of the theory for information processing. An intriguing property of quantum theory is its intrinsic randomness. Indeed, Einstein, Podolsky and Rosen in 1935 questioned the completeness of quantum theory. They argued the possibility of the existence of a complete theory where variables to which we have not access determine the behaviour of physical systems, and the randomness observed in quantum mechanics is then due to our ignorance of these variables. These hidden variables theories, however, were proved not to be enough for explaining the predictions of quantum theory, as shown in the no-go theorems by Bell on quantum-nonlocality and by Kochen and Specker on quantum-contextuality. In the past decades, many experiments have corroborated the nonlocal and contextual character of Nature. However, no intuition behind these phenomena has been found, in particular about what limits their strength. In fact, special relativity alone would allow for phenomena which are more nonlocal than what quantum theory allows. Hence, much effort has been devoted to find the physical properties of quantum theory that restricts these phenomena. In this thesis, we study the constraints that arise on nonlocal and contextual phenomena when a certain exclusiveness structure compatible with quantum theory is imposed in the space of events. Here, an event denotes the situation where an outcome is obtained given that a measurement is performed on the physical system. Regarding nonlocality, we introduce a notion of orthogonality that states that events involving different outcomes of the same local measurement are exclusive, and construct constraints that the correlations among observers should satisfy. We denote this by Local Orthogonality principle (LO), which is the first intrinsically multipartite principle for bounding quantum correlations. We prove that LO identifies the supra-quantum character of some bipartite and multipartite correlations, and gets close to the quantum boundary. When studying contextuality, the same abstract event may correspond to outcomes of different measurements, which introduces a non-trivial structure in the space of events. For its study, we develop a general formalism for contextuality scenarios in the spirit of the recent approach by Cabello, Severini and Winter. In our framework, nonlocality arises as a particular case of contextuality, which allows us to study a generalization of LO. Both in nonlocality and contextuality, we find close connections to problems in combinatorics and hence use graph-theoretical tools for studying correlations. Finally, this thesis also studies the detection of nonlocal correlations. Most results on quantum nonlocality focus on few particles' experiments, while less is known about the detection of quantum nonlocality in many-body systems. Standard many-body observables involve correlations among few particles, while there is still no multipartite Bell inequality to test nonlocality merely from these data. In this thesis, we provide the first proposal for nonlocality detection in many-body systems using two-body correlations. We construct families of Bell inequalities from two-body correlators, which can detect nonlocality for systems with large number of constituents. In addition, we prove violations by systems which are relevant in nuclear and atomic physics, and show how to test these inequalities by measuring global spin components, hence opening the problem to experimental realizations