27 research outputs found

    On subalgebras of nΓ—nn\times n matrices not satisfying identities of degree 2nβˆ’22n-2

    Get PDF
    The Amitsur-Levitski theorem asserts that Mn(F)M_n(F) satisfies a polynomial identity of degree 2n2n. (Here, FF is a field and Mn(F)M_n(F) is the algebra of nΓ—nn \times n matrices over FF). It is easy to give examples of subalgebras of Mn(F)M_n(F) that do satisfy an identity of lower degree and subalgebras of Mn(F)M_n(F) that satisfy no polynomial identity of degree ≀2nβˆ’2\le 2n-2. Our aim in this paper is to give a full classification of the subalgebras of nΓ—nn \times n matrices that satisfy no nonzero polynomial of degree less than 2n2n.Comment: 11 page

    Factorization of quadratic polynomials in the ring of formal power series over Z\Z

    Full text link
    We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring Z[[x]]Z[[x]] of formal power series with integer coefficients. For n,mβ‰₯1n,m\ge 1 and pp prime, we show that pn+pmΞ²x+Ξ±x2p^n+p^m\beta x+\alpha x^2 is reducible in Z[[x]]Z[[x]] if and only if it is reducible in Zp[x]Z_p[x], the ring of polynomials over the pp-adic integers.Comment: 15 page

    Factoring polynomials in the ring of formal power series over Z

    Full text link
    We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility as power series. Moreover, if a polynomial is reducible over Z[[x]], we provide an explicit factorization algorithm. For polynomials whose constant term is a prime power, our study leads to the discussion of p-adic integers.Comment: 10 pages, submitte
    corecore