67,594 research outputs found
Parity of transversals of Latin squares
We introduce a notion of parity for transversals, and use it to show that in
Latin squares of order , the number of transversals is a multiple of
4. We also demonstrate a number of relationships (mostly congruences modulo 4)
involving , where is the number of diagonals of a given
Latin square that contain exactly different symbols.
Let denote the matrix obtained by deleting row and column
from a parent matrix . Define to be the number of transversals
in , for some fixed Latin square . We show that for all and . Also, if has odd order then the
number of transversals of equals mod 2. We conjecture that for all .
In the course of our investigations we prove several results that could be of
interest in other contexts. For example, we show that the number of perfect
matchings in a -regular bipartite graph on vertices is divisible by
when is odd and . We also show that for all , when is an integer matrix of odd
order with all row and columns sums equal to
Afshar's Experiment does not show a Violation of Complementarity
A recent experiment performed by S. Afshar [first reported by M. Chown, New
Scientist {\bf 183}, 30 (2004)] is analyzed. It was claimed that this
experiment could be interpreted as a demonstration of a violation of the
principle of complementarity in quantum mechanics. Instead, it is shown here
that it can be understood in terms of classical wave optics and the standard
interpretation of quantum mechanics. Its performance is quantified and it is
concluded that the experiment is suboptimal in the sense that it does not fully
exhaust the limits imposed by quantum mechanics.Comment: 6 pages, 6 figure
Maximizing Welfare in Social Networks under a Utility Driven Influence Diffusion Model
Motivated by applications such as viral marketing, the problem of influence
maximization (IM) has been extensively studied in the literature. The goal is
to select a small number of users to adopt an item such that it results in a
large cascade of adoptions by others. Existing works have three key
limitations. (1) They do not account for economic considerations of a user in
buying/adopting items. (2) Most studies on multiple items focus on competition,
with complementary items receiving limited attention. (3) For the network
owner, maximizing social welfare is important to ensure customer loyalty, which
is not addressed in prior work in the IM literature. In this paper, we address
all three limitations and propose a novel model called UIC that combines
utility-driven item adoption with influence propagation over networks. Focusing
on the mutually complementary setting, we formulate the problem of social
welfare maximization in this novel setting. We show that while the objective
function is neither submodular nor supermodular, surprisingly a simple greedy
allocation algorithm achieves a factor of of the optimum
expected social welfare. We develop \textsf{bundleGRD}, a scalable version of
this approximation algorithm, and demonstrate, with comprehensive experiments
on real and synthetic datasets, that it significantly outperforms all
baselines.Comment: 33 page
Quantum computational capability of a 2D valence bond solid phase
Quantum phases of naturally-occurring systems exhibit distinctive collective
phenomena as manifestation of their many-body correlations, in contrast to our
persistent technological challenge to engineer at will such strong correlations
artificially. Here we show theoretically that quantum correlations exhibited in
the two-dimensional valence bond solid phase of a quantum antiferromagnet,
modeled by Affleck, Kennedy, Lieb, and Tasaki as a precursor of spin liquids
and topological orders, are sufficiently complex yet structured enough to
simulate universal quantum computation when every single spin can be measured
individually. This unveils that an intrinsic complexity of naturally-occurring
2D quantum systems -- which has been a long-standing challenge for traditional
computers -- could be tamed as a computationally valuable resource, even if we
are limited not to create newly entanglement during computation. Our
constructive protocol leverages a novel way to herald the correlations suitable
for deterministic quantum computation through a random sampling, and may be
extensible to other ground states of various 2D valence bond phases beyond the
AKLT state.Comment: 19 pages, 3 figures; final published version, submitted to the
journal on 23 Sep 2010. The article does not assume familiarity with quantum
computatio
- …