Almost Primitive Elements of Free lie Algebras of Small Ranks

Let K be a field, X = {x1, . . . , xn}, and let L(X) be the free Lie algebra over K with the set X of free generators. A. G. Kurosh proved that subalgebras of free nonassociative algebras are free, A. I. Shirshov proved that subalgebras of free Lie algebras are free. A subset M of nonzero elements of the free Lie algebra L(X) is said to be primitive if there is a set Y of free generators of L(X), L(X) = L(Y ), such that M ? Y (in this case we have |Y | = |X| = n). Matrix criteria for a subset of elements of free Lie algebras to be primitive and algorithms to construct complements of primitive subsets of elements with respect to sets of free generators have been constructed. A nonzero element u of the free Lie algebra L(X) is said to be almost primitive if u is not a primitive element of the algebra L(X), but u is a primitive element of any proper subalgebra of L(X) that contains it. A series of almost primitive elements of free Lie algebras has been constructed. In this paper, for free Lie algebras of rank 2 criteria for homogeneous elements to be almost primitive are obtained and algorithms to recognize homogeneous almost primitive elements are constructed.     

Primitive Elements and Automorphisms of Free Algebras of Schreier Varieties

In this article, we review results on primitive elements of free algebras of main types of Schreier varieties of algebras. A variety of linear algebras over a field is Schreier if any subalgebra of a free algebra of this variety is free in the same variety of algebras. A system of elements of a free algebra is primitive if it is a subset of some set of free generators of this algebra. We consider free nonassociative algebras, free commutative and anti-commutative nonassociative algebras, free Lie algebras and superalgebras, and free Lie p-algebras and p-superalgebras. We present matrix criteria for systems of elements of elements. Primitive elements distinguish automorphisms: endomorphisms sending primitive elements to primitive elements are automorphisms. We give a series of examples of almost primitive elements (an element of a free algebra is almost primitive if it is not a primitive element of the whole algebra, but it is a primitive element of any proper subalgebra which contains it). We also consider generic elements and Δ-primitive elements. Translated from Itogi Nauki i Tekhniki, Seriya Sovremennaya Matematika i Ee Prilozheniya. Tematicheskie Obzory. Vol. 74, Algebra-15, 2000.     

Diophantine geometry over groups V1: Quantifier elimination I

This paper is the first part (out of two) of the fifth paper in a sequence on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the two papers on quantifier elimination we use the iterative procedure that validates the correctness of anAE sentence defined over a free group, presented in the fourth paper, to show that the Boolean algebra ofAE sets defined over a free group is invariant under projections, and hence show that every elementary set defined over a free group is in the Boolean algebra ofAE sets. The procedures we use for quantifier elimination, presented in this paper and its successor, enable us to answer affirmatively some of Tarski's questions on the elementary theory of a free group in the sixth paper of this sequence. Partially supported by an Israel Academy of Sciences Fellowship.     

Jacobson-Chevalley稠密定理的一个推广

我们在[1]中证明了,一个半环(hemiring)关于它的Jacobson关系根的商同构于完全本原半环的亚直和。这使我们有兴趣对这个特殊的半环类——完全本原半环的结构作进一步的讨论。本文的主要结果是:一个半环是完全本原的当且仅当它是一个半模上的亚稠密自同态半环。这个定理给出了完全本原半环的结构,推广了Jacobson—Chevalley稠密定理。     

Diophantine geometry over groups V2: quantifier elimination II

This paper is the sixth in a sequence on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the two papers on quantifier elimination we use the iterative procedure that validates the correctness of an AE sentence defined over a free group, presented in the fourth paper, to show that the Boolean algebra of AE sets defined over a free group is invariant under projections, hence, show that every elementary set defined over a free group is in the Boolean algebra of AE sets. The procedures we use for quantifier elimination, presented in this paper, enable us to answer affirmatively some of Tarski’s questions on the elementary theory of a free group in the last paper of this sequence. Received (resubmission): January 2004 Revision: November 2005 Accepted: March 2006 Partially supported by an Israel Academy of Sciences Fellowship.     

Basic coset geometries

