32,442 research outputs found
Maximal Bootstrap Percolation Time on the Hypercube via Generalised Snake-in-the-Box
In -neighbour bootstrap percolation, vertices (sites) of a graph are
infected, round-by-round, if they have neighbours already infected. Once
infected, they remain infected. An initial set of infected sites is said to
percolate if every site is eventually infected. We determine the maximal
percolation time for -neighbour bootstrap percolation on the hypercube for
all as the dimension goes to infinity up to a logarithmic
factor. Surprisingly, it turns out to be , which is in great
contrast with the value for , which is quadratic in , as established by
Przykucki. Furthermore, we discover a link between this problem and a
generalisation of the well-known Snake-in-the-Box problem.Comment: 14 pages, 1 figure, submitte
On the black-box complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner's
Lemma in the black-box model of computing. We give a deterministic algorithm
for Sperner problems over pseudo-manifolds of arbitrary dimension. The query
complexity of our algorithm is linear in the separation number of the skeleton
graph of the manifold and the size of its boundary. As a corollary we get an
deterministic query algorithm for the black-box version of the
problem {\bf 2D-SPERNER}, a well studied member of Papadimitriou's complexity
class PPAD. This upper bound matches the deterministic lower
bound of Crescenzi and Silvestri. The tightness of this bound was not known
before. In another result we prove for the same problem an
lower bound for its probabilistic, and an
lower bound for its quantum query complexity, showing
that all these measures are polynomially related.Comment: 16 pages with 1 figur
Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation
We construct Gray codes over permutations for the rank-modulation scheme,
which are also capable of correcting errors under the infinity-metric. These
errors model limited-magnitude or spike errors, for which only
single-error-detecting Gray codes are currently known. Surprisingly, the
error-correcting codes we construct achieve a better asymptotic rate than that
of presently known constructions not having the Gray property, and exceed the
Gilbert-Varshamov bound. Additionally, we present efficient ranking and
unranking procedures, as well as a decoding procedure that runs in linear time.
Finally, we also apply our methods to solve an outstanding issue with
error-detecting rank-modulation Gray codes (snake-in-the-box codes) under a
different metric, the Kendall -metric, in the group of permutations over
an even number of elements , where we provide asymptotically optimal
codes.Comment: Revised version for journal submission. Additional results include
more tight auxiliary constructions, a decoding shcema, ranking/unranking
procedures, and application to snake-in-the-box codes under the Kendall
tau-metri
- …