Related papers: The Exclusivity Principle Determines the Correlati…
We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This…
Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…
We present two new contributions to the study of the independence polynomial $Z_G(z)$ of a finite simple graph $G = (V,E)$. First, we provide an improved lower bound for the zero-free region of $Z_G(z)$ for the important class of claw-free…
While quantum entanglement is known to be monogamous (i.e. shared entanglement is restricted in multi-partite settings), here we show that distributed entanglement (or the potential for entanglement) is by nature polygamous. By establishing…
We address the recently posed question as to whether the nonlocality of a single member of an entangled pair of spin $1/2$ particles can be shared among multiple observers on the other wing who act sequentially and independently of each…
We investigate monogamy of correlations and entropy inequalities in the Bloch representation. Here, both can be understood as direct relations between different correlation tensor elements and thus appear intimately related. To that end we…
There are two important paradigms for defining quantum correlations in quantum information theory, viz. the information-theoretic and the entanglement-separability ones. We find an analytical relation between two measures of quantum…
The conjugacy problem is one of the central questions in iteration theory. As far as we, for discontinuous strictly monotone maps there is no complete result. In this paper, we investigate the conjugacy problem of strictly monotone maps…
Uniqueness of effective interaction defined in an extension of the Kohn-Sham theory is proved, if the model with a non-degenerate ground state exists and to reproduce a correlation function as well as the single-particle density of an…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by the random coloring. The classification of common graphs is one of the most intriguing problems in…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…
Correlation matrices are a standard tool in the analysis of the time evolution of complex systems in general and financial markets in particular. Yet most analysis assume stationarity of the underlying time series. This tends to be an…
Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…
A graph $\Gamma$ is $k$-connected-homogeneous ($k$-CH) if $k$ is a positive integer and any isomorphism between connected induced subgraphs of order at most $k$ extends to an automorphism of $\Gamma$, and connected-homogeneous (CH) if this…
Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…
Topological phases of matter possess intricate correlation patterns typically probed by entanglement entropies or entanglement spectra. In this work, we propose an alternative approach to assessing topologically induced edge states in free…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…