Let L be a free restricted Lie algebra and R a restricted ideal of L. Denote by u(L) the restricted enveloping algebra of L and by ω(L) the associative ideal of u(L) generated by L. The purpose of this paper is to identify the subalgebra R ∩ ω(L)ω(R) in terms of R only . This problem is the analogue of the Fox problem for free groups.

Suppose E is a subset of the unit circle T and H∞ ⊂ L∞ is the Hardy subalgebra. We examine the problem of finding the distance from the characteristic function of E to znH∞. This admits an alternate description as a dual extremal problem. Precise solutions are given in several important cases. The techniques used involve the theory of Toeplitz and Hankel operators as well as the construction of...

We consider the problem of decomposing a semisimple Lie algebra deened over a eld of characteristic zero as a direct sum of its simple ideals. The method is based on the decomposition of the action of a Cartan subalgebra. An implementation of the algorithm in the system ELIAS is discussed at the end of the paper.

We consider the problem of learning on a compact metric space X in a functional analytic framework. For a dense subalgebra of Lip(X), the space of all Lipschitz functions on X, the Representer Theorem is derived. We obtain exact solutions in the case of least square minimization and regularization and suggest an approximate solution for the Lipschitz classifier.

Rubin and Narsimhan [1984] proposed a method for formulating fuzzy priorities in goal programming. They used the concept that the membership function based on nested priorities has to be concave to solve the fuzzy goal programming problem by linear programming method. In this paper, we relax the condition of concave membership function by quasi concave membership function. We showed that the fu...

The chapter aims to give computational algorithm to solve a multiobjective non-linear programming problem using Neutrosophic geometric programming technique. As the Neutrosophic optimization technique utilizes degrees of truth-membership, falsity-membership and indeterminacy-membership functions, we made a study of correspondence among those membership functions to see its impact on optimizatio...

For families of orthogonal and symplectic types quantum matrix (QM-) algebras, we derive corresponding versions of the Cayley-Hamilton theorem. For a wider family of BirmanMurakami-Wenzl type QM-algebras, we investigate a structure of its characteristic subalgebra (the subalgebra in which the coefficients of characteristic polynomials take values). We define 3 sets of generating elements of the...

In this note the notion of interval-valued fuzzy BG-algebras (briefly, i-v fuzzy BG-algebras), the level and strong level BG-subalgebra is introduced. Then we state and prove some theorems which determine the relationship between these notions and BG-subalgebras. The images and inverse images of i-v fuzzy BG-subalgebras are defined, and how the homomorphic images and inverse images of i-v fuzzy...

We consider the problem of exact identification for read-once functions over arbitrary Boolean bases. We introduce a new type of queries (subcube identity ones), discuss its connection to previously known ones, and study the complexity of the problem in question. Besides these new queries, learning algorithms are allowed to use classic membership ones. We present a technique of modeling an equi...

A reductive Lie algebra g is one that can be written C(g) ⊕ [g,g], where C(g) denotes the center of g. Equivalently, for any ideal a, there is another ideal b such that g = a⊕ b. A Cartan subalgebra of g is a subalgebra h that is maximal with respect to being abelian and having ad X being semisimple for all X ∈ h. For a reductive group, h = C(g) ⊕ h′, where h′ is a Cartan subalgebra of the semi...