Related papers: q-Overlaps in the Random Exact Cover Problem
Building on B.Park and Vondrak's recent generalization of the J.Park-Pham Theorem (formerly known as Kahn-Kalai conjecture) to non-uniform probability measures, this paper introduces the notion of "spread" for the non-uniform setting. This…
An ideal system of $n$ qubits has $2^n$ dimensions. This exponential grants power, but also hinders characterizing the system's state and dynamics. We study a new problem: the qubits in a physical system might not be independent. They can…
The Exact Matching (EM) problem asks whether there exists a perfect matching which uses a prescribed number of red edges in a red/blue edge-colored graph. While there exists a randomized polynomial-time algorithm for the problem, only some…
In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…
The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k>=3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been…
Reduction from a higher-dimensional to a lower-dimensional field theory can display special features when the zero-level ground state has nontrivial dependence on the reduction coordinates. In particular, a delayed `covert' form of…
The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment method. Yet apart from a very few exceptional cases these…
The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable? Here we…
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…
In this paper, we present approximation algorithms for combinatorial optimization problems under probabilistic constraints. Specifically, we focus on stochastic variants of two important combinatorial optimization problems: the k-center…
Consider a $q$-ary block code satisfying the property that no $l$-letters long codeword's prefix occurs as a suffix of any codeword for $l$ inside some interval. We determine a general upper bound on the maximum size of these codes and a…
Spin-glass theory is one of the leading paradigms of complex physics and describes condensed matter, neural networks and biological systems, ultracold atoms, random photonics, and many other research fields. According to this theory,…
We introduce in this paper a new tool to prove the convergence of the Overlapping Optimized Schwarz Methods with multisubdomains. The technique is based on some estimates of the errors on the boundaries of the overlapping strips. Our…
In this paper we introduce a novel approach for an important problem of break detection. Specifically, we are interested in detection of an abrupt change in the covariance structure of a high-dimensional random process -- a problem, which…
The first aim of the present paper, is to establish strong approximations of the uniform non-overlapping k-spacings process extending the results of Aly et al. (1984). Our methods rely on the invariance principle in Mason and van Zwet…
We provide necessary and sufficient conditions for the uniqueness of the k-means set of a probability distribution. This uniqueness problem is related to the choice of k: depending on the underlying distribution, some values of this…
In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover,…
Using a recursive algorithm to solve the renormalization group equations of N=1 QCD (DGLAP), we describe the most general supersymmetric evolution of the parton distributions. The analysis involves the regular DGLAP evolution, a partial…
We consider the problem of Gaussian multiplier bootstrap procedures for the $k$th largest statistics and functions of the top $k$ order statistics, which are commonly encountered in high-dimensional statistical inference. Such a problem has…
Partial tomography, which focuses on reconstructing reduced density matrices (RDMs), has emerged as a promising approach for characterizing complex quantum systems, particularly when full state tomography is impractical. Recently,…