Test Sets in Free Metabelian Lie Algebras

We calculate the test rank of a finite rank free metabelian Lie algebra over an arbitrary field and characterize the test sets for these algebras. We prove that each automorphism that is the identity modulo the derived subalgebra and that acts as the identity on some test set is an inner automorphism.     

On Operations and Linear Extensions of Well Partially Ordered Sets

A (partially) ordered set P is well founded if no infinite decreasing sequences occur in P. A well founded poset containing no infinite antichains is called partially well ordered. We investigate some operations preserving that property and linear extensions of partial well orders. This revised version was published online in September 2006 with corrections to the Cover Date.     

Tractable Partially Ordered Sets Derived from Root Systems and Biased Graphs

We study new posets Q obtained by removing from a geometric lattice L ofa biased graph certain flats indexed by a simplicial complex . (One example of L is the lattice of flats of thevector matroid of a root system B _n .) We study the structureand compute the characteristic polynomial of Q. With certainchoices of L and , including ones for which Q is alattice interpolating between those of B _n and D _n , we observe curious relationships among the roots of thecharacteristic polynomials of Q, L, and .     

Existence and Uniqueness of Fixed Point in Partially Ordered Sets and Applications to Ordinary Differential Equations

We prove some fixed point theorems in partially ordered sets, providing an extension of the Banach contractive mapping theorem. Having studied previously the nondecreasing case, we consider in this paper nonincreasing mappings as well as non monotone mappings. We also present some applications to first–order ordinary differential equations with periodic boundary conditions, proving the existence of a unique solution admitting the existence of a lower solution. Research partially supported by Ministerio de Educación y Ciencia and FEDER, Project MTM2004-06652-C03-01, and by Xunta de Galicia and FEDER, Projects PGIDIT02PXIC20703PN and PGIDIT05PXIC20702PN     

完备化Witt代数中自然出现的一些非有限阶化李代数的表示

讨论了完备化Witt代数的三类非有限阶化子代数的不可约非权模的实现,并利用它们的表示得到一些有趣的组合恒等式.     

偏序集最小顶点割算法与最小费用赶工问题

在网络计划问题中,一项大的工程由许多工序合成。工序与工序之间存在着一定的前后关系,每个工序有着自己的正常加工时间和通过赶工所能达到的最短加工时间以及每赶工一天的赶工费用。设一项工程的正常工期为T天,通过对所有可能的工序赶工,整个工程能达到的最短工期为S天。本文的问题是,对于任意给定的t(S t相似文献   

Levi and Malcev Theorems for Finite-Dimensional Algebras from the Variety Defined by the Identities x2 =J(x,y, zu) =0

We study the variety of binary Lie algebras defined by the identities x2 =J(x,y,zu) =0,where J(a,b,c) denotes the Jacobian of a,b,c.Building on previous work by Carrillo,Rasskazova,Sabinina and Grishkov,in the present article it is shown that the Levi and Malcev theorems hold for this variety of algebras.     

nvolutorial Płonka sums

The construction of the sum of a direct (semilattice ordered) system of algebras introduced by J. Plonka – later known as the Plonka sum – is one of the most important methods of composition in universal algebra, having a number of applications in different algebraic theories, such as semigroup theory, semiring theory, etc. In this paper we present a more general way for constructing algebras with involution, that is, algebraic systems equipped with a unary involutorial operation which is at the same time an antiautomorphism of the underlying algebra. It is the sum – involutorial Plonka sum, as we call it – of an involution semilattice ordered system of algebras. We investigate its basic properties, as well as the problem of its subdirect decomposition.