Related papers: Effective bounds for monochromatic connectivity me…
We search a simplest and minimal way to determine whether a given quantum system is entangled or separable. For this end, we propose binary correlation measurements in which restricted knowledge of only zero or non-zero correlations is…
Measure homology was introduced by Thurston in his notes about the geometry and topology of 3-manifolds, where it was exploited in the computation of the simplicial volume of hyperbolic manifolds. Zastrow and Hansen independently proved…
We study the long time statistics of a class of semi--linear damped wave equations with polynomial nonlinearities and perturbed by additive Gaussian noise in dimensions 2 and 3. We find that if sufficiently many directions in the phase…
We study families of depth measures defined by natural sets of axioms. We show that any such depth measure is a constant factor approximation of Tukey depth. We further investigate the dimensions of depth regions, showing that the Cascade…
While entanglement between distant parties has been extensively studied, entangled measurements have received relatively little attention despite their significance in understanding non-locality and their central role in quantum computation…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
Consider the graph $\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to…
Estimating the quality of a single-photon source is crucial for its use in quantum technologies. The standard test for semiconductor sources is a value of the second-order correlation function of the emitted field below $1/2$ at zero…
In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic…
The normality measure $\mathcal{N}$ has been introduced by Mauduit and S{\'a}rk{\"o}zy in order to describe the pseudorandomness properties of finite binary sequences. Alon, Kohayakawa, Mauduit, Moreira and R{\"o}dl proved that the minimal…
We introduce a measure of coherence, which is extended from the coherence rank via the standard convex roof construction, we call it the logarithmic coherence number. This approach is parallel to the Schmidt measure in entanglement theory,…
Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…
In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal…
We prove that the minimum number of critical points of a Weinstein Morse function on a Weinstein domain of dimension at least six is at most two more than the minimum number of critical points of a smooth Morse function on that domain; if…
We consider the network constraints on the bounds of the assortativity coefficient, which measures the tendency of nodes with the same attribute values to be interconnected. The assortativity coefficient is the Pearson's correlation…
Using Ravenel's Thom spectrum $X(n)$, we introduce the concept of chromatic defect, which measures how far a spectrum is from being complex-orientable. We compute the chromatic defect of various examples of interest, such as finite spectra,…
It has been proposed that the microwave-induced ``zero-resistance'' phenomenon, observed in a GaAs two-dimensional electron system at low temperatures in moderate magnetic fields, results from a state with multiple domains, in which a large…
Many quantities that characterize network elements are defined in an explicit form and calculated directly from the network structure; examples of include several centrality measures like degree, closeness, or betweenness. However, there…
Predicting the fate of an interacting system in the limit where the electronic bandwidth is quenched is often highly non-trivial. The complex interplay between interactions and quantum fluctuations driven by the band geometry can drive…
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case…