Sökning: "direct sum decomposition of a ring"

Hittade 3 avhandlingar innehållade orden direct sum decomposition of a ring.

  1. 1. Infinite dimensional holomorphy in the ring of formal power series : partial differential operators

    Författare :Henrik Petersson; Andrei Khrennikov; Sean Dineen; Växjö universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; Infinite dimensional holomorphy; Formal power series; Fourier-Borel transform; Paley-Wiener theorem; Fischer decomposition; Fischer pair; Fock space; Cauchy-Problem; Kergin operator; PDE-preserving; Pseudo-differential operators.; MATHEMATICS; MATEMATIK;

    Sammanfattning : We study holomorphy in the ring of formal power series in an infinite number of variables. Thus we restrict our study to (infinite dimensional) holomorphy on sequence spaces and we show that we obtain a rich theory without requiring any topological structure on the domain space. We make a comprehensive PDO-study for the spaces under consideration. LÄS MER

  2. 2. An Encounter with Convolutional Codes over Rings

    Författare :Emma Wittenmark; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Telekommunikationsteknik; Data- och systemvetenskap; Telecommunication engineering; computer technology; direct sum decomposition of a ring; Systems engineering; minimal trellis; generator matrix properties; code properties; convolutional codes; codes over rings;

    Sammanfattning : Convolutional codes is one possibility when there is a need for error-correcting codes in communication systems. Using convolutional codes over rings is a relatively new approach. LÄS MER

  3. 3. Formalizing Refinements and Constructive Algebra in Type Theory

    Författare :Anders Mörtberg; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Formalization of mathematics; refinements; constructive algebra; type theory; Coq; SSReflect;

    Sammanfattning : The extensive use of computers in mathematics and engineering has led to an increased demand for reliability in the implementation of algorithms in computer algebra systems. One way to increase the reliability is to formally verify that the implementations satisfy the mathematical theorems stating their specification. LÄS MER