Some Para-Hermitian Related Complex Structures and Non-existence of Semi-Riemannian Metric on Some Spheres

It is shown that the spheres S^(2n) (resp: S^k with k ≡ 1 mod 4) can be given neither an indefinite metric of any signature (resp: of signature (r, k − r) with 2 ≤ r ≤ k − 2) nor an almost paracomplex structure. Further for every given Riemannian metric on an almost para-Hermitian manifold with the associated 2-form φ one can construct an almost Hermitian structure (under certain conditions, two different almost Hermitian structures) whose associated 2-form(s) is φ.

Randomized Parallelization – a New Method for Solving Hard Combinatorial Problems

A new method for solving some hard combinatorial optimization problems is suggested, admitting a certain reformulation. Considering such a problem, several different similar problems are prepared which have the same set of solutions. They are solved on computer in parallel until one of them will be solved, and that solution is accepted. Notwithstanding the evident overhead, the whole run-time could be significantly reduced due to dispersion of velocities of combinatorial search in regarded cases. The efficiency of this approach is investigated on the concrete problem of finding short solutions of non-deterministic system of linear logical equations.

Evolution of Sets Systems and Homotopy Groups of Spheres

Симеон Т. Стефанов, Велика И. Драгиева - В работата е изследвана еволюцията на системи от множества върху n-мерната евклидова сфера S^n. Установена е връзката на такива системи с хомотопичните групи на сферите. Получени са някои комбинаторни приложения за многостени.

Using Covariance as a Similarity Measure for Document Language Identification in Hard Contexts

2000 Mathematics Subject Classification: C2P99.