5 resultados para Graph Automorphism Group

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

80.00% 80.00%

Publicador:

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).

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This report aims at giving a general overview on the classification of the maximal subgroups of compact Lie groups (not necessarily connected). In the first part, it is shown that these fall naturally into three types: (1) those of trivial type, which are simply defined as inverse images of maximal subgroups of the corresponding component group under the canonical projection and whose classification constitutes a problem in finite group theory, (2) those of normal type, whose connected one-component is a normal subgroup, and (3) those of normalizer type, which are the normalizers of their own connected one-component. It is also shown how to reduce the classification of maximal subgroups of the last two types to: (2) the classification of the finite maximal Sigma-invariant subgroups of centerfree connected compact simple Lie groups and (3) the classification of the Sigma-primitive subalgebras of compact simple Lie algebras, where Sigma is a subgroup of the corresponding outer automorphism group. In the second part, we explicitly compute the normalizers of the primitive subalgebras of the compact classical Lie algebras (in the corresponding classical groups), thus arriving at the complete classification of all (non-discrete) maximal subgroups of the compact classical Lie groups.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Let k be an algebraically closed field of characteristic zero and let L be an algebraic function field over k. Let sigma : L -> L be a k-automorphism of infinite order, and let D be the skew field of fractions of the skew polynomial ring L[t; sigma]. We show that D contains the group algebra kF of the free group F of rank 2.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Abstract Background Recently, it was realized that the functional connectivity networks estimated from actual brain-imaging technologies (MEG, fMRI and EEG) can be analyzed by means of the graph theory, that is a mathematical representation of a network, which is essentially reduced to nodes and connections between them. Methods We used high-resolution EEG technology to enhance the poor spatial information of the EEG activity on the scalp and it gives a measure of the electrical activity on the cortical surface. Afterwards, we used the Directed Transfer Function (DTF) that is a multivariate spectral measure for the estimation of the directional influences between any given pair of channels in a multivariate dataset. Finally, a graph theoretical approach was used to model the brain networks as graphs. These methods were used to analyze the structure of cortical connectivity during the attempt to move a paralyzed limb in a group (N=5) of spinal cord injured patients and during the movement execution in a group (N=5) of healthy subjects. Results Analysis performed on the cortical networks estimated from the group of normal and SCI patients revealed that both groups present few nodes with a high out-degree value (i.e. outgoing links). This property is valid in the networks estimated for all the frequency bands investigated. In particular, cingulate motor areas (CMAs) ROIs act as ‘‘hubs’’ for the outflow of information in both groups, SCI and healthy. Results also suggest that spinal cord injuries affect the functional architecture of the cortical network sub-serving the volition of motor acts mainly in its local feature property. In particular, a higher local efficiency El can be observed in the SCI patients for three frequency bands, theta (3-6 Hz), alpha (7-12 Hz) and beta (13-29 Hz). By taking into account all the possible pathways between different ROI couples, we were able to separate clearly the network properties of the SCI group from the CTRL group. In particular, we report a sort of compensatory mechanism in the SCI patients for the Theta (3-6 Hz) frequency band, indicating a higher level of “activation” Ω within the cortical network during the motor task. The activation index is directly related to diffusion, a type of dynamics that underlies several biological systems including possible spreading of neuronal activation across several cortical regions. Conclusions The present study aims at demonstrating the possible applications of graph theoretical approaches in the analyses of brain functional connectivity from EEG signals. In particular, the methodological aspects of the i) cortical activity from scalp EEG signals, ii) functional connectivity estimations iii) graph theoretical indexes are emphasized in the present paper to show their impact in a real application.