Related papers: Covering sets for limited-magnitude errors

We prove that deciding whether a classical-quantum (C-Q) channel can exactly preserve a single classical bit is QCMA-complete. This "bit-preservation" problem is a special case of orthogonality-constrained optimization tasks over C-Q…

For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…

For $\lambda \in (1/2, 1)$ and $\alpha$, we consider sets of numbers $x$ such that for infinitely many $n$, $x$ is $2^{-\alpha n}$-close to some $\sum_{i=1}^n \omega_i \lambda^i$, where $\omega_i \in \{0,1\}$. These sets are in Falconer's…

Partial set cover problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set $E$, a collection of…

A local tester for an error correcting code $C\subseteq \Sigma^{n}$ is a tester that makes $Q$ oracle queries to a given word $w\in \Sigma^n$ and decides to accept or reject the word $w$. An optimal local tester is a local tester that has…

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Let $(Q, \mathfrak{n})$ be a regular local ring and let $f_1, \ldots, f_c \in \mathfrak{n}^2$ be a $Q$-regular sequence. Set $(A, \mathfrak{m}) = (Q/(\mathbf{f}), \mathfrak{n}/(\mathbf{f}))$. Further assume that the initial forms $f_1^*,…

Large-scale subset selection asks for a small useful set of examples, features, sensors, seed users, or context passages from an enormous ground set. Submodular maximization is a canonical model for such diminishing-returns problems, but…

We consider column-sparse covering integer programs, a generalization of set cover, which have a long line of research of (randomized) approximation algorithms. We develop a new rounding scheme based on the Partial Resampling variant of the…

A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…

Quantum error mitigation is a promising route to achieving quantum utility, and potentially quantum advantage in the near-term. Many state-of-the-art error mitigation schemes use knowledge of the errors in the quantum processor, which opens…

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

We study the quantization errors for the doubling probability measures $\mu$ which are supported on a class of Moran sets $E\subset\mathbb{R}^q$. For each $n\geq 1$, let $\alpha_n$ be an arbitrary $n$-optimal set for $\mu$ of order $r$ and…

In this paper, we prove tight lower bounds on the smallest degree of a nonzero polynomial in the ideal generated by $MOD_q$ or $\neg MOD_q$ in the polynomial ring $F_p[x_1, \ldots, x_n]/(x_1^2 = x_1, \ldots, x_n^2 = x_n)$, $p,q$ are…

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

Let $\lambda_{1},\ldots,\lambda_{n}$ be real numbers in $(0,1)$ and $p_{1},\ldots,p_{n}$ be points in $\mathbb{R}^{d}$. Consider the collection of maps $f_{j}:\mathbb{R}^{d}\to\mathbb{R}^{d} $ given by $$f_{j}(x)=\lambda_{j} x…

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

We implement methods that efficiently impose integrality -- i.e., the condition that the coefficients of characters in the partition function must be integers -- into numerical modular bootstrap. We demonstrate the method with a number of…