519 research outputs found
Analysis of Gamma Radiation from a Radon Source: Indications of a Solar Influence
This article presents an analysis of about 29,000 measurements of gamma
radiation associated with the decay of radon in a sealed container at the
Geological Survey of Israel (GSI) Laboratory in Jerusalem between 28 January
2007 and 10 May 2010. These measurements exhibit strong variations in time of
year and time of day, which may be due in part to environmental influences.
However, time-series analysis reveals a number of periodicities, including two
at approximately 11.2 year and 12.5 year. We have previously
found these oscillations in nuclear-decay data acquired at the Brookhaven
National Laboratory (BNL) and at the Physikalisch-Technische Bundesanstalt
(PTB), and we have suggested that these oscillations are attributable to some
form of solar radiation that has its origin in the deep solar interior. A
curious property of the GSI data is that the annual oscillation is much
stronger in daytime data than in nighttime data, but the opposite is true for
all other oscillations. This may be a systematic effect but, if it is not, this
property should help narrow the theoretical options for the mechanism
responsible for decay-rate variability.Comment: 9 pages, 21 figure
Negativity as a distance from a separable state
The computable measure of the mixed-state entanglement, the negativity, is
shown to admit a clear geometrical interpretation, when applied to
Schmidt-correlated (SC) states: the negativity of a SC state equals a distance
of the state from a pertinent separable state. As a consequence, a SC state is
separable if and only if its negativity vanishes. Another remarkable
consequence is that the negativity of a SC can be estimated "at a glance" on
the density matrix. These results are generalized to mixtures of SC states,
which emerge in certain quantum-dynamical settings.Comment: 9 pages, 1 figur
Layout of Graphs with Bounded Tree-Width
A \emph{queue layout} of a graph consists of a total order of the vertices,
and a partition of the edges into \emph{queues}, such that no two edges in the
same queue are nested. The minimum number of queues in a queue layout of a
graph is its \emph{queue-number}. A \emph{three-dimensional (straight-line
grid) drawing} of a graph represents the vertices by points in
and the edges by non-crossing line-segments. This paper contributes three main
results:
(1) It is proved that the minimum volume of a certain type of
three-dimensional drawing of a graph is closely related to the queue-number
of . In particular, if is an -vertex member of a proper minor-closed
family of graphs (such as a planar graph), then has a drawing if and only if has O(1) queue-number.
(2) It is proved that queue-number is bounded by tree-width, thus resolving
an open problem due to Ganley and Heath (2001), and disproving a conjecture of
Pemmaraju (1992). This result provides renewed hope for the positive resolution
of a number of open problems in the theory of queue layouts.
(3) It is proved that graphs of bounded tree-width have three-dimensional
drawings with O(n) volume. This is the most general family of graphs known to
admit three-dimensional drawings with O(n) volume.
The proofs depend upon our results regarding \emph{track layouts} and
\emph{tree-partitions} of graphs, which may be of independent interest.Comment: This is a revised version of a journal paper submitted in October
2002. This paper incorporates the following conference papers: (1) Dujmovic',
Morin & Wood. Path-width and three-dimensional straight-line grid drawings of
graphs (GD'02), LNCS 2528:42-53, Springer, 2002. (2) Wood. Queue layouts,
tree-width, and three-dimensional graph drawing (FSTTCS'02), LNCS
2556:348--359, Springer, 2002. (3) Dujmovic' & Wood. Tree-partitions of
-trees with applications in graph layout (WG '03), LNCS 2880:205-217, 200
Realizability of Polytopes as a Low Rank Matrix Completion Problem
This article gives necessary and sufficient conditions for a relation to be
the containment relation between the facets and vertices of a polytope. Also
given here, are a set of matrices parameterizing the linear moduli space and
another set parameterizing the projective moduli space of a combinatorial
polytope
On the Maximum Crossing Number
Research about crossings is typically about minimization. In this paper, we
consider \emph{maximizing} the number of crossings over all possible ways to
draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009]
conjectured that any graph has a \emph{convex} straight-line drawing, e.g., a
drawing with vertices in convex position, that maximizes the number of edge
crossings. We disprove this conjecture by constructing a planar graph on twelve
vertices that allows a non-convex drawing with more crossings than any convex
one. Bald et al. [Proc. COCOON, 2016] showed that it is NP-hard to compute the
maximum number of crossings of a geometric graph and that the weighted
geometric case is NP-hard to approximate. We strengthen these results by
showing hardness of approximation even for the unweighted geometric case and
prove that the unweighted topological case is NP-hard.Comment: 16 pages, 5 figure
Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra
We give a method for computing upper and lower bounds for the volume of a
non-obtuse hyperbolic polyhedron in terms of the combinatorics of the
1-skeleton. We introduce an algorithm that detects the geometric decomposition
of good 3-orbifolds with planar singular locus and underlying manifold the
3-sphere. The volume bounds follow from techniques related to the proof of
Thurston's Orbifold Theorem, Schl\"afli's formula, and previous results of the
author giving volume bounds for right-angled hyperbolic polyhedra.Comment: 36 pages, 19 figure
Six topics on inscribable polytopes
Inscribability of polytopes is a classic subject but also a lively research
area nowadays. We illustrate this with a selection of well-known results and
recent developments on six particular topics related to inscribable polytopes.
Along the way we collect a list of (new and old) open questions.Comment: 11 page
- …