Galois extension of CP-Graded ring extensions

In this paper, we investigate galois theory of CP-graded ring extensions. In particular, we generalize some galois results given in [1, 2] and, without restriction to nor graded fields nor torsion free of the grade groups, we show that some results of graded field extensions given in [3] hold.

Groups of Order 32 as Galois Groups

2000 Mathematics Subject Classification: 12F12.

Transmission Of Intra-cellular Genetic Information: A System Proposal.

One of the great challenges of the scientific community on theories of genetic information, genetic communication and genetic coding is to determine a mathematical structure related to DNA sequences. In this paper we propose a model of an intra-cellular transmission system of genetic information similar to a model of a power and bandwidth efficient digital communication system in order to identify a mathematical structure in DNA sequences where such sequences are biologically relevant. The model of a transmission system of genetic information is concerned with the identification, reproduction and mathematical classification of the nucleotide sequence of single stranded DNA by the genetic encoder. Hence, a genetic encoder is devised where labelings and cyclic codes are established. The establishment of the algebraic structure of the corresponding codes alphabets, mappings, labelings, primitive polynomials (p(x)) and code generator polynomials (g(x)) are quite important in characterizing error-correcting codes subclasses of G-linear codes. These latter codes are useful for the identification, reproduction and mathematical classification of DNA sequences. The characterization of this model may contribute to the development of a methodology that can be applied in mutational analysis and polymorphisms, production of new drugs and genetic improvement, among other things, resulting in the reduction of time and laboratory costs.

Computing Generators of Free Modules over Orders in Group Algebras

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

Algorithms for Tamagawa Number Conjectures

In dieser Arbeit werden Algorithmen zur Untersuchung der äquivarianten Tamagawazahlvermutung von Burns und Flach entwickelt. Zunächst werden Algorithmen angegeben mit denen die lokale Fundamentalklasse, die globale Fundamentalklasse und Tates kanonische Klasse berechnet werden können. Dies ermöglicht unter anderem Berechnungen in Brauergruppen von Zahlkörpererweiterungen. Anschließend werden diese Algorithmen auf die Tamagawazahlvermutung angewendet. Die Epsilonkonstantenvermutung kann dadurch für alle Galoiserweiterungen L|K bewiesen werden, bei denen L in einer Galoiserweiterung E|Q vom Grad kleiner gleich 15 eingebettet werden kann. Für die Tamagawazahlvermutung an der Stelle 1 wird ein Algorithmus angegeben, der die Vermutung für ein gegebenes Fallbeispiel L|Q numerischen verifizieren kann. Im Spezialfall, dass alle Charaktere rational oder abelsch sind, kann dieser Algorithmus die Vermutung für L|Q sogar beweisen.

Construction and decoding of BCH codes over finite commutative rings

BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.

Forma traço sobre algumas extensões galoisianas de corpos p-Ádicos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Henselian Discrete Valued Fields Admitting One-Dimensional Local Class Field Theory

2000 Mathematics Subject Classification: 11S31 12E15 12F10 12J20.

Lattices for 3-Dimensional Fuzzy Data generated by Fuzzy Galois Connections

Vagueness and high dimensional space data are usual features of current data. The paper is an approach to identify conceptual structures among fuzzy three dimensional data sets in order to get conceptual hierarchy. We propose a fuzzy extension of the Galois connections that allows to demonstrate an isomorphism theorem between fuzzy sets closures which is the basis for generating lattices ordered-sets

On realizability of p-groups as Galois groups

2000 Mathematics Subject Classification: 12F12, 15A66.

An Extension of the Invariance Principle for a Class of Differential Equations with Finite Delay

An extension of the uniform invariance principle for ordinary differential equations with finite delay is developed. The uniform invariance principle allows the derivative of the auxiliary scalar function V to be positive in some bounded sets of the state space while the classical invariance principle assumes that. V <= 0. As a consequence, the uniform invariance principle can deal with a larger class of problems. The main difficulty to prove an invariance principle for functional differential equations is the fact that flows are defined on an infinite dimensional space and, in such spaces, bounded solutions may not be precompact. This difficulty is overcome by imposing the vector field taking bounded sets into bounded sets.

