Rozprawy doktorskie na temat „Permutation groups”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Permutation groups”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Cox, Charles. "Infinite permutation groups containing all finitary permutations". Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401538/.
Pełny tekst źródłaHyatt, Matthew. "Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups". Scholarly Repository, 2011. http://scholarlyrepository.miami.edu/oa_dissertations/609.
Pełny tekst źródłaKuzucuoglu, M. "Barely transitive permutation groups". Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233097.
Pełny tekst źródłaLajeunesse, Lisa (Lisa Marie) Carleton University Dissertation Mathematics and Statistics. "Models and permutation groups". Ottawa, 1996.
Znajdź pełny tekst źródłaSchaefer, Artur. "Synchronizing permutation groups and graph endomorphisms". Thesis, University of St Andrews, 2016. http://hdl.handle.net/10023/9912.
Pełny tekst źródłaFawcett, Joanna Bethia. "Bases of primitive permutation groups". Thesis, University of Cambridge, 2013. https://www.repository.cam.ac.uk/handle/1810/252304.
Pełny tekst źródłaSpiga, Pablo. "P elements in permutation groups". Thesis, Queen Mary, University of London, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.413152.
Pełny tekst źródłaMcNab, C. A. "Some problems in permutation groups". Thesis, University of Oxford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382633.
Pełny tekst źródłaAstles, David Christopher. "Permutation groups acting on subsets". Thesis, University of East Anglia, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280040.
Pełny tekst źródłaYang, Keyan. "On Orbit Equivalent Permutation Groups". The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1222455916.
Pełny tekst źródłaWalton, 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.
Pełny tekst źródłaXu, Jing. "On closures of finite permutation groups /". Connect to this title, 2005. http://theses.library.uwa.edu.au/adt-WU2006.0023.
Pełny tekst źródłaXu, Jing. "On closures of finite permutation groups". University of Western Australia. School of Mathematics and Statistics, 2006. http://theses.library.uwa.edu.au/adt-WU2006.0023.
Pełny tekst źródłaCernes, 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.
Pełny tekst źródłaMaroti, Attila. "Permutation groups and representation theoretic invariants". Thesis, University of Birmingham, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.403013.
Pełny tekst źródłaBenjamin, Ian Francis. "Quasi-permutation representations of finite groups". Thesis, University of Liverpool, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250561.
Pełny tekst źródłaTracey, Gareth M. "Minimal generation of transitive permutation groups". Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/97251/.
Pełny tekst źródłaSheikh, Atiqa. "Orbital diameters of primitive permutation groups". Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/58869.
Pełny tekst źródłaFiddes, Ceridwyn. "The cyclizer function on permutation groups". Thesis, University of Bath, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.425697.
Pełny tekst źródłaRamsay, Denise. "On linearly ordered sets and permutation groups of uncountable degree". Thesis, University of Oxford, 1990. http://ora.ox.ac.uk/objects/uuid:ce9a8b26-bb4c-4c85-8231-78e89ce4109d.
Pełny tekst źródłaCoutts, 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.
Pełny tekst źródłaVauhkonen, Antti Kalervo. "Finite primitive permutation groups of rank 4". Thesis, Imperial College London, 1993. http://hdl.handle.net/10044/1/58543.
Pełny tekst źródłaTurner, Simon. "The cyclizer series of infinite permutation groups". Thesis, University of Bath, 2013. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577751.
Pełny tekst źródłaMazhar, Siddiqua. "Composition of permutation representations of triangle groups". Thesis, University of Newcastle upon Tyne, 2017. http://hdl.handle.net/10443/3857.
Pełny tekst źródłaHendriksen, Michael Arent. "Minimal Permutation Representations of Classes of Semidirect Products of Groups". Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14353.
Pełny tekst źródłaSmith, Simon Mark. "Subdegree growth rates of infinite primitive permutation groups". Thesis, University of Oxford, 2005. http://ora.ox.ac.uk/objects/uuid:1baa0e15-363a-4163-b21b-59fcd62d210b.
Pełny tekst źródłaSchimanski, Nichole Louise. "Orthomorphisms of Boolean Groups". PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/3100.
Pełny tekst źródłaPenrod, Keith. "Infinite product groups /". Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1977.pdf.
Pełny tekst źródłaBamblett, Jane Carswell. "Algorithms for computing in finite groups". Thesis, University of Oxford, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240616.
Pełny tekst źródłaLemieux, Stephane R. "Minimal degree of faithful permutation representations of finite groups". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0015/MQ48492.pdf.
Pełny tekst źródłaRoney-Dougal, Colva Mary. "Permutation groups with a unique nondiagonal self-paired orbital". Thesis, Queen Mary, University of London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.246981.
Pełny tekst źródłaSharp, Graham R. "Recognition algorithms for actions of permutation groups on pairs". Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244602.
Pełny tekst źródłaTreacher, Helen. "The reconstruction index of semi-2-regular permutation groups". Thesis, University of East Anglia, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.429591.
Pełny tekst źródłaBlackford, J. Thomas. "Permutation groups of extended cyclic codes over Galois Rings /". The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488186329502909.
Pełny tekst źródłaLemieux, Stephane R. (Stephane Robert) Carleton University Dissertation Mathematics and Statistics. "Minimal degree of faithful permutation representations of finite groups". Ottawa, 1999.
Znajdź pełny tekst źródłaRashwan, Osama Agami. "On the composition factors of some permutation modules". Thesis, University of East Anglia, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.323354.
Pełny tekst źródłaGiudici, Michael Robert. "Fixed point free elements of prime order in permutation groups". Thesis, Queen Mary, University of London, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.252086.
Pełny tekst źródłaInglis, Nicholas Francis John. "Multiplicity-free permutation characters, distance-transitive graphs and classical groups". Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.256704.
Pełny tekst źródłaJustus, Amanda N. "Permutation Groups and Puzzle Tile Configurations of Instant Insanity II". Digital Commons @ East Tennessee State University, 2014. https://dc.etsu.edu/etd/2337.
Pełny tekst źródłaTorres, Bisquertt María de la Luz. "Symmetric generation of finite groups". CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2625.
Pełny tekst źródłaXuan, Mingzhi. "On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers". Thesis, University of North Texas, 2012. https://digital.library.unt.edu/ark:/67531/metadc149691/.
Pełny tekst źródłaPearce, Geoffrey. "Transitive decompositions of graphs". University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0087.
Pełny tekst źródłaEmms, Josephine. "Amalgamation classes of directed graphs in model theory and infinite permutation groups". Thesis, University of East Anglia, 2012. https://ueaeprints.uea.ac.uk/39034/.
Pełny tekst źródłaMorje, Prabhav Gangadhar. "A nearly linear algorithm for Sylow subgroups of small-base permutation groups /". The Ohio State University, 1996. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487932351057768.
Pełny tekst źródłaPenrod, Keith G. "Infinite Product Group". BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/976.
Pełny tekst źródłaCAMPOS, JÚNIOR Walfrido Siqueira. "Permutações". Universidade Federal Rural de Pernambuco, 2014. http://www.tede2.ufrpe.br:8080/tede2/handle/tede2/6711.
Pełny tekst źródłaMade available in DSpace on 2017-03-29T14:53:15Z (GMT). No. of bitstreams: 1 Walfrido Siqueira Campos Junior.pdf: 422142 bytes, checksum: a769780b0d11bc646f87ad7036267f6b (MD5) Previous issue date: 2014-06-10
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This work consists of the presentation of a simple permutation, seen as function. This function is bijective, hence admits inverse (inverse permutation). The composition of this function with the same it is also bijective (composed permutation). We will also see the permutations with repetition, circular without repetition and repetition, beyond chaotic permutations, which are those in which no element occupies its original position. The work is also part of the de nition and presentation of a group of permutations consisting of 3 properties in which the composition of functions satisfy all of them. This is our highest goal. Still show the parity of the permutation, as well as their applications in cases of determinants.
Este trabalho consta da apresentação de uma permutação simples, vista na forma de função. Essa função é bijetora, portanto admite inversa (permutação inversa). A composição dessa função com ela mesma, também é bijetora (permutação composta). Veremos também as permutações com repetição, circulares sem repetição e com repetição, além das permutações caóticas, que são aquelas em que nenhum elemento ocupa sua posição inicial. O trabalho consta também da definição e apresentação de um Grupo das permutações que consiste em 3 propriedades na qual a composição das funções satisfazem todas elas. Esse e o nosso maior objetivo. Mostraremos ainda a paridade da permutação, bem como suas aplicações em casos de determinantes.
Kasouha, Abeir Mikhail. "Symmetric representations of elements of finite groups". CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2605.
Pełny tekst źródłaDexter, Cache Porter. "Schur Rings over Infinite Groups". BYU ScholarsArchive, 2019. https://scholarsarchive.byu.edu/etd/8831.
Pełny tekst źródłaMenezes, Nina E. "Random generation and chief length of finite groups". Thesis, University of St Andrews, 2013. http://hdl.handle.net/10023/3578.
Pełny tekst źródłaWagner, 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.
Pełny tekst źródła