280,935 research outputs found
Quark-lepton complementarity and self-complementarity in different schemes
With the progress of increasingly precise measurements on the neutrino mixing
angles, phenomenological relations such as quark-lepton complementarity (QLC)
among mixing angles of quarks and leptons and self-complementarity (SC) among
lepton mixing angles have been observed. Using the latest global fit results of
the quark and lepton mixing angles in the standard Chau-Keung scheme, we
calculate the mixing angles and CP-violating phases in the other eight
different schemes. We check the dependence of these mixing angles on the
CP-violating phases in different phase schemes. The dependence of QLC and SC
relations on the CP phase in the other eight schemes is recognized and then
analyzed, suggesting that measurements on CP-violating phases of the lepton
sector are crucial to the explicit forms of QLC and SC in different schemes.Comment: 11 pages, 3 figures, version accepted for publication in PR
When are signals complements or substitutes?
The paper introduces a notion of complementarity (substitutability) of two signals which
requires that in all decision problems each signal becomes more (less) valuable when the
other signal becomes available. We provide a general characterization which relates
complementarity and substitutability to a Blackwell-comparison of two auxiliary signals. In
a special setting with a binary state space and binary, symmetric signals, we find an explicit
characterization that permits an intuitive interpretation of complementarity and
substitutability. We demonstrate how these conditions extend to the general case. Finally,
we study implications of complementarity and substitutability for information acquisition
and in a second price auction
Reformulations of mathematical programming problems as linear complementarity problems
A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are
(i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and unrestricted variables,
(ii.) Minimum Linear Complementarity Problem (MLCP) which is an
LCP with additional variables not required to be complementary and with a linear objective function which is to be minimized,
(iii.) Second Minimum Linear Complementarity Problem (SMLCP) which is an MLCP but the nonnegative restriction on one of each pair of complementary variables is relaxed so that it is allowed to be unrestricted in value.
A number of well known mathematical programming problems, namely quadratic programming (convex, nonconvex, pseudoconvex nonconvex), bilinear programming, game theory, zero-one integer programming, the fixed charge problem, absolute value programming, variable separable programming are reformulated as members of this family of four complementarity problems
Complementarity and Identification
This paper examines the identification power of assumptions that formalize
the notion of complementarity in the context of a nonparametric bounds analysis
of treatment response. I extend the literature on partial identification via
shape restrictions by exploiting cross-dimensional restrictions on treatment
response when treatments are multidimensional; the assumption of
supermodularity can strengthen bounds on average treatment effects in studies
of policy complementarity. This restriction can be combined with a statistical
independence assumption to derive improved bounds on treatment effect
distributions, aiding in the evaluation of complex randomized controlled
trials. Complementarities arising from treatment effect heterogeneity can be
incorporated through supermodular instrumental variables to strengthen
identification in studies with one or multiple treatments. An application
examining the long-run impact of zoning on the evolution of urban spatial
structure illustrates the value of the proposed identification methods.Comment: 46 page
How much complementarity?
Bohr placed complementary bases at the mathematical centre point of his view
of quantum mechanics. On the technical side then my question translates into
that of classifying complex Hadamard matrices. Recent work (with Barros e Sa)
shows that the answer depends heavily on the prime number decomposition of the
Hilbert space. By implication so does the geometry of quantum state space.Comment: 6 pages; talk at the Vaxjo conference on Foundations of Probability
and Physics, 201
Complementarity and correlations
We provide an interpretation of entanglement based on classical correlations
between measurement outcomes of complementary properties: states that have
correlations beyond a certain threshold are entangled. The reverse is not true,
however. We also show that, surprisingly, all separable nonclassical states
exhibit smaller correlations for complementary observables than some strictly
classical states. We use mutual information as a measure of classical
correlations, but we conjecture that the first result holds also for other
measures (e.g. the Pearson correlation coefficient or the sum of conditional
probabilities).Comment: Published version (+1 reference
- …
