Thesis (M.S.)--Missouri State University, 2008. / "August 2008." Includes bibliographical references (leaf 53). Also available online.

Orientador: Paulo Roberto Brumatti / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Ciencia da Computação / Made available in DSpace on 2018-08-09T23:37:45Z (GMT). No. of bitstreams: 1 DiazNoguera_MaribeldelCarmen_M.pdf: 632573 bytes, checksum: fbcf2bd0092558fce4ba4d082d4c68c7 (MD5) Previous issue date: 2007 / Resumo: O principal objetivo desta dissertação é apresentar resultados centrais sobre derivações localmente nilpotentes no anel de polinômios B = k[x1, ..., xn], para n = 3 que foram apresentados por Daniel Daigle em [2 ], [3] e [4] .Para este propósito, introduziremos os conceitos básicos e fundamentais da teoria das derivações num anel e apresentaremos resultados em relação a derivações localmente nilpotentes num domínio de característica zero e de fatorização única. Entre tais resultados está a fórmula Jacobiana que usaremos para descrever o conjunto das derivações equivalentes e localmente nilpotentes de B = k[x, y, z] e o conjunto LND(B), com B = k[x,y]. Também, explicítam-se condições equivalentes para a existência de uma derivação ?-homogênea e localmente nilpotente de B = k[x, y, z] com núcleo k[¿, g], onde {¿}, {g} e B, mdc(?) = mdc(?(¿), ? (g)) = 1 / Abstract: In this dissertation we present centraIs results on locally nilpotents derivations in a ring of polynomials B = k[x1, ..., xn], for n = 3, which were presented by Daniel Daigle in [2], [3] and [4]. For this, we introduce basic fundamenta1 results of the theory of derivations in a ring and we present results on locally nilpotents derivations in a domain with characteristic zero and unique factorization. One of these results is the Jacobian forrnula that we use to describe the set of the equivalent loca11y nilpotents derivations of B = k[x, y, z] and the set LND(B) where B = k[x, y]. Moreover, we give equivalent conditions to the existence of a ?-homogeneous locally nilpotent derivation in the ring B = k[x, y, z] with kernel k[¿, g], {¿} and {g} e B, and mdc(?) = mdc(?(¿), ? (g)) = 1 / Mestrado / Algebra / Mestre em Matemática

No description available.

Cyclic codes are a well-known class of linear block codes with efficient decoding algorithms. In recent years they have been generalized to skew-constacyclic codes; such a generalization has previously been shown to be useful. We begin with a study of skew-polynomial rings so that we may examine these codes algebraically as quotient modules of non-commutative skew-polynomial rings. We introduce a skew-generalized circulant matrix to aid in examining skew-constacyclic codes, and we use it to recover a well-known result on the duals of skew-constacyclic codes from Boucher/Ulmer in 2011. We also motivate and develop a notion of idempotent elements in these quotient modules. We are particularly concerned with the existence and uniqueness of idempotents that generate a given submodule; we generalize relevant results from previous work on skew-constacyclic codes by Gao/Shen/Fu in 2013 and well-known results from the classical case.

O objetivo desta dissertação é estudar o radical de Jacobson de anéis de polinômios diferenciais. Mostramos um resultado de M. Ferrero, K. Kishimoro, K. Motose, que mostra que no caso geral, o radical de um anel de polinômios diferenciais é um anel de polinômios diferenciais sobre algum ideal do anel dos coeficientes. Assumindo que o anel dos coeficientes satisfaça uma identidade polinomial, mostramos seguindo B. Madill que este ideal é um ideal nil. Se o anel dos coeficientes é adicionalmente localmente nilpotente, seguindo J. Bell, B. Madill, F. Shinko, mostramos que o anel de polinômios diferenciais será localmente nilpotente. Ainda seguindo J. Bell et al, se o anel dos coeficientes é uma álgebra sobre um corpo de característica zero e tal álgebra satisfaz uma identidade polinomial, mostramos que o ideal nil é o radical de Köthe. Para tais demonstrações, cobriremos os tópicos preliminares necessários para entender os enunciados: radical nil, radical de Levitzki, radical de Baer, radical de Jacobson e propriedades, anéis PI, polinômios centrais, teorema de Kaplansky. / The aim of this work is to study the Jacobson radical of differential polynomial rings. We show a result of M. Ferrero, K. Kishimoto, K. Motose, which shows that in general, the radical of a differential polynomial ring is a differential polynomial ring over some ideal of the ring of coefficients. Assuming that the ring of coefficients satisfies a polynomial identity, we show following B. Madill that this ideal is nil. If the ring of coefficients is additionally locally nilpotent, following J. Bell, B. Madill, F. Shinko, we show that the differential polynomial ring is locally nilpotent. Still following J. Bell et al, if the ring of coefficients is an algebra over a field of zero characteristic and this algebra satisfies a polynomial identity, we show that the nil ideal is the Köthe radical. For the proofs, we cover the preliminary topics necessary for understanding the statements: nil radical, Levitzki radical, Baer radical, Jacobson radical and its properties, PI-rings, central polynomials, Kaplanskys theorem.

