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

Connectivity of pseudomanifold graphs from an algebraic point of view

The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this note, we provide a unifying approach which allows us to obtain more general results. Moreover, we provide a relation to commutative algebra by relating connectivity problems to graded Betti numbers of the associated Stanley--Reisner rings.Comment: 4 pages, minor change

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 $\mathbb{Z}^3$ 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 $G$ is closely related to the queue-number of $G$. In particular, if $G$ is an $n$-vertex member of a proper minor-closed family of graphs (such as a planar graph), then $G$ has a $O(1)\times O(1)\times O(n)$ drawing if and only if $G$ 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 $k$-trees with applications in graph layout (WG '03), LNCS 2880:205-217, 200

Theory of commensurable magnetic structures in holmium

The tendency for the period of the helically ordered moments in holmium to lock into values which are commensurable with the lattice is studied theoretically as a function of temperature and magnetic field. The commensurable effects are derived in the mean-field approximation from numerical calculations of the free energy of various commensurable structures, and the results are compared with the extensive experimental evidence collected during the last ten years on the magnetic structures in holmium. In general the stability of the different commensurable structures is found to be in accord with the experiments, except for the tau=5/18 structure observed a few degrees below T_N in a b-axis field. The trigonal coupling recently detected in holmium is found to be the interaction required to explain the increased stability of the tau=1/5 structure around 42 K, and of the tau=1/4 structure around 96 K, when a field is applied along the c-axis.Comment: REVTEX, 31 pages, 7 postscript figure

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

Forty years of paleoecology in the Galapagos

The Galapagos Islands provided one of the first lowland paleoecological records from the Neotropics. Since the first cores were raised from the islands in 1966, there has been a substantial increase in knowledge of past systems, and development of the science of paleoclimatology. The study of fossil pollen, diatoms, corals and compound-specific isotopes on the Galapagos has contributed to the maturation of this discipline. As research has moved from questions about ice-age conditions and mean states of the Holocene to past frequency of El Niño Southern Oscillation, the resolution of fossil records has shifted from millennial to sub-decadal. Understanding the vulnerability of the Galapagos to climate change will be enhanced by knowledge of past climate change and responses in the islands

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