The Localization Procedures of the Vector of Weighting Coefficients for Fuzzy Models of Choice

The author analyzes the localization procedures of the vector of weighting coefficients which are based on presenting the function of value by additive reduction adapted to fuzzy models of choice.

Vector Combinatorial Problems in a Space of Combinations with Linear Fractional Functions of Criteria

The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.

Efficient Computing of some Vector Operations over GF(3) and GF(4)

The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.

On The Brill-noether Theory of Spanned Vector Bundles on Smooth Curves

Here we study the integers (d, g, r) such that on a smooth projective curve of genus g there exists a rank r stable vector bundle with degree d and spanned by its global sections.