where the map R/(x1 , . . . , x m n ) −→ R/(x m+1 1 , . . . , x m+1 n ) is multiplication by the image of the element x1 · · ·xn. As these descriptions suggest, H a(R) is usually not finitely generated as an R-module. However local cohomology modules have useful finiteness properties in certain cases, e.g., for a local ring (R,m), the modules H m(R) satisfy the descending chain condition. This ...

After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of their main algebraic and geometric properties. Finally, for module skew codes constructed only with an automorphism, we give some BCH type lower bounds for their...

für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...

für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...

Poirier and Reutenauer defined a Hopf algebra on the Z-span of all standard Young tableaux in [10], which is later studied in [4, 11]. The Robinson-Schensted-Knuth insertion was used to relate the bialgebra to Schur functions. Schur function is a class of symmetric functions that can be determined by the summation of all semistandard Young tableaux of shape . With the help of the PR-bialgebra, ...

A Las Vegas randomized algorithm is given to compute the Hermite normal form of a nonsingular integer matrix dimension n . The uses quadratic multiplication and cubic has running time bounded by O ( 3 (log + log || ||) 2 ) bit operations, where = max ij | denotes largest entry in absolute value. variant that pseudo-linear 1 o (1) exponent `` (1)′′ captures additional factors \(c_1 (\log n)^{c_2...

These are notes from two lectures given in MATH 27200, Basic Functional Analysis, at the University of Chicago in March 2010. The proof of the spectral theorem for compact operators comes from [Zim90, Chapter 3]. 1. The Spectral Theorem for Compact Operators The idea of the proof of the spectral theorem for compact self-adjoint operators on a Hilbert space is very similar to the finite-dimensio...

A divisibility test of Arend Heyting, for polynomials over a …eld in an intuitionistic setting, may be thought of as a kind of division algorithm. We show that such a division algorithm holds for divisibility by polynomials of content 1 over any commutative ring in which nilpotent elements are zero. In addition, for an arbitary commutative ring R, we characterize those polynomials g such that t...