The Variety of Leibniz Algebras Defined by the Identity x(y(zt)) ≡ 0

2000 Mathematics Subject Classification: Primary: 17A32; Secondary: 16R10, 16P99, 17B01, 17B30, 20C30

An Estimate of the Probability Pr(X

2000 Mathematics Subject Classification: 33C90, 62E99

On the Automorphism Groups of some AG-Codes Based on Ca;b Curves

*Partially supported by NATO.

Compactness in the First Baire Class and Baire-1 Operators

For a polish space M and a Banach space E let B1 (M, E) be the space of first Baire class functions from M to E, endowed with the pointwise weak topology. We study the compact subsets of B1 (M, E) and show that the fundamental results proved by Rosenthal, Bourgain, Fremlin, Talagrand and Godefroy, in case E = R, also hold true in the general case. For instance: a subset of B1 (M, E) is compact iff it is sequentially (resp. countably) compact, the convex hull of a compact bounded subset of B1 (M, E) is relatively compact, etc. We also show that our class includes Gulko compact. In the second part of the paper we examine under which conditions a bounded linear operator T : X ∗ → Y so that T |BX ∗ : (BX ∗ , w∗ ) → Y is a Baire-1 function, is a pointwise limit of a sequence (Tn ) of operators with T |BX ∗ : (BX ∗ , w∗ ) → (Y, · ) continuous for all n ∈ N. Our results in this case are connected with classical results of Choquet, Odell and Rosenthal.

Projectively Solid Sets and an N-dimensional Piccard's Theorem

We discuss functions f : X × Y → Z such that sets of the form f (A × B) have non-empty interiors provided that A and B are non-empty sets of second category and have the Baire property.

Three Spaces Problem for Lyapunov Theorem on Vector Measure

It is proved that a Banach space X has the Lyapunov property if its subspace Y and the quotient space X/Y have it.

New Upper Bounds for Some Spherical Codes

The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) ≤ s whenever x, y ∈ W, x 6= y, is denoted by A(n, s). We use two methods for obtaining new upper bounds on A(n, s) for some values of n and s. We find new linear programming bounds by suitable polynomials of degrees which are higher than the degrees of the previously known good polynomials due to Levenshtein [11, 12]. Also we investigate the possibilities for attaining the Levenshtein bounds [11, 12]. In such cases we find the distance distributions of the corresponding feasible maximal spherical codes. Usually this leads to a contradiction showing that such codes do not exist.

A New Approach for Eliminating the Spurious States in Recurrent Neural Networks

As is well known, the Convergence Theorem for the Recurrent Neural Networks, is based in Lyapunov ́s second method, which states that associated to any one given net state, there always exist a real number, in other words an element of the one dimensional Euclidean Space R, in such a way that when the state of the net changes then its associated real number decreases. In this paper we will introduce the two dimensional Euclidean space R2, as the space associated to the net, and we will define a pair of real numbers ( x, y ) , associated to any one given state of the net. We will prove that when the net change its state, then the product x ⋅ y will decrease. All the states whose projection over the energy field are placed on the same hyperbolic surface, will be considered as points with the same energy level. On the other hand we will prove that if the states are classified attended to their distances to the zero vector, only one pattern in each one of the different classes may be at the same energy level. The retrieving procedure is analyzed trough the projection of the states on that plane. The geometrical properties of the synaptic matrix W may be used for classifying the n-dimensional state- vector space in n classes. A pattern to be recognized is seen as a point belonging to one of these classes, and depending on the class the pattern to be retrieved belongs, different weight parameters are used. The capacity of the net is improved and the spurious states are reduced. In order to clarify and corroborate the theoretical results, together with the formal theory, an application is presented.

Powers and Logarithms

There are applied power mappings in algebras with logarithms induced by a given linear operator D in order to study particular properties of powers of logarithms. Main results of this paper will be concerned with the case when an algebra under consideration is commutative and has a unit and the operator D satisfies the Leibniz condition, i.e. D(xy) = xDy + yDx for x, y ∈ dom D. Note that in the Number Theory there are well-known several formulae expressed by means of some combinations of powers of logarithmic and antilogarithmic mappings or powers of logarithms and antilogarithms (cf. for instance, the survey of Schinzel S[1].

A Basis for Z-Graded Identities of Matrices over Infinite Fields

2000 Mathematics Subject Classification: 16R10, 16R20, 16R50

Binomial Skew Polynomial Rings, Artin-Schelter Regularity, and Binomial Solutions of the Yang-Baxter Equation

2000 Mathematics Subject Classification: Primary 81R50, 16W50, 16S36, 16S37.

Three-Dimensional Operational Calculi for Nonlocal Evolution Boundary Value Problems

Иван Христов Димовски, Юлиан Цанков Цанков - Построени са директни операционни смятания за функции u(x, y, t), непрекъснати в област от вида D = [0, a] × [0, b] × [0, ∞). Наред с класическата дюамелова конволюция, построението използва и две некласически конволюции за операторите ∂2x и ∂2y. Тези три едномерни конволюции се комбинират в една тримерна конволюция u ∗ v в C(D). Вместо подхода на Я. Микусински, основаващ се на конволюционни частни, се развива алтернативен подход с използване на мултипликаторните частни на конволюционната алгебра (C(D), ∗).

Minimal Subspaces with Maximal Dimensioanal Diameters

Владимир Тодоров - Нека X е компактно метрично пространство с dim X = n. Тогава за n − 1 - мерния диаметър dn−1(X) на X е изпълнено неравенството dn−1(X) > 0, докато dn(X) = 0 (да отбележим, че това е една от характеристиките на размерността на Лебег). От тук се получава, че X съдържа минимално по включване затворено подмножество Y , за което dn−1(Y ) = dn−1(X). Известен резултат е, че от това следва, че Y е Канторово Многообразие. В тази бележка доказваме, че всяко такова (минимално) подпространство Y е даже континуум V^n. Получени са също така някои следствия.

Classification of the Maximal Subsemigroups of the Semigroup of all Partial Order-Preserving Transformations

Илинка А. Димитрова, Цветелина Н. Младенова - Моноида P Tn от всички частични преобразования върху едно n-елементно множество относно операцията композиция на преобразования е изучаван в различни аспекти от редица автори. Едно частично преобразование α се нарича запазващо наредбата, ако от x ≤ y следва, че xα ≤ yα за всяко x, y от дефиниционното множество на α. Обект на разглеждане в настоящата работа е моноида P On състоящ се от всички частични запазващи наредбата преобразования. Очевидно P On е под-моноид на P Tn. Направена е пълна класификация на максималните подполугрупи на моноида P On. Доказано е, че съществуват пет различни вида максимални подполугрупи на разглеждания моноид. Броят на всички максимални подполугрупи на POn е точно 2^n + 2n − 2.

The Graves Theorem Revisited II: Robust Convergence of the Newton Method

AMS subject classification: 65J15, 47H04, 90C30.