Optimum Chemical Balance Weighing Design under Certain Condition

2000 Mathematics Subject Classification: 62K05, 05B05.

On a Five-Diagonal Jacobi Matrices and Orthogonal Polynomials on Rays in the Complex Plane

∗ Partially supported by Grant MM-428/94 of MESC.

Description Reduction for Restricted Sets of (0,1) Matrices

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

Algorithmic Minimization of Non-zero Entries in 0,1-Matrices

In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrix of zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries present in the matrices, meanwhile their product remains unchanged. We establish the conditions under which the number of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix and such that by applying on them these algorithms, we minimize the total number of non-zero entries present in both matrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and in this case the number of 1 entries represent the complexity of the retrieve and information update operations.

Technology of Classification of Electronic Documents Based on the Theory of Disturbance of Pseudoinverse Matrices

Technology of classification of electronic documents based on the theory of disturbance of pseudoinverse matrices was proposed.

Differential Balanced Trees and (0,1) Matrices

* The research was supported by INTAS 00-397 and 00-626 Projects.