Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.

A Relation between the Weyl Group W(e8) and Eight-Line Arrangements on a Real Projective Plane

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.

On Projective Plane of Order 13 with a Frobenius Group of Order 39 as a Collineation Group

One of the most outstanding problems in combinatorial mathematics and geometry is the problem of existence of finite projective planes whose order is not a prime power.

When does a Bounded Domain Cover a Projective Manifold? (Survey)

* The research has been partially supported by Bulgarian Funding Organizations, sponsoring the Algebra Section of the Mathematics Institute, Bulgarian Academy of Sciences, a Contract between the Humboldt Univestit¨at and the University of Sofia, and Grant MM 412 / 94 from the Bulgarian Board of Education and Technology

Projective Methods of Image Recognition

We propose a method for image recognition on the base of projections. Radon transform gives an opportunity to map image into space of its projections. Projection properties allow constructing informative features on the base of moments that can be successfully used for invariant recognition. Offered approach gives about 91-97% of correct recognition.

Predegree Polynomials of Plane Configurations in Projective Space

2000 Mathematics Subject Classification: 14N10, 14C17.

The Nonexistence of some Griesmer Arcs in PG(4, 5)

In this paper, we prove the nonexistence of arcs with parameters (232, 48) and (233, 48) in PG(4,5). This rules out the existence of linear codes with parameters [232,5,184] and [233,5,185] over the field with five elements and improves two instances in the recent tables by Maruta, Shinohara and Kikui of optimal codes of dimension 5 over F5.

Necessary and Sufficient Conditions for the Extendability of Ternary Linear Codes

We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.

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.

Symplectic Representation of a Braid Group on 3-Sheeted Covers of the Riemann Sphere

We define Picard cycles on each smooth three-sheeted Galois cover C of the Riemann sphere. The moduli space of all these algebraic curves is a nice Shimura surface, namely a symmetric quotient of the projective plane uniformized by the complex two-dimensional unit ball. We show that all Picard cycles on C form a simple orbit of the Picard modular group of Eisenstein numbers. The proof uses a special surface classification in connection with the uniformization of a classical Picard-Fuchs system. It yields an explicit symplectic representation of the braid groups (coloured or not) of four strings.

Nadel's Subschemes of Fano Manifolds X with a Picard Group Pic(X) Isomorphic to Z

∗The author supported by Contract NSFR MM 402/1994.

Analogical Reasoning Techniques in Intelligent Counterterrorism Systems

The paper develops a set of ideas and techniques supporting analogical reasoning throughout the life-cycle of terrorist acts. Implementation of these ideas and techniques can enhance the intellectual level of computer-based systems for a wide range of personnel dealing with various aspects of the problem of terrorism and its effects. The method combines techniques of structure-sensitive distributed representations in the framework of Associative-Projective Neural Networks, and knowledge obtained through the progress in analogical reasoning, in particular the Structure Mapping Theory. The impact of these analogical reasoning tools on the efforts to minimize the effects of terrorist acts on civilian population is expected by facilitating knowledge acquisition and formation of terrorism-related knowledge bases, as well as supporting the processes of analysis, decision making, and reasoning with those knowledge bases for users at various levels of expertise before, during, and after terrorist acts.

On Compositions in Equiaffine Space

In an equiaffine space q N E using the connection define with projective tensors na and ma the connections 1 , 2 and 3 . For the spaces N N 1A ,2A and N 3A , with coefficient of connection 1 , 2 and 3 respectively, we proved that the affinor of composition and the projective affinors have equal covariant derivatives. It follows that the connection 3 is equaffine as well, and the connections and 3 are projective to each other. In the case where q N E and N 3A have equal Ricci tensors, we find the fundamental nvector . In [4] compositions with structural affinor a are studied. Space containing compositions with symmetric connection and Weyl connection are studied in [6] and [7] respectively.

On Compositions in Equiaffine Space

In an equiaffine space q N E using the connection define with projective tensors na and ma the connections 1 , 2 and 3 . For the spaces N N 1A ,2A and N 3A , with coefficient of connection 1 , 2 and 3 respectively, we proved that the affinor of composition and the projective affinors have equal covariant derivatives. It follows that the connection 3 is equaffine as well, and the connections and 3 are projective to each other. In the case where q N E and N 3A have equal Ricci tensors, we find the fundamental nvector . In [4] compositions with structural affinor a are studied. Space containing compositions with symmetric connection and Weyl connection are studied in [6] and [7] respectively.

An Improvement to the Achievement of the Griesmer Bound

We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose of this paper is to determine nq(k, d) for d = dk as nq(k, d) = gq(k, d) + 1 for q ≥ k with 3 ≤ k ≤ 8 except for (k, q) = (7, 7), (8, 8), (8, 9).