117 resultados para Tame Automorphisms
Resumo:
We investigate the possibility of interpreting the degeneracy of the genetic code, i.e., the feature that different codons (base triplets) of DNA are transcribed into the same amino acid, as the result of a symmetry breaking process, in the context of finite groups. In the first part of this paper, we give the complete list of all codon representations (64-dimensional irreducible representations) of simple finite groups and their satellites (central extensions and extensions by outer automorphisms). In the second part, we analyze the branching rules for the codon representations found in the first part by computational methods, using a software package for computational group theory. The final result is a complete classification of the possible schemes, based on finite simple groups, that reproduce the multiplet structure of the genetic code. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
In this article, we prove that any automorphism of R. Thompson`s group F has infinitely many twisted conjugacy classes. The result follows from the work of Brin, together with standard facts about R. Thompson`s group F, and elementary properties of the Reidemeister numbers.
Resumo:
For a twisted partial action e of a group G on an (associative non-necessarily unital) algebra A over a commutative unital ring k, the crossed product A x(Theta) G is proved to be associative. Given a G-graded k-algebra B = circle plus(g is an element of G) B-g with the mild restriction of homogeneous non-degeneracy, a criteria is established for B to be isomorphic to the crossed product B-1 x(Theta) G for some twisted partial action of G on B-1. The equality BgBg-1 B-g = B-g (for all g is an element of G) is one of the ingredients of the criteria, and if it holds and, moreover, B has enough local units, then it is shown that B is stably isomorphic to a crossed product by a twisted partial action of G. (c) 2008 Elsevier Inc. All rights reserved.
Resumo:
In this paper, we study the Reidemeister spectrum for metabelian groups of the form Q(n) x Z and Z[1/p](n) x Z. Particular attention is given to the R(infinity)-property of a subfamily of these groups.
Resumo:
Using Sigma theory we show that for large classes of groups G there is a subgroup H of finite index in Aut(G) such that for phi is an element of H the Reidemeister number R(phi) is infinite. This includes all finitely generated nonpolycyclic groups G that fall into one of the following classes: nilpotent-by-abelian groups of type FP(infinity); groups G/G `` of finite Prufer rank; groups G of type FP(2) without free nonabelian subgroups and with nonpolycyclic maximal metabelian quotient; some direct products of groups; or the pure symmetric automorphism group. Using a different argument we show that the result also holds for 1-ended nonabelian nonsurface limit groups. In some cases, such as with the generalized Thompson`s groups F(n,0) and their finite direct products, H = Aut(G).
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Atualmente, há diferentes definições de implicações fuzzy aceitas na literatura. Do ponto de vista teórico, esta falta de consenso demonstra que há discordâncias sobre o real significado de "implicação lógica" nos contextos Booleano e fuzzy. Do ponto de vista prático, isso gera dúvidas a respeito de quais "operadores de implicação" os engenheiros de software devem considerar para implementar um Sistema Baseado em Regras Fuzzy (SBRF). Uma escolha ruim destes operadores pode implicar em SBRF's com menor acurácia e menos apropriados aos seus domínios de aplicação. Uma forma de contornar esta situação e conhecer melhor os conectivos lógicos fuzzy. Para isso se faz necessário saber quais propriedades tais conectivos podem satisfazer. Portanto, a m de corroborar com o significado de implicação fuzzy e corroborar com a implementação de SBRF's mais apropriados, várias leis Booleanas têm sido generalizadas e estudadas como equações ou inequações nas lógicas fuzzy. Tais generalizações são chamadas de leis Boolean-like e elas não são comumente válidas em qualquer semântica fuzzy. Neste cenário, esta dissertação apresenta uma investigação sobre as condições suficientes e necessárias nas quais três leis Booleanlike like — y ≤ I(x, y), I(x, I(y, x)) = 1 e I(x, I(y, z)) = I(I(x, y), I(x, z)) — se mantém válidas no contexto fuzzy, considerando seis classes de implicações fuzzy e implicações geradas por automorfismos. Além disso, ainda no intuito de implementar SBRF's mais apropriados, propomos uma extensão para os mesmos
Resumo:
Z(2)-gradings of Clifford algebras are reviewed and we shall be concerned with an alpha-grading based on the structure of inner automorphisms, which is closely related to the spacetime splitting, if we consider the standard conjugation map automorphism by an arbitrary, but fixed, splitting vector. After briefly sketching the orthogonal and parallel components of products of differential forms, where we introduce the parallel [orthogonal] part as the space [time] component, we provide a detailed exposition of the Dirac operator splitting and we show how the differential operator parallel and orthogonal components are related to the Lie derivative along the splitting vector and the angular momentum splitting bivector. We also introduce multivectorial-induced alpha-gradings and present the Dirac equation in terms of the spacetime splitting, where the Dirac spinor field is shown to be a direct sum of two quaternions. We point out some possible physical applications of the formalism developed.
Resumo:
A fibrino(geno)lytic nonhemorrhagic metalloprotease (neuwiedase) was purified from Bothrops neuwiedi snake venom by a single chromatographic step procedure on a CM-Sepharose column, Neuwiedase represented 4.5% (w/w) of the crude desiccated venom, with an approximate Mr of 20,000 and pI 5.9, As regards the amino acid composition, neuwiedase showed similarities with other metalloproteases, with high proportions of Asx, Glx, Leu, and Ser, Atomic absorption spectroscopy showed that one mole of Zn2+ and one mole of Ca2+ were present per mole olf protein. The cDNA encoding neuwiedase was isolated by RT-PCR from venom gland RNA, using oligonucleotides based on the partially determined amino-acid sequences of this metalloprotease. The fall sequence contained approximately 594 bp, which codified the 198 amino acid residues with an estimated molecular weight of 22,375. Comparison of the nucleotide and amino acid sequences of neuwiedase with those of other snake venom metalloproteases showed a high level of sequential similarity, Neuwiedase has two highly conserved characteristics sequences H(142)E(143)XXH(146)XXG(140)XXH(152) and C164I165M166. The three-dimensional structure of neuwiedase was modeled based on the crystal structure of Crotalus adamanteus Adamalysin II. This model revealed that the zinc binding site region showed a I high structural similarity with other metalloproteases,, the proteolyitc specificity, using the B beta-chain of oxidized insulin as substrate, was shown to be directed to the Ala(14)-Leu(15) and Tyr(16)-Leu(17) peptide bonds which were preferentially hydrolyzed. Neuwiedase is a A alpha,B beta fibrinogenase, Its activity upon the A alpha chain of fibrinogen was detected within 15 min of incubation. The optimal temperature and pH for the degradation of both A alpha and B beta chains were 37 degrees C and 7.4-8.0, respectively. This activity was inhibited by EDTA and 1,10-phenantroline, Neuwiedase also showed proteolytic activity upon fibrin and some components of the extracellular matrix. However, it did not show TAME esterase activity and was not able to inhibit platelet aggregation. (C) 2000 Academic Press.
Resumo:
The current rhythm of petroliferous exploration is esteem that the existing reserves will be depleted in next the 45 years. Thus being, it has that to study intensely, what it has come to be fact, the alternative power plants, as well as the technologies economically capable to ultilizar them. The potential demand of biodiesel for 2020 is taken in consideration that, in accordance with the International Agency of Energia (AIE), in only eight countries, will jump of 34,7 million tons in 2010 for 133,8 million in 2020, with an increment next to 300%. The tame nut is a producing oil plant with all the qualities necessary to be transformed into oil diesel. Beyond perennial and of easy culture, it presents good conservation of the harvested seed, being able to become great producer of substance cousin as optional fuel source. For these authors, this is a culture that can be developed in the small properties, with the available familiar man power, being plus a source of income for the country properties of the Northeast Region. The objective of this work is to evidence the capacity of oil production of the nut-bellwether, and the quality of extration with hexano and methanol in 6 distinct times.
Resumo:
Includes Bibliography
Resumo:
Traffic congestion is nothing new in Latin American cities but has worsened in recent years. Eliminating it is a pipedream, but it should be brought under control. Many economists and transport planners think electronic road pricing would be the best way of tackling it, now that the appropriate technology for implementing it is available. On the other hand, experience shows that, for political reasons, it would be better to begin by adopting simpler methods. To start with, simple road pricing would seem to be the best option. But, over 20 years of experience in London and more than six in Santiago, Chile, made it clear that socio-political barriers have to be surmounted before even this option can be applied in practice. There is more political support for measures to control parking, due in part to the fact that the legal powers do not normally extend to restricting the number of parking spaces available to high-income and influential motorists who have the right to park near their offices and who cause a great deal of the congestion whilst getting there. In Latin America, the relative importance of taxis also diminishes the effectiveness of measures geared to parking, since taxis contribute to congestion although but they do not park. The problem of congestion cannot be solved by using tame measures. The time has come for something bolder, i.e., measures that, at the very least, exercise control over those parking spaces, which so far have been beyond the reach of governments and local authorities, ideally, simple road pricing systems would be even more effective.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
A loop is said to be automorphic if its inner mappings are automorphisms. For a prime p, denote by A(p) the class of all 2-generated commutative automorphic loops Q possessing a central subloop Z congruent to Z(p) such that Q/Z congruent to Z(p) x Z(p). Upon describing the free 2-generated nilpotent class two commutative automorphic loop and the free 2-generated nilpotent class two commutative automorphic p-loop F-p in the variety of loops whose elements have order dividing p(2) and whose associators have order dividing p, we show that every loop of A(p) is a quotient of F-p by a central subloop of order p(3). The automorphism group of F-p induces an action of GL(2)(p) on the three-dimensional subspaces of Z(F-p) congruent to (Z(p))(4). The orbits of this action are in one-to-one correspondence with the isomorphism classes of loops from A(p). We describe the orbits, and hence we classify the loops of A(p) up to isomorphism. It is known that every commutative automorphic p-loop is nilpotent when p is odd, and that there is a unique commutative automorphic loop of order 8 with trivial center. Knowing A(p) up to isomorphism, we easily obtain a classification of commutative automorphic loops of order p(3). There are precisely seven commutative automorphic loops of order p(3) for every prime p, including the three abelian groups of order p(3).
Resumo:
The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.