Spelling suggestions: "subject:"group matrix"" "subject:"croup matrix""
1 |
Representations Associated to the Group MatrixKeller, Joseph Aaron 28 February 2014 (has links) (PDF)
For a finite group G = {g_0 = 1, g_1,. . ., g_{n-1}} , we can associate independent variables x_0, x_1, . . ., x_{n-1} where x_i = x_{g_i}. There is a natural action of Aut(G) on C[x_0, . . . ,x_{n-})]. Let C_1, . . . , C_r be the conjugacy classes of G. If C = {g_{i_1}, g_{i_2}, . . . , g_{i_u }} is a conjugacy class, then let x(C) = x_{i_1} + x_{i_2} + . . . + x_{i_u}. Let ρG be the representation of Aut(G) on C[x_0, . . . , x_(n-1)]/〈x(C_1), . . . , x(C_r) 〉 and let Χ_G be the character afforded by ρ_G. If G is a dihedral group of the form D_2p, D_4p or D_{2p^2}, with p an odd prime, I show how Χ_G splits into irreducible constituents. I also show how the module C[x_0, . . . ,x_{n-1}]/ decomposes into irreducible submodules. This problem is motivated by results of Humphries [2] relating to random walks on groups and the group determinant.
|
2 |
Group Convex Orthogonal Non-negative Matrix Tri-Factorization with Applications in FC FingerprintingLi, Kendrick T. 16 June 2020 (has links)
No description available.
|
3 |
Strategické podnikatelské aktivity vybraného podniku / Strategic Business Activities of a chosen FirmStaňková, Denisa January 2010 (has links)
The subject of this thesis is to propose suitable business strategies that will lead to strengthening of the company's current situation and increase of sales. The thesis is divided into theoretical and practical part. The first part theoretically describes methods and procedures used in the practical part. The second part analyses external and internal environment of the chosen company and from the obtained results SWOT analysis and BCG portfolio matrix are created. Subsequently, new strategy is created separately for different individual strategic business units. In the end, chosen strategies are developed into four parts with regards to marketing, finance, R&D and product portfolio.
|
Page generated in 0.2688 seconds