In earlier work we gave a characterisation of pregeometries which are ‘basic’ (that is, admit no ‘non-degenerate’ quotients) relative to two different kinds of quotient operation, namely taking imprimitive quotients and normal quotients. Each basic geometry was shown to involve a faithful group action, which is primitive or quasiprimitive, respectively, on the set of elements of each type. For each O’Nan-Scott type of primitive group, we construct a new infinite family of geometries, which are thick and of unbounded rank, and which admit a flag-transitive automorphism group acting faithfully on the set of elements of each type as a primitive group of the given O’Nan-Scott type.     

Primitive elements of free nonassociative algebras

Improved algorithms to construct complements of primitive systems of elements of free nonassociative algebras with respect to free generating sets and algorithms to realize the rank of a system of elements are constructed and implemented. Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 5, pp. 171–192, 2007.     

Explicit determination of certain minimal constabelian codes

Constabelian codes can be viewed as ideals in twisted group algebras over finite fields. In this paper we study decomposition of semisimple twisted group algebras of finite abelian groups and prove results regarding complete determination of a full set of primitive orthogonal idempotents in such algebras. We also explicitly determine complete sets of primitive orthogonal idempotents of twisted group algebras of finite cyclic and abelian p-groups. We also describe methods of determining complete set of primitive idempotents of abelian groups whose orders are divisible by more than one prime and give concrete (numerical) examples of minimal constabelian codes, illustrating the above mentioned results.     

Twofold fuzzy sets and rough sets—Some issues in knowledge representation

This paper deals with the representation of sets where the membership of some elements may be ill-known rather than just a matter of degree as in a fuzzy set. The notion of a twofold fuzzy set is introduced when the relevant information for determining the membership status is incomplete. A twofold fuzzy set is made of a nested pair of fuzzy sets: the one which gathers the elements which more or less necessarily belong and the one which gathers the elements which more or less possibly belong. Twofold fuzzy sets are compared from a frontal and from a semantical point of view with other proposals and particularly with the notion of a rough set recently introduced by Pawlak. Set operations of twofold fuzzy sets are discussed and the cardinality of a twofold fuzzy set is defined. Twofold fuzzy relations are also introduced. Finally, various applications of twofold fuzzy sets in knowledge representation are briefly discussed.     

Dimension Formulas for the Free Nonassociative Algebra

The free nonassociative algebra has two subspaces which are closed under both the commutator and the associator: the Akivis elements and the primitive elements. Every Akivis element is primitive, but there are primitive elements which are not Akivis. Using a theorem of Shestakov, we give a recursive formula for the dimension of the Akivis elements. Using a theorem of Shestakov and Umirbaev, we prove a closed formula for the dimension of the primitive elements. These results generalize the Witt dimension formula for the Lie elements in the free associative algebra.     

Bidendriform bialgebras, trees, and free quasi-symmetric functions

We introduce bidendriform bialgebras, which are bialgebras such that both product and coproduct can be split into two parts satisfying good compatibilities. For example, the Malvenuto-Reutenauer Hopf algebra and the non-commutative Connes-Kreimer Hopf algebras of planar decorated rooted trees are bidendriform bialgebras. We prove that all connected bidendriform bialgebras are generated by their primitive elements as a dendriform algebra (bidendriform Milnor-Moore theorem) and then is isomorphic to a Connes-Kreimer Hopf algebra. As a corollary, the Hopf algebra of Malvenuto-Reutenauer is isomorphic to the Connes-Kreimer Hopf algebra of planar rooted trees decorated by a certain set. We deduce that the Lie algebra of its primitive elements is free in characteristic zero (G. Duchamp, F. Hivert and J.-Y. Thibon conjecture).     

Ultraproducts of continuous posets

We consider local partial clones defined on an uncountable set E having the form Polp(\({\mathfrak{R}}\)), where \({\mathfrak{R}}\) is a set of relations on E. We investigate the notion of weak extendability of partial clones of the type Polp(\({\mathfrak{R}}\)) (in the case of E countable, this coincides with the notion of extendability previously introduced by the author in 1987) which allows us to expand to uncountable sets results on the characterization of Galois-closed sets of relations as well as model-theoretical properties of a relational structure \({\mathfrak{R}}\). We establish criteria for positive primitive elimination sets (sets of positive primitive formulas over \({\mathfrak{R}}\) through which any positive primitive definable relation over \({\mathfrak{R}}\) can be expressed without existential quantifiers) for finite \({\mathfrak{R}}\) as well as for \({\mathfrak{R}}\) having only finite number of positive primitive definable relations of any arity. Emphasizing the difference between countable and uncountable sets, we show that, unlike in the countable case, the characterization of Galois-closed sets InvPol(\({\mathfrak{R}}\)) (that is, all relations which are invariant under all operations from the clone Pol(\({\mathfrak{R}}\)) defined on an uncountable set) cannot be obtained via the application of finite positive primitive formulas together with infinite intersections and unions of updirected sets of relations from \({\mathfrak{R}}\).     

