7 research outputs found

    Simple algebras of Weyl type

    Full text link
    Over a field FF of any characteristic, for a commutative associative algebra AA with an identity element and for the polynomial algebra F[D]F[D] of a commutative derivation subalgebra DD of AA, the associative and the Lie algebras of Weyl type on the same vector space A[D]=A⊗F[D]A[D]=A\otimes F[D] are defined. It is proved that A[D]A[D], as a Lie algebra (modular its center) or as an associative algebra, is simple if and only if AA is DD-simple and A[D]A[D] acts faithfully on AA. Thus a lot of simple algebras are obtained.Comment: 9 pages, Late

    Phase Splitting for Periodic Lie Systems

    Full text link
    In the context of the Floquet theory, using a variation of parameter argument, we show that the logarithm of the monodromy of a real periodic Lie system with appropriate properties admits a splitting into two parts, called dynamic and geometric phases. The dynamic phase is intrinsic and linked to the Hamiltonian of a periodic linear Euler system on the co-algebra. The geometric phase is represented as a surface integral of the symplectic form of a co-adjoint orbit.Comment: (v1) 15 pages. (v2) 16 pages. Some typos corrected. References and further comments added. Final version to appear in J. Phys. A

    Proceedings of the American Mathematical Society 127 11 3169 3174 AMER MATHEMATICAL SOC PROVIDENCE; 201 CHARLES ST, PROVIDENCE, RI 02940-2213 USA

    No full text
    A (non-associative) algebra A, over a field k, is called homogeneous if its automorphism group permutes transitively the one dimensional subspaces of A. Suppose A is a nontrivial finite dimensional homogeneous algebra over an infinite field. Then we prove that x(2) = 0 for all x in A, and so xy = yx for all x; y is an element of A

    Computational methods of linear algebra

    No full text

    Bibliography of the genus Apodemus (Rodentia, Muridae)

    No full text
    corecore