Related papers: Indivisibility and uniform computational strength
We consider a conjectured topological inequality for the number of equisingular moduli of a rational surface singularity, and prove it in some natural special cases. When the resolution dual graph is "sufficiently negative" (in a precise…
We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…
Condition for distinguishability of countably infinite number of pure states by a single measurement is given. Distinguishability is to be understood as possibility of an unambiguous measurement. For finite number of states, it is known…
Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify…
A pair of quantum observables diagonal in the same "incoherent" basis can be measured jointly, so some coherence is obviously required for measurement incompatibility. Here we first observe that coherence in a single observable is linked to…
Indifferentiability is a popular cryptographic paradigm for analyzing the security of ideal objects -- both in a classical as well as in a quantum world. It is typically stated in the form of a composable and simulation-based definition,…
Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn from a set of unlabelled objects, and the only operation…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
We both survey and extend a new technique from Lu Liu to prove separation theorems between products of Ramsey-type theorems over computable reducibility. We use this technique to show that Ramsey's theorem for $n$-tuples and three colors is…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
We show that there is a rational vector space $V$ such that, whenever $V$ is finitely coloured, there is an infinite set $X$ whose sumset $X+X$ is monochromatic. Our example is the rational vector space of dimension…
Given a coloring of the k-element subsets of an uncountable separable metric space, we show that there exists an infinite monochromatic subset which contains its limit point.
Quantum mechanics is already 100 years old, but remains alive and full of challenging open problems. On one hand, the problems encountered at the frontiers of modern theoretical physics like Quantum Gravity, String Theories, etc. concern…
A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every $k$-colored necklace can be fairly split by at most $k$…
Einstein's article on the EPR paradox is the most cited of his works, but not many know that it was not fully representative of the way he thought about the incompleteness of the quantum formalism. Indeed, his main worry was not…
We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
The question of how irreversibility can emerge as a generic phenomena when the underlying mechanical theory is reversible has been a long-standing fundamental problem for both classical and quantum mechanics. We describe a mechanism for the…
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…