Evaluation of Cadaveric Renal Vein Lengths and Their Extension Loss with Three Types of Ligature and Section

Background and Purpose: The right kidney has been less frequently used in live donor nephrectomy, because of the shorter length of the right renal vein (RRV) that is associated with technical difficulties and higher rates of venous thrombosis. In live open donor or deceased donor transplant nephrectomy, an additional cuff of the inferior vena cava is usually removed, but this is a more difficult and risky maneuver in laparoscopic nephrectomy. For this reason, laparoscopic right nephrectomy (LRN) for renal transplantation (RT) is not frequently performed in most medical institutions. We evaluate the difference between RRV and left renal vein (LRV) lengths in cadavers, as harvested for RT by three clamping methods. Our objective was to obtain information that could clarify when LRN for RT should be encouraged or avoided with regard to conventional surgery. Materials and Methods: Ninety adult fresh unfrozen cadavers were randomly divided into three groups of 30, according to the clamping device used: Satinsky, stapler, and Hem-o-lok clip. The abdominal viscera were removed through a median xyphopubic incision, and the veins were measured on the bench. Two lateral limits were used: The renal hilum and the tangential line of the renal poles. As for medial limits, the inferior vena cava or the laparoscopic clipping device on the RRV were used on the right side, while on the LRV, the medial border of the emergence of the adrenal vein was considered. After section of the renal vein, a slight traction of the extremity was applied for the measurement. All measurements were obtained three times using a metallic millimetric ruler, and the arithmetic mean was considered. The chi-square, one-way analysis of variance, and paired t tests were used for statistical analysis. Statistical significance was accepted at P <= 0.05. Results: The groups of cadavers were homogeneous in demographic characteristics. Regardless of the clamping method and considering the useful length of the LRV, the RRV was statistically smaller. The evaluation of the vein length did not depend on the lateral limit considered. Independent of the clamping method, on both sides, the lengths after the vein section were larger than before the section, a fact attributed to traction. Use of a stapler and a single Hem-o-lok presented the same waste of vein length on the right side. On average, the RRV was 13.7% shorter than the LRV. Conclusions: With the wide acceptance of laparoscopic live donor nephrectomy, the length difference between the veins of both kidneys is an important issue, and the right kidney is therefore used less than the left, compared with conventional surgery. This article represents the first step to quantify the anatomic length of renal veins in different situations. Certainly, more imagenologic or surgical studies should be carried out before decisions can be made for better selection of patients for LRN.

DJKM ALGEBRAS I: THEIR UNIVERSAL CENTRAL EXTENSION

The purpose of this paper is to explicitly describe in terms of generators and relations the universal central extension of the infinite dimensional Lie algebra, g circle times C[t, t(-1), u vertical bar u(2) = (t(2) - b(2))(t(2) - c(2))], appearing in the work of Date, Jimbo, Kashiwara and Miwa in their study of integrable systems arising from the Landau-Lifshitz differential equation.

Experimental analysis of active-passive vibration control using viscoelastic materials and extension and shear piezoelectric actuators

Hybrid active-passive damping treatments combine the reliability, low cost and robustness of viscoelastic damping treatments and the high-performance, modal selective and adaptive piezoelectric active control. Numerous hybrid damping treatments have been reported in the literature. They differ mainly by the relative positions of viscoelastic treatments, sensors and piezoelectric actuators. In this work we present an experimental analysis of three active-passive damping design configurations applied to a cantilever beam. In particular, two design configurations based on the extension mode of piezoelectric actuators combined with viscoelastic constrained layer damping treatments and one design configuration with shear piezoelectric actuators embedded in a sandwich beam with viscoelastic core are analyzed. For comparison purposes, a purely active design configuration with an extension piezoelectric actuator bonded to an elastic beam is also analyzed. The active-passive damping performance of the four design configurations is compared. Results show that active-passive design configurations provide more reliable and wider-range damping performance than the purely active configuration.