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).

The Nonexistence of [132, 6, 86]3 Codes and [135, 6, 88]3 Codes

We prove the nonexistence of [g3(6, d), 6, d]3 codes for d = 86, 87, 88, where g3(k, d) = ∑⌈d/3i⌉ and i=0 ... k−1. This determines n3(6, d) for d = 86, 87, 88, where nq(k, d) is the minimum length n for which an [n, k, d]q code exists.

Fibrés Vectoriels Semi-Stables sur une Courbe de Genre Deux et Association des Points dans L’espace Projectif

2000 Mathematics Subject Classification: 14D20, 14J60.

Projectively Normal Line Bundles on K-Gonal Curves and Rational Surfaces

2000 Mathematics Subject Classification: 14H50.

Recursive Methods for Construction of Balanced N-ary Block Designs

2000 Mathematics Subject Classification: Primary 05B05; secondary 62K10.

Application of Wavelet Decomposition to Document Line Segmentation

ACM Computing Classification System (1998): I.7, I.7.5.

A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications

ACM Computing Classification System (1998): E.4.

Construction of Optimal Linear Codes by Geometric Puncturing

Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4.

A Note on the L2-norm of the Second Fundamental Form of Algebraic Manifolds

2000 Mathematics Subject Classification: 53C42, 53C55.

Special compositions in affinely connected spaces without a torsion

2000 Mathematics Subject Classification: 53B05, 53B99.