Made available in DSpace on 2014-10-09T12:29:17Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:00:50Z (GMT). No. of bitstreams: 1 01343.pdf: 8187182 bytes, checksum: 1a795b521139f6efcc47c46e35075982 (MD5) / Dissertacao (Mestrado) / IEA/D / Instituto de Pesquisas Energeticas e Nucleares - IPEN/CNEN-SP

Our aim is to calculate some graphs associated with two of the larger sporadicsimple groups, Fi₂₄ and the Baby Monster. Firstly we calculate the point line collinearity graph for a maximal 2-local geometry of Fi₂₄. If T is such a geometry, then the point line collinearity graph G will be the graph whose vertices are the points in T, with any two vertices joined by an edge if and only if they are incident with a common line. We found that the graph has diameter 5 and we give its collapsed adjacency matrix. We also calculate part of the commuting involution graph, C, for the class 2C of the Baby Monster, whose vertex set is the conjugacy class 2C, with any two elements joined by an edge if and only if they commute. We have managed to place all vertices inside C whose product with a fixed vertex t does not have 2 power order, with all evidence pointing towards C having diameter 3.

We determine the number and nature of distinct equivalence classes of fuzzy subgroups of finite Abelian p-group G of rank two under a natural equivalence relation on fuzzy subgroups. Our discussions embrace the necessary theory from groups with special emphasis on finite p-groups as a step towards the classification of crisp subgroups as well as maximal chains of subgroups. Unique naming of subgroup generators as discussed in this work facilitates counting of subgroups and chains of subgroups from subgroup lattices of the groups. We cover aspects of fuzzy theory including fuzzy (homo-) isomorphism together with operations on fuzzy subgroups. The equivalence characterization as discussed here is finer than isomorphism. We introduce the theory of keychains with a view towards the enumeration of maximal chains as well as fuzzy subgroups under the equivalence relation mentioned above. We discuss a strategy to develop subgroup lattices of the groups used in the discussion, and give examples for specific cases of prime p and positive integers n,m. We derive formulas for both the number of maximal chains as well as the number of distinct equivalence classes of fuzzy subgroups. The results are in the form of polynomials in p (known in the literature as Hall polynomials) with combinatorial coefficients. Finally we give a brief investigation of the results from a graph-theoretic point of view. We view the subgroup lattices of these groups as simple, connected, symmetric graphs.

Let G be a simple simply connected algebraic group defined over an algebraically closed field K and V an irreducible module defined over K on which G acts. Let E denote the set of vectors in V which are eigenvectors for some non-central semisimple element of G and some eigenvalue in K*. We prove, with a short list of possible exceptions, that the dimension of Ē is strictly less than the dimension of V provided dim V > dim G + 2 and that there is equality otherwise. In particular, by considering only the eigenvalue 1, it follows that the closure of the union of fixed point spaces of non-central semisimple elements has dimension strictly less than the dimension of V provided dim V > dim G + 2, with a short list of possible exceptions. In the majority of cases we consider modules for which dim V > dim G + 2 where we perform an analysis of weights. In many of these cases we prove that, for any non-central semisimple element and any eigenvalue, the codimension of the eigenspace exceeds dim G. In more difficult cases, when dim V is only slightly larger than dim G + 2, we subdivide the analysis according to the type of the centraliser of the semisimple element. Here we prove for each type a slightly weaker inequality which still suffices to establish the main result. Finally, for the relatively few modules satisfying dim V ≤ dim G + 2, an immediate observation yields the result for dim V < dim B where B is a Borel subgroup of G, while in other cases we argue directly.

In this thesis, we will see a way to use representation theory and the theory of linear algebraic groups to characterize certain family of finite groups. In Chapter 1, we see the history of preceding work. In particular, J. G. Thompson’s classification of minimal finite simple nonsolvable groups and characterization of solvable groups will be given. In Chapter 2, we will describe some background knowledge underlying this project and notation that will be widely used in this thesis. In Chapter 3, the main theorem originally conjectured by Guralnick and Tiep will be stated together with the base theorem which is a reduced version of main theorem to the case where we have a quasisimple group. Main theorem explains a way to characterize the finite groups with a composition factor of order divisible by two distinct primes p and q as the finite groups containing nontrivial 2-element x, p-element y, q-element z such that xyz = 1. In this thesis we more focus on the proof of showing a finite group G with a composition factor of order divisible by two distinct prime p and q contains nontrivial 2-element x, p-element y, q-element z such that xyz = 1. In Chapter 4, we will prove a set of lemmas and proposition which will be used as key tools in the proof of the base theorem. In Chapters 5 to 7, we will establish the base theorem in the cases where a quasisimple group G has its simple quotient isomorphic to alternating groups or sporadic groups (Chapter 5), classical groups (Chapter 6), and exceptional groups (Chapter 7). In Chapter 8, we show that any finite group G admitting nontrivial 2-element x, p- element y, q-element z such that xyz = 1 for two distinct odd primes p and q admits a composition factor of order divisible by pq. Also, we show that the question if a finite group G with a composition factor of order divisible by two distinct prime p and q contains nontrivial 2-element x, p-element y, q-element z such that xyz = 1 can be reduced to the base theorem.

In 1935, Philip Hall developed a formula for finding the number of ways of generating the group of symmetries of the icosahedron from a given number of its elements. In doing so, he defined a generalized Eulerian function. This thesis uses Hall's generalized Eulerian function to calculate generalized Eulerian functions for specific groups, namely: cyclic groups, dihedral groups, and p- groups.

No description available.

京都大学 / 0048 / 新制・課程博士 / 博士(理学) / 甲第22236号 / 理博第4550号 / 新制||理||1654(附属図書館) / 京都大学大学院理学研究科物理学・宇宙物理学専攻 / (主査)教授 柳瀬 陽一, 教授 川上 則雄, 教授 松田 祐司 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM

No description available.

This paper suggests a new methodology; using permutation subgroups to evaluate the stability of clusters. This could be any subgroup and the clustering solution can come from any clustering technique. Mainly, this paper shows how the proposed methodology can be performed through an example of using the rotational cyclic group. The example uses spatially connected clusters that are being created with agglomerative linkage methods. The proposed methodology is demonstrated on Swedish election data and is further evaluated using simulated data. In the example, the simulation results show that the suggested methodology tends to follow the theoretical reasoning of how stable a cluster should be, depending on clustering technique, size, and spatial connectivity. Lastly, further developments of the suggested methodology are presented, along with other possible applications.