• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Grupos com classe de conjugaÃÃo verbal limitada / Groups with bounded verbal conjugacy classes

ValÃria GerÃnimo Pedrosa 14 May 2010 (has links)
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / Seja F um grupo livre e seja w Є F. Dado um grupo G, denotaremos por Gw o conjunto de todos os w-valores em G e por w(G) = [Gw] o subgrupo verbal de G correspondente a w. Uma palavra w à chamada limitadamente concisa se, para cada grupo G tal que |Gw|≤ n, tivermos |w(G)|≤ c, onde c à um inteiro que depende somente de n. Mostraremos que se w à uma palavra limitadamente concisa e G à um grupo tal que |xGw|≤ m para todo x Є G, entÃo |xw(G)|≤ d para todo x Є , onde d = dm, w à um inteiro dependendo somente de m e w. / Let F be a free group and let w Є F. For a group G,let Gw denote the set of all w-values in G and w(G)=[Gw] the verbal subgroup of G corresponding to w. A word w is called boundedly concise if, for each group G such that | Gw | ≤ n, we have |w(G)| ≤ c,for some integer c depending only on n. We will show w is a word boundedly concise G is a group such that |xGw| ≤ m for all x Є G, then |xw(G)|≤ d such that x Є G and a some integer d = d(m,w) depending only on m and w.

Page generated in 0.0247 seconds