9 research outputs found
Cutting a polytope
Full text linkWe investigate whether it is the case that for every convex d -polytope P and pair of distinct vertices x and y of P , there exists a hyperplane passing through x and y which cuts P into two smaller d -polytopes, one of which has fewer facets than P . Such a result would lead to inductive proofs of Conjectures 1 and 2 below. However, for d ≥4, our answer is in the negative.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/42814/1/10711_2005_Article_BF01265345.pd
Separation of Water from Ethylene Glycol Using Polyvinyl Alcohol–Zeolite Composite Membrane
No full textSemi-Empirical Models and Cubic Equations of State for Correlation of Solids Solubility in scCO2: From Simple to Complex Substances
No full textA QSAR Study for the Prediction of Inhibitory Activity of Coumarin Derivatives for the Treatment of Alzheimer’s Disease
No full textA modified non-equilibrium lattice fluid model based on corrected fractional free volume of polymers for gas solubility prediction
No full text
