Dissertations / Theses on the topic 'Products of groups'
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 'Products of groups.'
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.
Pack, R. William. "Products of topological groups." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.390512.
Full textGreen, Elisabeth Ruth. "Graph products of groups." Thesis, University of Leeds, 1990. http://etheses.whiterose.ac.uk/236/.
Full textWard, David Charles. "Topics in finite groups : homology groups, pi-product graphs, wreath products and cuspidal characters." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/topics-in-finite-groups-homology-groups-piproduct-graphs-wreath-products-and-cuspidal-characters(7e90d219-fba7-4ff0-9071-c624acab7aaf).html.
Full textWilson, 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
Griffin, James Thomas. "Automorphisms of free products of groups." Thesis, University of Cambridge, 2013. https://www.repository.cam.ac.uk/handle/1810/244265.
Full textLaurence, Michael Rupen. "Automorphisms of graph products of groups." Thesis, Queen Mary, University of London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.412581.
Full textGoda, Keith Martin. "Centralisers in graph products of groups." Thesis, University of Newcastle Upon Tyne, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.432489.
Full textSmith, Jeremy Francis. "Topics in products of nilpotent groups." Thesis, University of Warwick, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340502.
Full textSert, Cagri. "Joint Spectrum and Large Deviation Principles for Random Products of Matrices." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS500/document.
Full textAfter giving a detailed introduction andthe presentation of an explicit example to illustrateour study in Chapter 1, we exhibit some general toolsand techniques in Chapter 2. Subsequently,- In Chapter 3, we prove the existence of a large deviationprinciple (LDP) with a convex rate function, forthe Cartan components of the random walks on linearsemisimple groups G. The main hypothesis is onthe support S of the probability measure in question,and asks S to generate a Zariski dense semigroup.- In Chapter 4, we introduce a limit object (a subsetof the Weyl chamber) that we associate to a boundedsubset S of G. We call this the joint spectrum J(S)of S. We study its properties and show that for asubset S generating a Zariski dense semigroup, J(S)is convex body, i.e. a convex compact subset of nonemptyinterior. We relate the joint spectrum withthe classical notion of joint spectral radius and therate function of LDP for random walks on G.- In Chapter 5, we introduce an exponential countingfunction for a nite S in G. We study its properties,relate it to joint spectrum of S and prove a denseexponential growth theorem.- In Chapter 6, we prove the existence of an LDPfor Iwasawa components of random walks on G. Thehypothesis asks for a condition of absolute continuityof the probability measure with respect to the Haarmeasure.- In Chapter 7, we develop some tools to tackle aquestion of Breuillard on the rigidity of spectral radiusof a random walk on a free group. We prove aweaker geometric rigidity result
Nazzal, Lamies Joureus. "Homomorphic images of semi-direct products." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2770.
Full textBhattacharjee, Meenaxi. "Amalgamated free products and inverse limits of wreath products of groups." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305443.
Full textHofmann, Eric [Verfasser]. "Automorphic Products on Unitary Groups / Eric Hofmann." München : Verlag Dr. Hut, 2011. http://d-nb.info/1011441640/34.
Full textMetaftsis, Vasileios. "Studies on one-relator products of groups." Thesis, Heriot-Watt University, 1994. http://hdl.handle.net/10399/1961.
Full textFerov, Michal. "Separability properties of graph products of groups." Thesis, University of Southampton, 2015. https://eprints.soton.ac.uk/384000/.
Full textVolkov, Oleksii. "Random Walks on Products of Hyperbolic Groups." Thesis, Université d'Ottawa / University of Ottawa, 2021. http://hdl.handle.net/10393/41955.
Full textHendriksen, Michael Arent. "Minimal Permutation Representations of Classes of Semidirect Products of Groups." Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14353.
Full textGenevois, Anthony. "Cubical-like geometry of quasi-median graphs and applications to geometric group theory." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0569/document.
Full textThe class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the definition of hyperplanes from CAT(0) cube complexes, and we show that the geometry of a quasi-median graph essentially reduces to the combinatorics of its hyperplanes. In the second part, we exploit the specific structure of the hyperplanes to state combination results. The main idea is that if a group acts in a suitable way on a quasi-median graph so that clique-stabilisers satisfy some non-positively curved property P, then the whole group must satisfy P as well. The properties we are interested in are mainly (relative) hyperbolicity, (equivariant) lp-compressions, CAT(0)-ness and cubicality. In the third part, we apply our general criteria to several classes of groups, including graph products, Guba and Sapir's diagram products, some wreath products, and some graphs of groups. Graph products are our most natural examples, where the link between the group and its quasi-median graph is particularly strong and explicit; in particular, we are able to determine precisely when a graph product is relatively hyperbolic
Alharbi, Manal. "Random Walks on Free Products of Cyclic Groups." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/37494.
Full textRyba, Christopher(Christopher Jonathan). "Stable characters for symmetric groups and wreath products." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126936.
Full textCataloged from the official PDF of thesis.
Includes bibliographical references (pages 145-147).
Given a Hopf algebra R, the Grothendieck group of C = R-mod inherits the structure of a ring. We define a ring [mathematical equation]), which is "the [mathematical equation] limit" of the Grothendieck rings of modules for the wreath products [mathematical equation]; it is the Grothendieck group of a certain wreath product Deligne category. The construction yields a basis of [mathematical equation] corresponding to irreducible objects. The structure constants of this basis are stable tensor product multiplicities for the wreath products [mathematical equation]. We generalise [mathematical equation], allowing an arbitrary ring to be substituted for the Grothendieck ring of C. Aside from being a Hopf algebra, [mathematical equation] is the algebra of distributions on a certain affine group scheme. In the special case where C is the category of vector spaces (over C, say), [mathematical equation] is the ring of symmetric functions. The basis obtained by our construction is the family of stable Specht polynomials, which is closely related to the problem of calculating restriction multiplicities from [mathematical equation]. We categorify the stable Specht polynomials by producing a resolution of irreducible representations of S[subscript n] by modules restricted from [mathematical equation].
by Christopher Ryba.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Mathematics
Johnson, Rebecca. "Convergence of Infinite Products in Groups and Semigroups." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1115.
Full textJasim, We'am Muhammad. "Algebraically Determined Semidirect Products." Thesis, University of North Texas, 2011. https://digital.library.unt.edu/ark:/67531/metadc67993/.
Full textBowes, David. "Weyl quantization, reduction, and star products." Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358585.
Full textDison, William John. "Isoperimetric functions for subdirect products and Bestvina-Brady groups." Thesis, Imperial College London, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.485425.
Full textWreth, Susanna. "Hyperbolicity of one-relator products and equations over groups." Thesis, Heriot-Watt University, 1995. http://hdl.handle.net/10399/771.
Full textBrinkman, John. "Products of involutions in certain families of finite groups." Thesis, University of Liverpool, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359154.
Full textDemir, Erdem. "Dimensions Of User Satisfaction For Different Product Groups." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606099/index.pdf.
Full textBieniecka, Ewa. "Commutativity and free products in Thompson's Group V." Thesis, University of St Andrews, 2018. http://hdl.handle.net/10023/14652.
Full textStykow, Maxim. "Representation rings of semidirect products of tori by finite groups." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54513.
Full textScience, Faculty of
Mathematics, Department of
Graduate
Ray, Urmie. "Free linear actions of finite groups on products of spheres." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335735.
Full textChinyere, Ihechukwu. "Certain one-relator products of groups : Freiheitssatz and non-triviality." Thesis, Heriot-Watt University, 2015. http://hdl.handle.net/10399/3078.
Full textKam, Siu-Man. "On the rank of the intersection of subgroups in free products of groups and in amalgamated products." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0018/NQ27299.pdf.
Full textNeofytidis, Christoforos. "Non-zero degree maps between manifolds and groups presentable by products." Diss., Ludwig-Maximilians-Universität München, 2014. http://nbn-resolving.de/urn:nbn:de:bvb:19-172047.
Full textInyangala, Edward Buhuru. "Categorical semi-direct products in varieties of groups with multiple operators." Doctoral thesis, University of Cape Town, 2010. http://hdl.handle.net/11427/4890.
Full textYang, Mingze. "Crossed products by finite groups acting on low dimensional complexes and applications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq23894.pdf.
Full textAustin, Peter C. "Products of involutions in the Chevalley groups of type F(4)(K)." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ27872.pdf.
Full textKazachkov, Ilya. "Description of solutions of systems of equations over free products of groups." Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66911.
Full textUtilisant un analogue des diagrammes de Makanin-Razborov, nous donnons une description de l'ensemble des solutions de systémes d'équations dans un produit libre équationallement Noetherien $G$. De maniére équivalente, nous donnons une paramétrisation de l'ensemble $\Hom(H,G)$ des homomorphismes d'un groupe de génération finie $H$à $G$.Si la théorie universelle de Horn de $G$ est décidable, nos constructions sont algorithmique.
Cernes, John. "Ends of permutation groups and some centrality properties of permutational wreath products." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339282.
Full textChifman, Julia. "DIRECT PRODUCTS AND THE INTERSECTION MAP OF CERTAIN CLASSES OF FINITE GROUPS." UKnowledge, 2009. http://uknowledge.uky.edu/gradschool_diss/839.
Full textMartino, Armando. "On automorphisms of free groups and free products and their fixed points." Thesis, Queen Mary, University of London, 1998. http://qmro.qmul.ac.uk/xmlui/handle/123456789/25565.
Full textGibbins, Aliska L. "Automorphism Groups of Buildings Constructed Via Covering Spaces." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1373976456.
Full textGonda, Jessica Lynn. "Subgroups of Finite Wreath Product Groups for p=3." University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1460027790.
Full textWharton, Elizabeth. "The model theory of certain infinite soluble groups." Thesis, University of Oxford, 2006. http://ora.ox.ac.uk/objects/uuid:7bd8d05b-4ff6-4326-8463-f896e2862e25.
Full textWagner, Jennifer D. "The combinatories of the permutation enumeration of wreath products between cyclic and symmetric groups /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9974108.
Full textHaubold, Niko. "Compressed Decision Problems in Groups." Doctoral thesis, Universitätsbibliothek Leipzig, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-85413.
Full textKarrer, Annette [Verfasser], and P. [Akademischer Betreuer] Schwer. "Contracting boundaries of amalgamated free products of CAT(0) groups with applications for right-angled Coxeter groups / Annette Karrer ; Betreuer: P. Schwer." Karlsruhe : KIT-Bibliothek, 2021. http://d-nb.info/1227450982/34.
Full textNeofytidis, Christoforos [Verfasser], and Dieter [Akademischer Betreuer] Kotschick. "Non-zero degree maps between manifolds and groups presentable by products / Christoforos Neofytidis. Betreuer: Dieter Kotschick." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2014. http://d-nb.info/1054599114/34.
Full textKorogodski, Leonid I. "Representation of quantum algebras arising from non-compact quantum groups : quantum orbit method and super-tensor products." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39076.
Full textMujumdar, Prashant. "Synthesis and Biological Evaluation of Unusual Natural Products and Novel Heterocyclic Chemotypes as Carbonic Anhydrase Inhibitors." Thesis, Griffith University, 2017. http://hdl.handle.net/10072/366972.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Natural Sciences
Science, Environment, Engineering and Technology
Full Text
Dombray, Thomas. "Catalyse par les métaux de la monnaie : applications à la synthèse de molécules d'intérêt biologique." Thesis, Strasbourg, 2012. http://www.theses.fr/2012STRAF060.
Full textDuring the last decade, gold catalysis has experienced significant growth in organic synthesis. Gold–catalyzed reactions can generate highly functionalized, complex molecules from simple substrates efficiently and under mild conditions. The properties of this element, arising from relativistic effects, provide to gold complexes both carbophilic and oxophilic character. This duality has been largely exploited in the laboratory in the rearrangements of alcynyloxiranes to furan or divinylcétones.By expanding this work, a new method for the synthesis of 6 and 3,6-disubstituted alpha-pyrones from beta-alcynylpropiolactones catalyzed by gold has been developed. This alpha-pyrone motif is particularly interesting as it can be found in many natural products, some of which have shown interesting biological activity. Still exploiting the duality of gold complexes, we attempted to generate motifs observed in natural substances, namely spironolactones or spirannic acetals, by modifying the substrate and internal nucleophiles. Despite several failures, we hope to develop a gold catalyzed reaction for the preparation of spironolactones. During this work, we have found a novel method for the p-methoxybenzyl ether cleavage, a protecting group of alcohol commonly used in organic synthesis. The reaction conditions using a catalytic amount of silver, compatible with many functional groups has thus been developed
Mehmood, Yasir. "Modeling the roles of individuals and groups in the dynamics of information propagation." Doctoral thesis, Universitat Pompeu Fabra, 2016. http://hdl.handle.net/10803/393728.
Full textEsta tesis estudia los roles que, tanto individuos como grupos de individuos, desempeñan en la propagación de información en redes sociales. El objetivo primario es investigar el impacto de usuarios y grupos de usuarios en la propagación de información y viceversa. Para estudiar estos fenómenos, de gran complejidad, aplicamos herramientas y técnicas de aprendizaje máquina y minería de datos. Nuestra investigación ha dado como resultado desarrollos muy interesantes que satisfacen nuestros objetivos. En primer lugar, se propone una plataforma innovadora de modelización que denominamos Análisis de la Influencia Social a nivel de Comunidad (Community-level Social Influence Analysis - CSI). CSI permite estimar probabilidades de influencia en un macro-nivel, entre grupos de usuario, al mismo tiempo que extiende y generaliza las plataformas de predicción existentes que sólo trabajan a nivel de usuario. En segundo lugar, se ha desarrollado un modelo estocástico, llamado MASD, para capturar los patrones de evolución de la adopción de innovaciones. Inspirado en la teoria de difusión de innovaciones, MASD utiliza el modelo HMMs izquieda-derecha para representar los fenómenos subyacentes objeto de estudio. La simplicidad, así como la robustez de este modelo, nos han permitido construir una variedad de aplicaciones, desde elementos de clasificación hasta patrones de propagación, y sobre todo, la predicción de adopciones futuras. Finalmente, proponemos un problema algorítmico creativo donde nuestro objetivo es obtener la esfera de influencia de un nodo. Trabajando con grafos probabilísticos, definimos esta esfera, correspondiente a un nodo, como un grupo de nodos que potencialmente capturan un contagio si el nodo subyacente está infectado. Calculando la esfera de influencia para todos los nodos y combinándola con una instancia de un algoritmo goloso de cobertura, proponemos una aproximación única para influenciar la maximización (InfMax). A través de experimentos exhaustivas, podemos mostrar como nuestro método mejora consistentemente el algoritmo goloso estándar para InfMax.
Aquesta tesi estudia els rols que, tant individus com a grups d'individus, exerceixen en la propagació d'informació en xarxes socials. L'objectiu primari és investigar l'impacte d'usuaris i grups d'usuaris en la propagació d'informació i viceversa. Per estudiar aquests fenómens, de gran complexitat, apliquem eines i técniques d'aprenentatge màquina i mineria de dades. La nostra investigació ha donat com resultat desenvolupaments molt interessants que satisfan els nostres objectius. En primer lloc, es proposa una plataforma innovadora de modelització que denominem Anàlisi de la Inuflència Social a nivell de Comunitat (Community-level Social Influence Analysis - CSI). CSI permet estimar probabilitats d'influència en un macronivell, entre grups d'usuari, al mateix temps que estén i generalitza les plataformes de predicció existents que només treballen a nivell d'usuari. En segon lloc, s'ha desenvolupat un model estocàstic, anomenat MASD, per capturar els patrons d'evolució de l'adopció d'innovacions. Inspirat en la teoria de difusió d'innovacions, MASD utilitza el model HMMs izquierda-dreta per representar els fenómens subjacents objecte d'estudi. La simplicitat, així com la robustesa d'aquest model, ens han permés construir una varietat d'aplicacions, des d'elements de classificació fins a patrons de propagació, i sobretot, la predicció d'adopcions futures. Finalment, proposem un problema algorítmic creatiu on el nostre objectiu és obtenir l'esfera d'influència d'un node. Treballant amb gràfics probabilístics, definim aquesta esfera, corresponent a un node, com un grup de nodes que potencialment capturen un contagi si el node subjacent està infectat. Computant l'esfera d'influència per a tots els nodes i combinant-la amb una instància d'un algorisme voraç de cobertura, proposem una aproximació única per influenciar la maximització (InfMax). A través d'experimentacions exhaustives, podem mostrar com el nostre mètode millora consistentment l'algorisme voraç estàndard per InfMax.