261 research outputs found
A geometric proof of the Kochen-Specker no-go theorem
We give a short geometric proof of the KochenSpecker nogo theorem for noncontextual hidden variables model
New coins from old, smoothly
Given a (known) function , we consider the problem of
simulating a coin with probability of heads by tossing a coin with
unknown heads probability , as well as a fair coin, times each, where
may be random. The work of Keane and O'Brien (1994) implies that such a
simulation scheme with the probability equal to 1 exists iff
is continuous. Nacu and Peres (2005) proved that is real analytic in an
open set iff such a simulation scheme exists with the
probability decaying exponentially in for every . We
prove that for non-integer, is in the space if
and only if a simulation scheme as above exists with , where \Delta_n(x)\eqbd \max \{\sqrt{x(1-x)/n},1/n \}.
The key to the proof is a new result in approximation theory:
Let \B_n be the cone of univariate polynomials with nonnegative Bernstein
coefficients of degree . We show that a function is in
if and only if has a series representation
with F_n \in \B_n and for all and . We also provide a
counterexample to a theorem stated without proof by Lorentz (1963), who claimed
that if some \phi_n \in \B_n satisfy for all and , then .Comment: 29 pages; final version; to appear in Constructive Approximatio
The random disc thrower problem
We describe a number of approaches to a question posed by Philips Research, described as the "random disc thrower" problem. Given a square grid of points in the plane, we cover the points by equal-sized planar discs according to the following random process. At each step, a random point of the grid is chosen from the set of uncovered points as the centre of a new disc. This is an abstract model of spatial reuse in wireless networks. A question of Philips Research asks what, as a function of the grid length, is the expected number of discs chosen before the process can no longer continue? Our main results concern the one-dimensional variant of this problem, which can be solved reasonably well, though we also provide a number of approaches towards an approximate solution of the original two-dimensional problem. The two-dimensional problem is related to an old, unresolved conjecture ([6]) that has been the object of close study in both probability theory and statistical physics. Keywords: generating functions, Markov random fields, random sequential adsorption, Rényi’s parking problem, wireless network
The First Magnetic Fields
We review current ideas on the origin of galactic and extragalactic magnetic
fields. We begin by summarizing observations of magnetic fields at cosmological
redshifts and on cosmological scales. These observations translate into
constraints on the strength and scale magnetic fields must have during the
early stages of galaxy formation in order to seed the galactic dynamo. We
examine mechanisms for the generation of magnetic fields that operate prior
during inflation and during subsequent phase transitions such as electroweak
symmetry breaking and the quark-hadron phase transition. The implications of
strong primordial magnetic fields for the reionization epoch as well as the
first generation of stars is discussed in detail. The exotic, early-Universe
mechanisms are contrasted with astrophysical processes that generate fields
after recombination. For example, a Biermann-type battery can operate in a
proto-galaxy during the early stages of structure formation. Moreover, magnetic
fields in either an early generation of stars or active galactic nuclei can be
dispersed into the intergalactic medium.Comment: Accepted for publication in Space Science Reviews. Pdf can be also
downloaded from http://canopus.cnu.ac.kr/ryu/cosmic-mag1.pd
- …