265 research outputs found
On the imaginary parts of chromatic root
While much attention has been directed to the maximum modulus and maximum
real part of chromatic roots of graphs of order (that is, with
vertices), relatively little is known about the maximum imaginary part of such
graphs. We prove that the maximum imaginary part can grow linearly in the order
of the graph. We also show that for any fixed , almost every
random graph in the Erd\"os-R\'enyi model has a non-real root.Comment: 4 figure
How proofs are prepared at Camelot
We study a design framework for robust, independently verifiable, and
workload-balanced distributed algorithms working on a common input. An
algorithm based on the framework is essentially a distributed encoding
procedure for a Reed--Solomon code, which enables (a) robustness against
byzantine failures with intrinsic error-correction and identification of failed
nodes, and (b) independent randomized verification to check the entire
computation for correctness, which takes essentially no more resources than
each node individually contributes to the computation. The framework builds on
recent Merlin--Arthur proofs of batch evaluation of Williams~[{\em Electron.\
Colloq.\ Comput.\ Complexity}, Report TR16-002, January 2016] with the
observation that {\em Merlin's magic is not needed} for batch evaluation---mere
Knights can prepare the proof, in parallel, and with intrinsic
error-correction.
The contribution of this paper is to show that in many cases the verifiable
batch evaluation framework admits algorithms that match in total resource
consumption the best known sequential algorithm for solving the problem. As our
main result, we show that the -cliques in an -vertex graph can be counted
{\em and} verified in per-node time and space on
compute nodes, for any constant and
positive integer divisible by , where is the
exponent of matrix multiplication. This matches in total running time the best
known sequential algorithm, due to Ne{\v{s}}et{\v{r}}il and Poljak [{\em
Comment.~Math.~Univ.~Carolin.}~26 (1985) 415--419], and considerably improves
its space usage and parallelizability. Further results include novel algorithms
for counting triangles in sparse graphs, computing the chromatic polynomial of
a graph, and computing the Tutte polynomial of a graph.Comment: 42 p
Twelve-dimensional Pauli group contextuality
The goal of the paper is to check whether the real eigenstates of the
observables in the single qudit Pauli group may lead to quantum contextuality,
the property that mutually compatible and independent experiments depend on
each other. We find that quantum contextuality crops up at dimension twelve in
various configurations with a few rays. We use the Shannon capacity for
characterizing the corresponding orthogonality graphs. Some arithmetical
properties underlying the qudit contextuality are outlined.Comment: expanded versio
Integral point sets over finite fields
We consider point sets in the affine plane where each
Euclidean distance of two points is an element of . These sets
are called integral point sets and were originally defined in -dimensional
Euclidean spaces . We determine their maximal cardinality
. For arbitrary commutative rings
instead of or for further restrictions as no three points on a
line or no four points on a circle we give partial results. Additionally we
study the geometric structure of the examples with maximum cardinality.Comment: 22 pages, 4 figure
- …