35 research outputs found
Cubic Partial Cubes from Simplicial Arrangements
We show how to construct a cubic partial cube from any simplicial arrangement
of lines or pseudolines in the projective plane. As a consequence, we find nine
new infinite families of cubic partial cubes as well as many sporadic examples.Comment: 11 pages, 10 figure
Quantum sketching protocols for Hamming distance and beyond
In this work we use the concept of quantum fingerprinting to develop a
quantum communication protocol in the simultaneous message passing model that
calculates the Hamming distance between two -bit strings up to relative
error . The number of qubits communicated by the protocol is
polynomial in and , while any classical protocol must
communicate bits. Motivated by the relationship between
Hamming distance and vertex distance in hypercubes, we apply the protocol to
approximately calculate distances between vertices in graphs that can be
embedded into a hypercube such that all distances are preserved up to a
constant factor. Such graphs are known as -graphs. This class includes
all trees, median graphs, Johnson graphs and Hamming graphs. Our protocol is
efficient for -graphs with low diameter, and we show that its
dependence on the diameter is essentially optimal. Finally, we show that our
protocol can be used to approximately compute distances between
vectors efficiently.Comment: 12 page
Distance-regular graphs
This is a survey of distance-regular graphs. We present an introduction to
distance-regular graphs for the reader who is unfamiliar with the subject, and
then give an overview of some developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
Multicoloured Random Graphs: Constructions and Symmetry
This is a research monograph on constructions of and group actions on
countable homogeneous graphs, concentrating particularly on the simple random
graph and its edge-coloured variants. We study various aspects of the graphs,
but the emphasis is on understanding those groups that are supported by these
graphs together with links with other structures such as lattices, topologies
and filters, rings and algebras, metric spaces, sets and models, Moufang loops
and monoids. The large amount of background material included serves as an
introduction to the theories that are used to produce the new results. The
large number of references should help in making this a resource for anyone
interested in beginning research in this or allied fields.Comment: Index added in v2. This is the first of 3 documents; the other 2 will
appear in physic