The behavior of Bard-type pivoting algorithms for the linear complementarity problem with a P-matrix is represented by an orientation of a hypercube. We call it a PLCP-cube. In 1978, Stickney and Watson conjectured that such an orientation has no facet on which all even outdegree vertices appear. We prove that this conjecture is true for acyclic PLCP-cubes in dimension five.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sonoko MORIYAMA, Yoshio OKAMOTO, "The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 8, pp. 2402-2404, August 2006, doi: 10.1093/ietisy/e89-d.8.2402.
Abstract: The behavior of Bard-type pivoting algorithms for the linear complementarity problem with a P-matrix is represented by an orientation of a hypercube. We call it a PLCP-cube. In 1978, Stickney and Watson conjectured that such an orientation has no facet on which all even outdegree vertices appear. We prove that this conjecture is true for acyclic PLCP-cubes in dimension five.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.8.2402/_p
Copy
@ARTICLE{e89-d_8_2402,
author={Sonoko MORIYAMA, Yoshio OKAMOTO, },
journal={IEICE TRANSACTIONS on Information},
title={The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five},
year={2006},
volume={E89-D},
number={8},
pages={2402-2404},
abstract={The behavior of Bard-type pivoting algorithms for the linear complementarity problem with a P-matrix is represented by an orientation of a hypercube. We call it a PLCP-cube. In 1978, Stickney and Watson conjectured that such an orientation has no facet on which all even outdegree vertices appear. We prove that this conjecture is true for acyclic PLCP-cubes in dimension five.},
keywords={},
doi={10.1093/ietisy/e89-d.8.2402},
ISSN={1745-1361},
month={August},}
Copy
TY - JOUR
TI - The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five
T2 - IEICE TRANSACTIONS on Information
SP - 2402
EP - 2404
AU - Sonoko MORIYAMA
AU - Yoshio OKAMOTO
PY - 2006
DO - 10.1093/ietisy/e89-d.8.2402
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2006
AB - The behavior of Bard-type pivoting algorithms for the linear complementarity problem with a P-matrix is represented by an orientation of a hypercube. We call it a PLCP-cube. In 1978, Stickney and Watson conjectured that such an orientation has no facet on which all even outdegree vertices appear. We prove that this conjecture is true for acyclic PLCP-cubes in dimension five.
ER -