The even outdegree conjecture for acyclic PLCP-cubes in dimension five

Sonoko Moriyama, Yoshio Okamoto

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)2402-2404
Number of pages3
JournalIEICE Transactions on Information and Systems
Issue number8
Publication statusPublished - 2006 Aug
Externally publishedYes


  • Holt-Klee condition
  • Linear complementarity problems
  • Unique sink orientations

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'The even outdegree conjecture for acyclic PLCP-cubes in dimension five'. Together they form a unique fingerprint.

Cite this