Automorphic and endomorphic reducibility and primitive endomorphisms of free metabelian groups

Let S be the free metabelian group of rank 2. In this paper we prove the following results:(i) Given a pair of elements g, h of S, there exists an algorithm to decide whether or not g is an automorphic image of h; (ii) If g, h are in the commutator subgroup S′ of S such that each is an endomorphic image of the other then g , h are automorphic; (iii) If an endomorphism of S maps primitive elements of S to primitive elements of S then it defines an automorphism of S. We also include an example to show that, in (ii) above,the requirement that g,h are in S ? can not be relaxed.     

Automorphisms and primitive elements of free lie superalgebras

We consider images of primitive elements of free color Lie (p-)su per algebras under endomorphisms of these algebras Web prove that endomorphisms preserving primitivity of elements are automorphisms (Theorem 4). Note that for free groups this problem was discussed in [10], Problem 2a. At the same time we show that it is not true if we consider only images of linear combinations of elements from free generatig set (see Example, Theorem 5). We formulate some open questions. In Section 1 we give necessary definitions and collect preliminary results. In Section 2 we prove main theorems. The results of this article were presented at algebraic semi­nars of Moscow State University.     

Diophantine geometry over groups IV: An iterative procedure for validation of a sentence

This paper is the fourth in a series on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the fourth paper we present an iterative procedure that validates the correctness of anAE sentence defined over a free group. The terminating procedure presented in this paper is the basis for our analysis of elementary sets defined over a free group presented in the next papers in the series. Partially supported by an Israel Academy of Sciences Fellowship.     

The free boundary problem of a semiconductor in thermal equilibrium

The quasi-hydrodynamic model for semiconductor devices in thermal equilibrium admits in general solutions for which the electron or hole density vanish. These sets are called vacuum sets. In this paper estimates on the vacuum sets and a first step in the regularity of the free boundary of these sets are presented. Numerical examples, including error estimates for linear finite elements, for the devices diode, bipolar transistor and thyristor indicate that the free boundary is more regular than theoretically predicted.     

Diophantine geometry over groups VI: the elementary theory of a free group

This paper is the sixth in a sequence on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the sixth paper we use the quantifier elimination procedure presented in the two parts of the fifth paper in the sequence, to answer some of A. Tarski’s problems on the elementary theory of a free group, and to classify finitely generated (f.g.) groups that are elementarily equivalent to a non-abelian f.g. free group. Received (resubmission): January 2004 Revision: January 2006 Accepted: January 2006 Partially supported by an Israel Academy of Sciences fellowship.     

Visualization of Multivariate Density Estimates With Level Set Trees

This article presents a method for visualization of multivariate functions. The method is based on a tree structure—called the level set tree—built from separated parts of level sets of a function. The method is applied for visualization of estimates of multivarate density functions. With different graphical representations of level set trees we may visualize the number and location of modes, excess masses associated with the modes, and certain shape characteristics of the estimate. Simulation examples are presented where projecting data to two dimensions does not help to reveal the modes of the density, but with the help of level set trees one may detect the modes. I argue that level set trees provide a useful method for exploratory data analysis.     

扰动模糊集的粗糙度

首先,将扰动模糊集和粗糙集理论相结合,提出了粗糙扰动模糊集的概念并研究了其基本性质.接着,通过引进扰动模糊集水平上、下边界区域的概念,克服了粗糙集理论中普遍存在的两个集合的上近似的交不等于两个集合的交的上近似(两个集合的下近似的并不等于两个集合的并的下近似)的缺陷.最后,定义了依参数的扰动模糊集的粗糙度的定义,讨论了其基本性质.     

Generating Elements for Groups of the Form F/R'

Necessary and sufficient conditions are specified for a group of a specified type to be generated by its given elements (F is a free product). Using these conditions (and relying essentially on the Shmel'kin embedding), we establish the criterion of being primitive for metabelian products of Abelian groups. A result by Birman and the primitivity criterion for free metabelian groups are generalized.