Dissertations / Theses on the topic 'Group'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Group.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Holder, Cindy L. "Rethinking groups: Groups, group membership and group rights." Diss., The University of Arizona, 2001. http://hdl.handle.net/10150/279856.
Full textCoutts, Hannah Jane. "Topics in computational group theory : primitive permutation groups and matrix group normalisers." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/2561.
Full textWeber, Harald. "Group rings and twisted group rings for a series of p-groups." [S.l. : s.n.], 2003. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10761310.
Full textIsenrich, Claudio Llosa. "Kähler groups and Geometric Group Theory." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:4a7ab097-4de5-4b72-8fd6-41ff8861ffae.
Full textpl, tomasz@uci agh edu. "A Lie Group Structure on Strict Groups." ESI preprints, 2001. ftp://ftp.esi.ac.at/pub/Preprints/esi1076.ps.
Full textBlackburn, Simon R. "Group enumeration." Thesis, University of Oxford, 1992. http://ora.ox.ac.uk/objects/uuid:caac5ed0-44e3-4bec-a97e-59e11ea268af.
Full textp2andfrasl;27m3+O(m2). (1) We show that the number of groups of nilpotency class at most 3 and order pm satisfies (1). We prove a similar result concerning the number of graded Lie rings of order pm generated by their first grading.
Peterson, Aaron. "Pipe diagrams for Thompson's Group F /." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1959.pdf.
Full textKinney, Dell E. "A workbook for small group ministry." Theological Research Exchange Network (TREN), 1985. http://www.tren.com.
Full textEdwards, Quinton T. "Member perceptions and the relationship between leader behavior, gender and group climate /." free to MU campus, to others for purchase, 1999. http://wwwlib.umi.com/cr/mo/fullcit?p9953856.
Full textAndrus, Ivan B. "Matrix Representations of Automorphism Groups of Free Groups." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd856.pdf.
Full textWelch, Amanda Renee. "Characterizing Zero Divisors of Group Rings." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/52949.
Full textMaster of Science
Chiok, Hengky. "Building a leadership support group." Theological Research Exchange Network (TREN), 1999. http://www.tren.com.
Full textYalcinkaya, Sukru. "Black Box Groups And Related Group Theoretic Constructions." Phd thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608546/index.pdf.
Full texts ``Classical Involution Theorem'
'
as a model in the final recognition algorithm and we propose an algorithm which constructs all root SL_2(q)-subgroups corresponding to the nodes in the extended Dynkin diagram, that is, our approach is the construction of the the extended Curtis - Phan - Tits presentation of the finite simple groups of Lie type of odd characteristic which further yields the construction of all subsystem subgroups which can be read from the extended Dynkin diagram. In this thesis, we present this algorithm for the groups PSL_n(q) and PSU_n(q). We also present an algorithm which determines whether the p-core (or ``unipotent radical'
'
) O_p(G) of a black box group G is trivial or not where G/O_p(G) is a finite simple classical group of Lie type of odd characteristic p answering a well-known question of Babai and Shalev. The algorithms presented in this thesis have been implemented extensively in the computer algebra system GAP.
Weinberg, Haim. "Group analysis, large groups and the Internet unconscious." Thesis, Manchester Metropolitan University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.430683.
Full textChen, Huanyong. "Why do groups engage in counterproductive work behavior ? : the roles of group stressors and group affect." HKBU Institutional Repository, 2013. http://repository.hkbu.edu.hk/etd_ra/1543.
Full textLindblad, Patricia. "Gestures and Groups : An interaction analysis of hand gestures during in-group and out-group speech." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-158083.
Full textEvans, Valerie Angelella. "Group Matching and Group Contingencies." Diss., Temple University Libraries, 2011. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/139848.
Full textPh.D.
Matching relations identified by Herrnstein (1961) demonstrate behavior rates as a function of the ratio of reinforcement rates for alternative behaviors. The mathematical relationship identified by Herrnstein and modified by Baum (1974) was later applied to foraging animals, given the option of two patches (Kennedy & Gray, 1993). This application lead to the demonstration that animals (Baum & Kraft, 1998) and humans (Kraft & Baum, 2001) will engage in emergent group behavior that is distinct from individual matching relations. To more completely understand group matching in humans, group relations beyond foraging must be investigated. This study expands on the findings of Kraft and Baum (2001) and subsequent studies by introducing a group contingency for point earnings. Using an ABAB/BABA experimental design, interdependent group contingency was compared to individual contingency in two experimental sessions with different sets of participants. To better understand individual performance in matching rations, a temporal discounting measure was administered to participants (Beck & Triplett, 2009). Scores were transformed into area-under-the-curve values and correlated with total points earned. Participants were divided into teams based on their scores on a measure of temporal discounting with which they earned points during the group contingency conditions. An effect for group contingency was found for Experiment 2 but not Experiment 1. Order effects apparent in the data from both experiments are attributed to the BABA design used in Experiment 2. Results across the two experiments show a relationship between temporal discounting scores and total points earned for participants with valid temporal discounting scores (n = 13). Future research should expand upon these findings in applied contexts.
Temple University--Theses
Hill, Nicholas James. "Main group complexes of Group 15 and Group 16 ligands." Thesis, University of Southampton, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.252205.
Full textHoeffner, Mark Alan. "A team ministry handbook." Theological Research Exchange Network (TREN), 1986. http://www.tren.com.
Full textChung, Kin Hoong School of Mathematics UNSW. "Compact Group Actions and Harmonic Analysis." Awarded by:University of New South Wales. School of Mathematics, 2000. http://handle.unsw.edu.au/1959.4/17639.
Full textLichacz, Frederick Michael John Carleton University Dissertation Psychology. ""The effects of perceived collective efficacy on social loafing."." Ottawa, 1992.
Find full textCarette, Mathieu. "The automorphism group of accessible groups and the rank of Coxeter groups." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210261.
Full textVia la théorie de Bass-Serre, un groupe agissant sur un arbre est doté d'une structure algébrique particulière, généralisant produits amalgamés et extensions HNN. Le groupe est en fait déterminé par certaines données combinatoires découlant de cette action, appelées graphes de groupes.
Un cas particulier de cette situation est celle d'un produit libre. Une présentation du groupe d'automorphisme d'un produit libre d'un nombre fini de groupes librement indécomposables en termes de présentation des facteurs et de leurs groupes d'automorphismes a été donnée par Fouxe-Rabinovich. Il découle de son travail que si les facteurs et leurs groupes d'automorphismes sont de présentation finie, alors le groupe d'automorphisme du produit libre est de présentation finie. Une première partie de cette thèse donne une nouvelle preuve de ce résultat, se basant sur le langage des actions de groupes sur les arbres.
Un groupe accessible est un groupe de type fini déterminé par un graphe de groupe fini dont les groupes d'arêtes sont finis et les groupes de sommets ont au plus un bout, c'est-à-dire qu'ils ne se décomposent pas en produit amalgamé ni en extension HNN sur un groupe fini. L'étude du groupe d'automorphisme d'un groupe accessible est ramenée à l'étude de groupes d'automorphismes de produits libres, de groupes de twists de Dehn et de groupes d'automorphismes relatifs des groupes de sommets. En particulier, on déduit un critère naturel pour que le groupe d'automorphismes d'un groupe accessible soit de présentation finie, et on donne une caractérisation des groupes accessibles dont le groupe d'automorphisme externe est fini. Appliqués aux groupes hyperboliques de Gromov, ces résultats permettent d'affirmer que le groupe d'automorphismes d'un groupe hyperbolique est de présentation finie, et donnent une caractérisation précise des groupes hyperboliques dont le groupe d'automorphisme externe est fini.
Enfin, on étudie le rang des groupes de Coxeter, c'est-à-dire le cardinal minimal d'un ensemble générateur pour un groupe de Coxeter donné. Plus précisément, on montre que si les composantes de la matrice de Coxeter déterminant un groupe de Coxeter sont suffisamment grandes, alors l'ensemble générateur standard est de cardinal minimal parmi tous les ensembles générateurs.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Brossart, Daniel F. "An investigation of the adequacy of two counseling group development theories using Tuckerized growth curves /." free to MU campus, to others for purchase, 1996. http://wwwlib.umi.com/cr/mo/fullcit?p9712794.
Full textDeChurch, Leslie A. "Group conflict handling: effects on group conflict type-group outcome relationships." FIU Digital Commons, 2000. http://digitalcommons.fiu.edu/etd/2760.
Full textMkiva, Soga Loyiso Tiyo. "The non-cancellation groups of certain groups which are split extensions of a finite abelian group by a finite rank free abelian group." Thesis, University of the Western Cape, 2008. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_8520_1262644840.
Full text 
The groups we consider in this study belong to the class X0 of all finitely generated groups with finite commutator subgroups.
Menezes, Nina E. "Random generation and chief length of finite groups." Thesis, University of St Andrews, 2013. http://hdl.handle.net/10023/3578.
Full textAden, Benjamin. "A model for a small group ministry." Theological Research Exchange Network (TREN), 1997. http://www.tren.com.
Full textDocherty, Pamela Jane. "Central extensions of Current Groups and the Jacobi Group." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/7838.
Full textWalton, Jacqueline. "Representing the quotient groups of a finite permutation group." Thesis, University of Warwick, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340088.
Full textWilson, James B. "Group decompositions, Jordan algebras, and algorithms for p-groups /." Connect to title online (Scholars' Bank) Connect to title online (ProQuest), 2008. http://hdl.handle.net/1794/8302.
Full textTypescript. Includes vita and abstract. Includes bibliographical references (leaves 121-125). Also available online in Scholars' Bank; and in ProQuest, free to University of Oregon users.
Wilson, James B. 1980. "Group decompositions, Jordan algebras, and algorithms for p-groups." Thesis, University of Oregon, 2008. http://hdl.handle.net/1794/8302.
Full textFinite p -groups are studied using bilinear methods which lead to using nonassociative rings. There are three main results, two which apply only to p -groups and the third which applies to all groups. First, for finite p -groups P of class 2 and exponent p the following are invariants of fully refined central decompositions of P : the number of members in the decomposition, the multiset of orders of the members, and the multiset of orders of their centers. Unlike for direct product decompositions, Aut P is not always transitive on the set of fully refined central decompositions, and the number of orbits can in fact be any positive integer. The proofs use the standard semi-simple and radical structure of Jordan algebras. These algebras also produce useful criteria for a p -group to be centrally indecomposable. In the second result, an algorithm is given to find a fully refined central decomposition of a finite p -group of class 2. The number of algebraic operations used by the algorithm is bounded by a polynomial in the log of the size of the group. The algorithm uses a Las Vegas probabilistic algorithm to compute the structure of a finite ring and the Las Vegas MeatAxe is also used. However, when p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The final result is a polynomial time algorithm which, given a group of permutations, matrices, or a polycyclic presentation; returns a Remak decomposition of the group: a fully refined direct decomposition. The method uses group varieties to reduce to the case of p -groups of class 2. Bilinear and ring theory methods are employed there to complete the process.
Adviser: William M. Kantor
BORATTO, LUDOVICO. "Group recommendation with automatic detection and classification of groups." Doctoral thesis, Università degli Studi di Cagliari, 2012. http://hdl.handle.net/11584/266072.
Full textNg, Hubert. "Training group members of Loving Road Bible Study group of El Cerrito Chinese Christian Church in the development of small group ministry." Theological Research Exchange Network (TREN), 1998. http://www.tren.com.
Full textXu, Hui. "The unintended effect of group identity: an experimental investigation of benefit asymmetry and employees' cooperation." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52313.
Full textEyl, Jennifer S. "Spanning subsets of a finite abelian group of order pq /." Electronic version (PDF), 2003. http://dl.uncw.edu/etd/2003/eylj/jennifereyl.pdf.
Full textKarcher, Kelli Marie. "The Space of Left Orders on a Group." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/42700.
Full textMaster of Science
Zhang, Chunfan. "Effect of group goals on group performance." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0001/MQ33474.pdf.
Full textWalker, Sean Christopher. "The Nonconscious Antecedents of Group Processes: An Experimental Analysis of the Priming of Group Beliefs." OpenSIUC, 2012. https://opensiuc.lib.siu.edu/dissertations/510.
Full textRice, Robert E. "Group Leadership of Experienced Middle School Counselors." Digital Archive @ GSU, 2011. http://digitalarchive.gsu.edu/cps_diss/56.
Full textChan, Ann. "The cell group church overcoming the transitions /." Theological Research Exchange Network (TREN) Access this title online, 1994. http://www.tren.com.
Full textEshet-Vago, Anat. "Comparing group processes between an intensive verbal personal development group and an intensive dance movement personal development group." Thesis, University of Hertfordshire, 2017. http://hdl.handle.net/2299/19015.
Full textLeibold, Robert Charles. "Spiritual direction and small group ministries." Theological Research Exchange Network (TREN), 1997. http://www.tren.com.
Full textHert, Theresa Marie. "An efficient presentation of PGL(2,p)." CSUSB ScholarWorks, 1993. https://scholarworks.lib.csusb.edu/etd-project/690.
Full textBajpai, Jitendra. "Omnipotence of surface groups." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100245.
Full textApproximativement, on peut dire qu'un groupe G est omnipotent si les ordresquantité d'élements d'une quantite finie d'elements peuvent etre controles independamment dans unquotient fini de Nous avons prouve que 7Ti(5) est omnipotent quand S estune surface autre que P2, T2 ou K2. Cela generalise le fait, deja connu, que lesgroupes libres sont omnipotents. La preuve utilise principalement des techniquesgeometriques impliquant des graphiques d'espaces ayant pour but de retractercertains espaces en graphiques.
Giroux, Yves. "Degenerate enveloping algebras of low-rank groups." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74026.
Full textGarotta, Odile. "Suites presque scindées d'algèbres intérieures et algèbres intérieures des suites presque scindées." Paris 7, 1988. http://www.theses.fr/1988PA077184.
Full textMiyazaki, Takunari. "Polynomial-time computation in matrix groups /." view abstract or download file of text, 2000. http://wwwlib.umi.com/cr/uoregon/fullcit?p9955920.
Full textTypescript. Includes vita and abstract. Includes bibliographical references (leaves 89-93). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9955920.
Carini, Barbara Jean. "Common fate and ingroup bias in the minimal intergroup paradigm /." view abstract or download file of text, 1999. http://wwwlib.umi.com/cr/uoregon/fullcit?p9955915.
Full textTypescript. Includes vita and abstract. Includes bibliographical references (leaves 89-92). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9955915.
Ward, Michelle Eluize. "A group dynamics perspective of the experiences of adult learners taking part in a learnership program." Diss., University of Pretoria, 2010. http://hdl.handle.net/2263/28975.
Full text- Ensure that all the relevant parties including management, supervisors, employed learners, unemployed learners, employed staff, SETA etc. strive towards the same goal right from the start.
- Integrate the employed and unemployed learners' rights from the start so that the unemployed learners are accepted as part of the system.
- Make it very clear to the employed staff that the unemployed learners are not a threat to their employment within the company as the unemployed learners have not been given a commitment that they will be employed after the learnership.
- Make sure that the training facilitators are well trained and equipped to deal with the group dynamics that can develop in the classroom environment so that they can contribute to the containment of emotions and to alert the company of the events.
- Ensure that change agents are available to monitor and manage these group dynamics.
- Explain the differences and similarities that might exist between the groups and assist the groups to realise their mutually dependent relationship.
Dissertation (MCom)--University of Pretoria, 2010.
Human Resource Management
unrestricted
PONZONI, GIANLUCA. "On the surface group conjecture." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2015. http://hdl.handle.net/10281/77970.
Full text