Related papers: An Improved Lower Bound for Matroid Intersection P…
Broken symmetries lie at the heart of nontrivial physical phenomena. Breaking the in-plane geometrical symmetry of optical systems allows to access a set of electromagnetic states termed symmetry-protected quasi-bound states in the…
The setting of the classic prophet inequality is as follows: a gambler is shown the probability distributions of $n$ independent, non-negative random variables with finite expectations. In their indexed order, a value is drawn from each…
The matrix $p \rightarrow q$ norm is a fundamental quantity appearing in a variety of areas of mathematics. This quantity is known to be efficiently computable in only a few special cases. The best known algorithms for approximately…
Consider the problem of nonparametric estimation of an unknown $\beta$-H\"older smooth density $p_{XY}$ at a given point, where $X$ and $Y$ are both $d$ dimensional. An infinite sequence of i.i.d.\ samples $(X_i,Y_i)$ are generated…
Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its potential to address complex problems. Its gate-based…
A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…
We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…
Understanding how crossover works is still one of the big challenges in evolutionary computation research, and making our understanding precise and proven by mathematical means might be an even bigger one. As one of few examples where…
The ratio of the structure functions for deep inelastic scattering in top pair production at future electron-proton colliders is analyzed at a fixed $\sqrt{s}$ and $Q^2$ relative to the minimum value of $x$ given by $Q^2/s$ using collinear…
Quantum metrology protocols are typically designed around the assumption that we have an abundance of measurement data, but recent practical applications are increasingly driving interest in cases with very limited data. In this regime the…
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…
The prophet and secretary problems demonstrate online scenarios involving the optimal stopping theory. In a typical prophet or secretary problem, selection decisions are assumed to be immediate and irrevocable. However, many online settings…
In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
Consider the problem of computing quantized linear functions with only a few queries. Formally, given $\mathbf{x}\in \mathbb{R}^k$, our goal is to encode $\mathbf{x}$ as $\mathbf{c} \in \mathbb{R}^n$, for $n > k$, so that for any…
Where is the true boundary of the quantum advantage region of decoded quantum interferometry (DQI)? The best existing answer is provided by Theorem 7.1 in the Supplementary Material of Jordan et al. (2025), yet we show that this answer…
We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs…
Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…
Let X = (x_0,...,x_{n-1})$ be a sequence of n numbers. For \epsilon > 0, we say that x_i is an \epsilon-approximate median if the number of elements strictly less than x_i, and the number of elements strictly greater than x_i are each less…
A line of work initiated by Fortnow in 1997 has proven model-independent time-space lower bounds for the $\mathsf{SAT}$ problem and related problems within the polynomial-time hierarchy. For example, for the $\mathsf{SAT}$ problem, the…