Related papers: q-Overlaps in the Random Exact Cover Problem
We revisit the problem of constructing predictive confidence sets for which we wish to obtain some type of conditional validity. We provide new arguments showing how ``split conformal'' methods achieve near desired coverage levels with high…
We consider a reinforcement learning setting in which the deployment environment is different from the training environment. Applying a robust Markov decision processes formulation, we extend the distributionally robust $Q$-learning…
We present algorithms for the Max-Cover and Max-Unique-Cover problems in the data stream model. The input to both problems are $m$ subsets of a universe of size $n$ and a value $k\in [m]$. In Max-Cover, the problem is to find a collection…
If Nature is supersymmetric at the weak interaction scale, what can we hope to learn from experiments on supersymmetric particles? The most mysterious aspect of phenomenological supersymmetry is the mechanism of spontaneous supersymmetry…
We extend an above barrier analysis made with the Schrodinger equation to the Dirac equation. We demonstrate the perfect agreement between the barrier results and back to back steps. This implies the existence of multiple (indeed infinite)…
We consider matching with shifts for Gibbsian sequences. We prove that the maximal overlap behaves as $c\log n$, where $c$ is explicitly identified in terms of the thermodynamic quantities (pressure) of the underlying potential. Our…
We study the quantum version of the random $K$-Satisfiability problem in the presence of the external magnetic field $\Gamma$ applied in the transverse direction. We derive the replica-symmetric free energy functional within static…
A chiral fermion action allows one to do very clean studies of chiral symmetry breaking in QCD. I will briefly describe how to compute with the overlap action (relatively) cheaply, and then turn to physics: Low modes of the Dirac operator…
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and count the number of optimal solutions in $P \cap Z^n$, assuming that $P$ is a polyhedron,…
The dynamics after a quantum quench is determined by the weights of the initial state in the eigenspectrum of the final Hamiltonian, i.e., by the distribution of overlaps in the energy spectrum. We present an analysis of such overlap…
Accurately estimating the overlap between quantum states is a fundamental task in quantum information processing. While various strategies using distinct quantum measurements have been proposed for overlap estimation, the lack of…
We consider the Tarski--Bang problem about covering of convex bodies by planks. The results of this kind give a lower bound on the sum of widths of planks (regions between a pair of parallel hyperplanes) covering a given convex body.…
For any $\varepsilon > 0$, we prove that $k$-Dimensional Matching is hard to approximate within a factor of $k/(12 + \varepsilon)$ for large $k$ unless $\textsf{NP} \subseteq \textsf{BPP}$. Listed in Karp's 21 $\textsf{NP}$-complete…
Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyper-edge. We present a new multilayered PCP construction that extends the Raz verifier. This enables us to…
This article studies a general divide-and-conquer algorithm for approximating continuous one-dimensional probability distributions with finite mean. The article presents a numerical study that compares pre-existing approximation schemes…
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…
Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…
The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…
In this paper we are interested in the joint distribution of two order statistics from overlapping samples. We give an explicit formula for the distribution of such a pair of random variables under the assumption that the parent…
In the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics and physics. The diversity of the developed methods, on the…