879 resultados para Tetrahedral groups
Resumo:
We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.
Resumo:
Let G be an abstract Kac-Moody group over a finite field and G the closure of the image of G in the automorphism group of its positive building. We show that if the Dynkin diagram associated to G is irreducible and neither of spherical nor of affine type, then the contraction groups of elements in G which are not topologically periodic are not closed. (In those groups there always exist elements which are not topologically periodic.)
Resumo:
Let Γ be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph Γ, which we call canonical parabolic subgroups. A natural extension of the definition leads to canonical quasiparabolic subgroups. It is shown that the centralisers of subsets of G are the conjugates of canonical quasiparabolic centralisers satisfying certain graph theoretic conditions.
Resumo:
Discriminating groups were introduced by G.Baumslag, A.Myasnikov and V.Remeslennikov as an outgrowth of their theory of algebraic geometry over groups. However they have taken on a life of their own and have been an object of a considerable amount of study. In this paper we survey the large array results concerning the class of discriminating groups that have been developed over the past decade.
Resumo:
"Vegeu el resum a l’inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
The first main result of the paper is a criterion for a partially commutative group G to be a domain. It allows us to reduce the study of algebraic sets over G to the study of irreducible algebraic sets, and reduce the elementary theory of G (of a coordinate group over G) to the elementary theories of the direct factors of G (to the elementary theory of coordinate groups of irreducible algebraic sets). Then we establish normal forms for quantifier-free formulas over a non-abelian directly indecomposable partially commutative group H. Analogously to the case of free groups, we introduce the notion of a generalised equation and prove that the positive theory of H has quantifier elimination and that arbitrary first-order formulas lift from H to H * F, where F is a free group of finite rank. As a consequence, the positive theory of an arbitrary partially commutative group is decidable.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
The measurement of social polarization has received little attention from the literature. The only social polarization index that has been used to measure religious or ethnic polarization (the RQ index) has several shortcomings that are critically discussed in the paper. In particular, that index is not taking into account the existing distance between and within different groups. A couple of axiomatically characterized social polarization indices that overcome these limitations are presented. In the empirical section we show that the rankings of countries according to the levels of polarization change to a great extent when we replace the RQ index by the indices presented in this paper.
Resumo:
Background: There is little information regarding the impact of diet on disease incidence and mortality in Switzerland. We assessed ecologic correlations between food availability and disease.Methods: In this ecologic study for the period 1970-2009, food availability was measured using the food balance sheets of the Food and Agriculture Organization of the United Nations. Standardized mortality rates (SMRs) were obtained from the Swiss Federal Office of Statistics. Cancer incidence data were obtained from the World Health Organization Health For All database and the Vaud Cancer Registry. Associations between food availability and mortality/incidence were assessed at lags 0, 5, 10, and 15 years by multivariate regression adjusted for total caloric intake.Results: Alcoholic beverages and fruit availability were positively associated, and fish availability was inversely associated, with SMRs for cardiovascular diseases. Animal products, meat, and animal fats were positively associated with the SMR for ischemic heart disease only. For cancer, the results of analysis using SMRs and incidence rates were contradictory. Alcoholic beverages and fruits were positively associated with SMRs for all cancer but inversely associated with all-cancer incidence rates. Similar findings were obtained for all other foods except vegetables, which were weakly inversely associated with SMRs and incidence rates. Use of a 15-year lag reversed the associations with animal and vegetal products, weakened the association with alcohol and fruits, and strengthened the association with fish.Conclusions: Ecologic associations between food availability and disease vary considerably on the basis of whether mortality or incidence rates are used in the analysis. Great care is thus necessary when interpreting our results.
Resumo:
The sequence of pitches which form a musical melody can be transposed or inverted. Since the 1970s, music theorists have modeled musical transposition and inversion in terms of an action of the dihedral group of order 24. More recently music theorists have found an intriguing second way that the dihedral group of order 24 acts on the set of major and minor triads. We illustrate both geometrically and algebraically how these two actions are dual. Both actions and their duality have been used to analyze works of music as diverse as Hindemith and the Beatles.
Resumo:
We give a unified solution the conjugacy problem in Thompson’s groups F, V , and T using strand diagrams, and we analyze the complexity of the resulting algorithms.