O objetivo desta dissertação é estudar o radical de Jacobson de anéis de polinômios diferenciais. Mostramos um resultado de M. Ferrero, K. Kishimoro, K. Motose, que mostra que no caso geral, o radical de um anel de polinômios diferenciais é um anel de polinômios diferenciais sobre algum ideal do anel dos coeficientes. Assumindo que o anel dos coeficientes satisfaça uma identidade polinomial, mostramos seguindo B. Madill que este ideal é um ideal nil. Se o anel dos coeficientes é adicionalmente localmente nilpotente, seguindo J. Bell, B. Madill, F. Shinko, mostramos que o anel de polinômios diferenciais será localmente nilpotente. Ainda seguindo J. Bell et al, se o anel dos coeficientes é uma álgebra sobre um corpo de característica zero e tal álgebra satisfaz uma identidade polinomial, mostramos que o ideal nil é o radical de Köthe. Para tais demonstrações, cobriremos os tópicos preliminares necessários para entender os enunciados: radical nil, radical de Levitzki, radical de Baer, radical de Jacobson e propriedades, anéis PI, polinômios centrais, teorema de Kaplansky. / The aim of this work is to study the Jacobson radical of differential polynomial rings. We show a result of M. Ferrero, K. Kishimoto, K. Motose, which shows that in general, the radical of a differential polynomial ring is a differential polynomial ring over some ideal of the ring of coefficients. Assuming that the ring of coefficients satisfies a polynomial identity, we show following B. Madill that this ideal is nil. If the ring of coefficients is additionally locally nilpotent, following J. Bell, B. Madill, F. Shinko, we show that the differential polynomial ring is locally nilpotent. Still following J. Bell et al, if the ring of coefficients is an algebra over a field of zero characteristic and this algebra satisfies a polynomial identity, we show that the nil ideal is the Köthe radical. For the proofs, we cover the preliminary topics necessary for understanding the statements: nil radical, Levitzki radical, Baer radical, Jacobson radical and its properties, PI-rings, central polynomials, Kaplanskys theorem.

No description available.

The topics explored in this project present and interesting picture of close connections between algebra and geometry. Given a specific system of polynomial equations we show how to construct a Groebner basis using Buchbergers Algorithm. Gröbner bases have very nice properties, e.g. they do give a unique remainder in the division algorithm. We use these bases to solve systems of polynomial quations in several variables and to determine whether a function lies in the ideal.

Systems biology aims at system-level understanding of biological systems, in particular cellular networks. The milestones of this understanding are knowledge of the structure of the system, understanding of its dynamics, effective control methods, and powerful prediction capability. The complexity of biological systems makes it inevitable to consider mathematical modeling in order to achieve these goals. The enormous accumulation of experimental data representing the activities of the living cell has triggered an increasing interest in the reverse engineering of biological networks from data. In particular, construction of discrete models for reverse engineering of biological networks is receiving attention, with the goal of providing a coarse-grained description of such networks. In this dissertation we consider the modeling framework of polynomial dynamical systems over finite fields constructed from experimental data. We present and propose solutions to two problems inherent in this modeling method: the necessity of appropriate discretization of the data and the selection of a particular polynomial model from the set of all models that fit the data. Data discretization, also known as binning, is a crucial issue for the construction of discrete models of biological networks. Experimental data are however usually continuous, or, at least, represented by computer floating point numbers. A major challenge in discretizing biological data, such as those collected through microarray experiments, is the typically small samples size. Many methods for discretization are not applicable due to the insufficient amount of data. The method proposed in this work is a first attempt to develop a discretization tool that takes into consideration the issues and limitations that are inherent in short data time courses. Our focus is on the two characteristics that any discretization method should possess in order to be used for dynamic modeling: preservation of dynamics and information content and inhibition of noise. Given a set of data points, of particular importance in the construction of polynomial models for the reverse engineering of biological networks is the collection of all polynomials that vanish on this set of points, the so-called ideal of points. Polynomial ideals can be represented through a special finite generating set, known as Gröbner basis, that possesses some desirable properties. For a given ideal, however, the Gröbner basis may not be unique since its computation depends on the choice of leading terms for the multivariate polynomials in the ideal. The correspondence between data points and uniqueness of Gröbner bases is studied in this dissertation. More specifically, an algorithm is developed for finding all minimal sets of points that, added to the given set, have a corresponding ideal of points with a unique Gröbner basis. This question is of interest in itself but the main motivation for studying it was its relevance to the construction of polynomial dynamical systems. This research has been partially supported by NIH Grant Nr. RO1GM068947-01. / Ph. D.

Le sujet porte sur une classe de codes correcteurs d erreurs dits codes cycliques tordus, et ses applications a l'Informatique quantique et aux codes quasi-cycliques. Les codes cycliques classiques ont une structure d'idéaux dans un anneau de polynômes. Ulmer a introduit en 2008 une généralisation aux anneaux dits de polynômes tordus, une classe d'anneaux non commutatifs introduits par Ore en 1933. Dans cette thèse on explore le cas du corps a quatre éléments et de l'anneau produit de deux copies du corps a deux éléments. / The topic of the thesis is the study of skew cyclic codes, with application to Quantum Computing and quasi-cyclic codes. Classical cyclic codes have a natural structure of ideals in a polynomial ring. This was generalized by Ulmer in 2008 to skew polynomial rings, a class of non commutative rings introduced by Ore in 1933. The latter codes are not classically cyclic if the alphabet ring admits a non trivial automorphism. In this work is explored the cases of the finite field of order four and of a product ring of two copies of the finite field of order two.