Numerical characterization of n-cube subset partitioning

  • Authors:

  • H. Sahakyan

  • Affiliations:

  • Institute for Informatics and Automation Problems, National Academy of Sciences, P. Sevak street. 1, 0014 Yerevan, Armenia

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

Abstract

A general quantitative description of vertex subsets of the n-dimensional unit cube E^n through their partitions (direct problem) is given and the existence and composition problems for vertex subsets with given quantitative characteristics of partitions (inverse problem) are considered. Each of these subproblems is of significant theoretical and practical importance. Finding an efficient algorithmic solution to the inverse problem remains open. A complete and simple structural description of the numerical parameters of the unit cube partitions is presented.