On extreme points of the diffusion polytope
Abstract
Here, we consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors attainable using finite sequences of these operations. A number of physical problems have linear programming solutions taking the diffusion polytope as the feasible region, e.g. the free energy that can be removed from plasma using waves, so there is a need to describe and enumerate its extreme points. We also review known results for the case of the complete graph Kn, and study a variety of problems for the path graph Pn and the cyclic graph Cn. Finall, we describe the different kinds of extreme points that arise, and identify the diffusion polytope in a number of simple cases. In the case of increasing initial populations on Pn the diffusion polytope is topologically an ndimensional hypercube.
 Authors:
 Princeton Univ., NJ (United States). Dept. of Astrophysical Sciences
 BarIIan Univ., Ramat Gan (Israel). Dept. of Mathematics
 Princeton Univ., NJ (United States). Dept. of Astrophysical Sciences; Princeton Plasma Physics Lab. (PPPL), Princeton, NJ (United States)
 Publication Date:
 Research Org.:
 Princeton Plasma Physics Lab. (PPPL), Princeton, NJ (United States)
 Sponsoring Org.:
 USDOE Office of Science (SC), Fusion Energy Sciences (FES) (SC24); USDOE National Nuclear Security Administration (NNSA)
 OSTI Identifier:
 1350094
 Grant/Contract Number:
 AC0209CH11466; 274FG5208NA28553
 Resource Type:
 Journal Article: Accepted Manuscript
 Journal Name:
 Physica. A
 Additional Journal Information:
 Journal Volume: 473; Journal Issue: C; Journal ID: ISSN 03784371
 Publisher:
 Elsevier
 Country of Publication:
 United States
 Language:
 English
 Subject:
 70 PLASMA PHYSICS AND FUSION TECHNOLOGY; Combinatorics; Optimization; Diffusion; Plasma; Networks; Algebra
Citation Formats
Hay, M. J., Schiff, J., and Fisch, N. J.. On extreme points of the diffusion polytope. United States: N. p., 2017.
Web. doi:10.1016/j.physa.2017.01.038.
Hay, M. J., Schiff, J., & Fisch, N. J.. On extreme points of the diffusion polytope. United States. doi:10.1016/j.physa.2017.01.038.
Hay, M. J., Schiff, J., and Fisch, N. J.. Wed .
"On extreme points of the diffusion polytope". United States.
doi:10.1016/j.physa.2017.01.038. https://www.osti.gov/servlets/purl/1350094.
@article{osti_1350094,
title = {On extreme points of the diffusion polytope},
author = {Hay, M. J. and Schiff, J. and Fisch, N. J.},
abstractNote = {Here, we consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors attainable using finite sequences of these operations. A number of physical problems have linear programming solutions taking the diffusion polytope as the feasible region, e.g. the free energy that can be removed from plasma using waves, so there is a need to describe and enumerate its extreme points. We also review known results for the case of the complete graph Kn, and study a variety of problems for the path graph Pn and the cyclic graph Cn. Finall, we describe the different kinds of extreme points that arise, and identify the diffusion polytope in a number of simple cases. In the case of increasing initial populations on Pn the diffusion polytope is topologically an ndimensional hypercube.},
doi = {10.1016/j.physa.2017.01.038},
journal = {Physica. A},
number = C,
volume = 473,
place = {United States},
year = {Wed Jan 04 00:00:00 EST 2017},
month = {Wed Jan 04 00:00:00 EST 2017}
}

While it had been known for a long time how to transform an asymmetric traveling salesman (ATS) problem on the complete graph with n vertices into a symmetric traveling salesman (STS) problem on an incomplete graph with 2n vertices, no method was available for using this correspondence to derive facets of the symmetric polytope from facets of the asymmetric polytope until the work of E. Balas and M. Fischetti in [Lifted cycle inequalities for the asymmetric traveling salesman problem, Mathematics of Operations Research 24 (2) (1999) 273292] suggested an approach. The original BalasFischetti method uses a standard sequential lifting proceduremore »

Sets of states and extreme points
The natural embedding of orthoposets and quantum logics, equipped with certain sets of states, into their corresponding orderunit normed vector space is investigated. Necessary (resp, sufficient) conditions are stated for the case that the image of the embedding and the extreme points of the order interval, bounded by 0 and the order unit, coincide. Modifications of the state space are discussed from this point of view and the special case of a Boolean algebra is characterized. 
Extreme points of the set of density matrices with positive partial transpose
We present a necessary and sufficient condition for a finitedimensional density matrix to be an extreme point of the convex set of density matrices with positive partial transpose with respect to a subsystem. We also give an algorithm for finding such extreme points and illustrate this by some examples. 
BRIGHT POINTS AND JETS IN POLAR CORONAL HOLES OBSERVED BY THE EXTREMEULTRAVIOLET IMAGING SPECTROMETER ON HINODE
We present observations of polar coronal hole bright points (BPs) made with the Extremeultraviolet Imaging Spectrometer (EIS) on the Hinode spacecraft. The data consist of raster images of BPs in multiple spectral lines from mostly coronal ions, e.g., Fe XFe XV. The BPs are observed for short intervals and thus the data are snapshots of the BPs obtained during their evolution. The images reveal a complex unresolved temperature structure (EIS resolution is about 2''), with the highest temperature being about 2 x 10{sup 6} K. Some BPs appear as small loops with temperatures that are highest near the top. Butmore » 
STEREOSCOPIC DETERMINATION OF HEIGHTS OF EXTREME ULTRAVIOLET BRIGHT POINTS USING DATA TAKEN BY SECCHI/EUVI ABOARD STEREO
We measure the heights of EUV bright points (BPs) above the solar surface by applying a stereoscopic method to the data taken by the Solar TErrestrial RElations Observatory/SECCHI/Extreme UltraViolet Imager (EUVI). We have developed a threedimensional reconstruction method for pointlike features such as BPs using the simple principle that the position of a point in the threedimensional space is specified as the intersection of two lines of sight. From a set of data consisting of EUVI 171 A, 195 A, 284 A, and 304 A images taken on 11 days arbitrarily selected during a period of 14 months, we havemore »