Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(permutation groups). Showing records 1 – 30 of 31 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Portland State University

1. Schimanski, Nichole Louise. Orthomorphisms of Boolean Groups.

Degree: PhD, Mathematics and Statistics, 2016, Portland State University

  An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x)… (more)

Subjects/Keywords: Boolean algebra; Permutation groups; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schimanski, N. L. (2016). Orthomorphisms of Boolean Groups. (Doctoral Dissertation). Portland State University. Retrieved from http://pdxscholar.library.pdx.edu/open_access_etds/3100

Chicago Manual of Style (16th Edition):

Schimanski, Nichole Louise. “Orthomorphisms of Boolean Groups.” 2016. Doctoral Dissertation, Portland State University. Accessed August 15, 2020. http://pdxscholar.library.pdx.edu/open_access_etds/3100.

MLA Handbook (7th Edition):

Schimanski, Nichole Louise. “Orthomorphisms of Boolean Groups.” 2016. Web. 15 Aug 2020.

Vancouver:

Schimanski NL. Orthomorphisms of Boolean Groups. [Internet] [Doctoral dissertation]. Portland State University; 2016. [cited 2020 Aug 15]. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3100.

Council of Science Editors:

Schimanski NL. Orthomorphisms of Boolean Groups. [Doctoral Dissertation]. Portland State University; 2016. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3100


University of St Andrews

2. Coutts, Hannah Jane. Topics in computational group theory : primitive permutation groups and matrix group normalisers.

Degree: PhD, 2011, University of St Andrews

 Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott… (more)

Subjects/Keywords: 510; QA174.7D36C7; Group theory – Data processing; Permutation groups; Matrix groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Coutts, H. J. (2011). Topics in computational group theory : primitive permutation groups and matrix group normalisers. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/2561

Chicago Manual of Style (16th Edition):

Coutts, Hannah Jane. “Topics in computational group theory : primitive permutation groups and matrix group normalisers.” 2011. Doctoral Dissertation, University of St Andrews. Accessed August 15, 2020. http://hdl.handle.net/10023/2561.

MLA Handbook (7th Edition):

Coutts, Hannah Jane. “Topics in computational group theory : primitive permutation groups and matrix group normalisers.” 2011. Web. 15 Aug 2020.

Vancouver:

Coutts HJ. Topics in computational group theory : primitive permutation groups and matrix group normalisers. [Internet] [Doctoral dissertation]. University of St Andrews; 2011. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10023/2561.

Council of Science Editors:

Coutts HJ. Topics in computational group theory : primitive permutation groups and matrix group normalisers. [Doctoral Dissertation]. University of St Andrews; 2011. Available from: http://hdl.handle.net/10023/2561

3. Borselli, Alexander P . Galois Groups of CM Fields in Degrees 24, 28, and 30.

Degree: PhD, Mathematics, 2017, Lehigh University

 Given a CM field K of degree 2n, there is a triple (G,H,ρ) called an imprimitivity structure in which G is the Galois group of… (more)

Subjects/Keywords: CM Fields; Galois Groups; Permutation Groups; Mathematics; Physical Sciences and Mathematics

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Borselli, A. P. (2017). Galois Groups of CM Fields in Degrees 24, 28, and 30. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/2521

Chicago Manual of Style (16th Edition):

Borselli, Alexander P. “Galois Groups of CM Fields in Degrees 24, 28, and 30.” 2017. Doctoral Dissertation, Lehigh University. Accessed August 15, 2020. https://preserve.lehigh.edu/etd/2521.

MLA Handbook (7th Edition):

Borselli, Alexander P. “Galois Groups of CM Fields in Degrees 24, 28, and 30.” 2017. Web. 15 Aug 2020.

Vancouver:

Borselli AP. Galois Groups of CM Fields in Degrees 24, 28, and 30. [Internet] [Doctoral dissertation]. Lehigh University; 2017. [cited 2020 Aug 15]. Available from: https://preserve.lehigh.edu/etd/2521.

Council of Science Editors:

Borselli AP. Galois Groups of CM Fields in Degrees 24, 28, and 30. [Doctoral Dissertation]. Lehigh University; 2017. Available from: https://preserve.lehigh.edu/etd/2521


The Ohio State University

4. Scrandis, Ann Bertha. Equally distributed permutation groups.

Degree: PhD, Graduate School, 1975, The Ohio State University

Subjects/Keywords: Mathematics; Permutation groups; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Scrandis, A. B. (1975). Equally distributed permutation groups. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838

Chicago Manual of Style (16th Edition):

Scrandis, Ann Bertha. “Equally distributed permutation groups.” 1975. Doctoral Dissertation, The Ohio State University. Accessed August 15, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838.

MLA Handbook (7th Edition):

Scrandis, Ann Bertha. “Equally distributed permutation groups.” 1975. Web. 15 Aug 2020.

Vancouver:

Scrandis AB. Equally distributed permutation groups. [Internet] [Doctoral dissertation]. The Ohio State University; 1975. [cited 2020 Aug 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838.

Council of Science Editors:

Scrandis AB. Equally distributed permutation groups. [Doctoral Dissertation]. The Ohio State University; 1975. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838


The Ohio State University

5. Anacker, Steven Edward. Reducible partitions of permutation groups and the reconstruction of graphs from pendant vertex deleted subgraphs .

Degree: PhD, Graduate School, 1978, The Ohio State University

Subjects/Keywords: Mathematics; Group theory; Permutation groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Anacker, S. E. (1978). Reducible partitions of permutation groups and the reconstruction of graphs from pendant vertex deleted subgraphs . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487077662987626

Chicago Manual of Style (16th Edition):

Anacker, Steven Edward. “Reducible partitions of permutation groups and the reconstruction of graphs from pendant vertex deleted subgraphs .” 1978. Doctoral Dissertation, The Ohio State University. Accessed August 15, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487077662987626.

MLA Handbook (7th Edition):

Anacker, Steven Edward. “Reducible partitions of permutation groups and the reconstruction of graphs from pendant vertex deleted subgraphs .” 1978. Web. 15 Aug 2020.

Vancouver:

Anacker SE. Reducible partitions of permutation groups and the reconstruction of graphs from pendant vertex deleted subgraphs . [Internet] [Doctoral dissertation]. The Ohio State University; 1978. [cited 2020 Aug 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487077662987626.

Council of Science Editors:

Anacker SE. Reducible partitions of permutation groups and the reconstruction of graphs from pendant vertex deleted subgraphs . [Doctoral Dissertation]. The Ohio State University; 1978. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487077662987626


The Ohio State University

6. Woltermann, Michael Leopold. Equidistributed semilinear groups.

Degree: PhD, Graduate School, 1979, The Ohio State University

Subjects/Keywords: Mathematics; Isomorphisms; Permutation groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Woltermann, M. L. (1979). Equidistributed semilinear groups. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487086255909735

Chicago Manual of Style (16th Edition):

Woltermann, Michael Leopold. “Equidistributed semilinear groups.” 1979. Doctoral Dissertation, The Ohio State University. Accessed August 15, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487086255909735.

MLA Handbook (7th Edition):

Woltermann, Michael Leopold. “Equidistributed semilinear groups.” 1979. Web. 15 Aug 2020.

Vancouver:

Woltermann ML. Equidistributed semilinear groups. [Internet] [Doctoral dissertation]. The Ohio State University; 1979. [cited 2020 Aug 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487086255909735.

Council of Science Editors:

Woltermann ML. Equidistributed semilinear groups. [Doctoral Dissertation]. The Ohio State University; 1979. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487086255909735

7. Schaefer, Artur. Synchronizing permutation groups and graph endomorphisms.

Degree: PhD, 2016, University of St Andrews

 The current thesis is focused on synchronizing permutation groups and on graph endo- morphisms. Applying the implicit classification of rank 3 groups, we provide a… (more)

Subjects/Keywords: 512; QA175.S3; Permutation groups; Endomorphisms (Group theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schaefer, A. (2016). Synchronizing permutation groups and graph endomorphisms. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/9912

Chicago Manual of Style (16th Edition):

Schaefer, Artur. “Synchronizing permutation groups and graph endomorphisms.” 2016. Doctoral Dissertation, University of St Andrews. Accessed August 15, 2020. http://hdl.handle.net/10023/9912.

MLA Handbook (7th Edition):

Schaefer, Artur. “Synchronizing permutation groups and graph endomorphisms.” 2016. Web. 15 Aug 2020.

Vancouver:

Schaefer A. Synchronizing permutation groups and graph endomorphisms. [Internet] [Doctoral dissertation]. University of St Andrews; 2016. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10023/9912.

Council of Science Editors:

Schaefer A. Synchronizing permutation groups and graph endomorphisms. [Doctoral Dissertation]. University of St Andrews; 2016. Available from: http://hdl.handle.net/10023/9912


University of Oxford

8. Liebeck, Martin W. Finite permutation groups.

Degree: PhD, 1979, University of Oxford

 Two problems in the theory of finite permutation groups are considered in this thesis: A. transitive groups of degree p, where p = 4q+1 and… (more)

Subjects/Keywords: 510; Group theory : Permutation groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liebeck, M. W. (1979). Finite permutation groups. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:ea433240-b63c-4896-a780-a608f4ea2b97 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.463235

Chicago Manual of Style (16th Edition):

Liebeck, Martin W. “Finite permutation groups.” 1979. Doctoral Dissertation, University of Oxford. Accessed August 15, 2020. http://ora.ox.ac.uk/objects/uuid:ea433240-b63c-4896-a780-a608f4ea2b97 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.463235.

MLA Handbook (7th Edition):

Liebeck, Martin W. “Finite permutation groups.” 1979. Web. 15 Aug 2020.

Vancouver:

Liebeck MW. Finite permutation groups. [Internet] [Doctoral dissertation]. University of Oxford; 1979. [cited 2020 Aug 15]. Available from: http://ora.ox.ac.uk/objects/uuid:ea433240-b63c-4896-a780-a608f4ea2b97 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.463235.

Council of Science Editors:

Liebeck MW. Finite permutation groups. [Doctoral Dissertation]. University of Oxford; 1979. Available from: http://ora.ox.ac.uk/objects/uuid:ea433240-b63c-4896-a780-a608f4ea2b97 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.463235


University of Sydney

9. Hendriksen, Michael Arent. Minimal Permutation Representations of Classes of Semidirect Products of Groups .

Degree: 2015, University of Sydney

 Given a finite group G, the smallest n such that G embeds into the symmetric group Sn is referred to as the minimal degree. Much… (more)

Subjects/Keywords: Group theory; Permutation representations; Semidirect products; Minimal Degrees; Symmetric groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hendriksen, M. A. (2015). Minimal Permutation Representations of Classes of Semidirect Products of Groups . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/14353

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hendriksen, Michael Arent. “Minimal Permutation Representations of Classes of Semidirect Products of Groups .” 2015. Thesis, University of Sydney. Accessed August 15, 2020. http://hdl.handle.net/2123/14353.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hendriksen, Michael Arent. “Minimal Permutation Representations of Classes of Semidirect Products of Groups .” 2015. Web. 15 Aug 2020.

Vancouver:

Hendriksen MA. Minimal Permutation Representations of Classes of Semidirect Products of Groups . [Internet] [Thesis]. University of Sydney; 2015. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2123/14353.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hendriksen MA. Minimal Permutation Representations of Classes of Semidirect Products of Groups . [Thesis]. University of Sydney; 2015. Available from: http://hdl.handle.net/2123/14353

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Southern California

10. Pavelescu, Andrei Bogdan. On the proportion of derangements in cosets of primitive permutation groups.

Degree: PhD, Mathematics, 2012, University of Southern California

 Motivated by questions arising in connection with branched coverings of connected smooth projective curves over finite fields, I am studying the proportion of fixed point… (more)

Subjects/Keywords: permutation groups; fixed point free elements; arithmetic monodromy; derangements; primitive

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pavelescu, A. B. (2012). On the proportion of derangements in cosets of primitive permutation groups. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/4529/rec/4547

Chicago Manual of Style (16th Edition):

Pavelescu, Andrei Bogdan. “On the proportion of derangements in cosets of primitive permutation groups.” 2012. Doctoral Dissertation, University of Southern California. Accessed August 15, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/4529/rec/4547.

MLA Handbook (7th Edition):

Pavelescu, Andrei Bogdan. “On the proportion of derangements in cosets of primitive permutation groups.” 2012. Web. 15 Aug 2020.

Vancouver:

Pavelescu AB. On the proportion of derangements in cosets of primitive permutation groups. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2020 Aug 15]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/4529/rec/4547.

Council of Science Editors:

Pavelescu AB. On the proportion of derangements in cosets of primitive permutation groups. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/4529/rec/4547


University of North Texas

11. Xuan, Mingzhi. On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers.

Degree: 2012, University of North Texas

 In the first chapter, we define Steinhaus set as a set that meets every isometric copy of another set at exactly one point. We show… (more)

Subjects/Keywords: Geometrical graph theory; topological groups; permutation groups; universal group; descriptive set theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xuan, M. (2012). On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc149691/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xuan, Mingzhi. “On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers.” 2012. Thesis, University of North Texas. Accessed August 15, 2020. https://digital.library.unt.edu/ark:/67531/metadc149691/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xuan, Mingzhi. “On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers.” 2012. Web. 15 Aug 2020.

Vancouver:

Xuan M. On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers. [Internet] [Thesis]. University of North Texas; 2012. [cited 2020 Aug 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc149691/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xuan M. On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers. [Thesis]. University of North Texas; 2012. Available from: https://digital.library.unt.edu/ark:/67531/metadc149691/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas A&M University

12. Meadows, Sheryl Diane. A study of classification methods for multiply transitive permutation groups.

Degree: MS, mathematics, 2012, Texas A&M University

Subjects/Keywords: mathematics.; Major mathematics.; Groups, Multiply transitive.; Permutation groups.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Meadows, S. D. (2012). A study of classification methods for multiply transitive permutation groups. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1979-THESIS-M482

Chicago Manual of Style (16th Edition):

Meadows, Sheryl Diane. “A study of classification methods for multiply transitive permutation groups.” 2012. Masters Thesis, Texas A&M University. Accessed August 15, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-1979-THESIS-M482.

MLA Handbook (7th Edition):

Meadows, Sheryl Diane. “A study of classification methods for multiply transitive permutation groups.” 2012. Web. 15 Aug 2020.

Vancouver:

Meadows SD. A study of classification methods for multiply transitive permutation groups. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1979-THESIS-M482.

Council of Science Editors:

Meadows SD. A study of classification methods for multiply transitive permutation groups. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1979-THESIS-M482


Florida Atlantic University

13. Thapa Magar, Krishna B. Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q).

Degree: 2015, Florida Atlantic University

Summary: Every transitive permutation representation of a finite group is the representation of the group in its action on the cosets of a particular subgroup… (more)

Subjects/Keywords: Combinatorial designs and configurations; Cryptography; Data encryption (Computer science); Finite geometries; Finite groups; Group theory; Permutation groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Thapa Magar, K. B. (2015). Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q). (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004471 ; (URL) http://purl.flvc.org/fau/fd/FA00004471

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Thapa Magar, Krishna B. “Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q).” 2015. Thesis, Florida Atlantic University. Accessed August 15, 2020. http://purl.flvc.org/fau/fd/FA00004471 ; (URL) http://purl.flvc.org/fau/fd/FA00004471.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Thapa Magar, Krishna B. “Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q).” 2015. Web. 15 Aug 2020.

Vancouver:

Thapa Magar KB. Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q). [Internet] [Thesis]. Florida Atlantic University; 2015. [cited 2020 Aug 15]. Available from: http://purl.flvc.org/fau/fd/FA00004471 ; (URL) http://purl.flvc.org/fau/fd/FA00004471.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Thapa Magar KB. Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q). [Thesis]. Florida Atlantic University; 2015. Available from: http://purl.flvc.org/fau/fd/FA00004471 ; (URL) http://purl.flvc.org/fau/fd/FA00004471

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brigham Young University

14. Penrod, Keith G. Infinite Product Group.

Degree: MS, 2007, Brigham Young University

 The theory of infinite multiplication has been studied in the case of the Hawaiian earring group, and has been seen to simplify the description of… (more)

Subjects/Keywords: algebra; topology; analysis; braid groups; symmetric groups; permutation groups; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Penrod, K. G. (2007). Infinite Product Group. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1975&context=etd

Chicago Manual of Style (16th Edition):

Penrod, Keith G. “Infinite Product Group.” 2007. Masters Thesis, Brigham Young University. Accessed August 15, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1975&context=etd.

MLA Handbook (7th Edition):

Penrod, Keith G. “Infinite Product Group.” 2007. Web. 15 Aug 2020.

Vancouver:

Penrod KG. Infinite Product Group. [Internet] [Masters thesis]. Brigham Young University; 2007. [cited 2020 Aug 15]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1975&context=etd.

Council of Science Editors:

Penrod KG. Infinite Product Group. [Masters Thesis]. Brigham Young University; 2007. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1975&context=etd


University of St Andrews

15. Menezes, Nina E. Random generation and chief length of finite groups.

Degree: PhD, 2013, University of St Andrews

 Part I of this thesis studies P[subscript(G)](d), the probability of generating a nonabelian simple group G with d randomly chosen elements, and extends this idea… (more)

Subjects/Keywords: 512; Finite group theory; Random generation; Chief length; Probabilistic group theory; Almost simple groups; Permutation groups; Matrix groups; Computational group theory; Group theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Menezes, N. E. (2013). Random generation and chief length of finite groups. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/3578

Chicago Manual of Style (16th Edition):

Menezes, Nina E. “Random generation and chief length of finite groups.” 2013. Doctoral Dissertation, University of St Andrews. Accessed August 15, 2020. http://hdl.handle.net/10023/3578.

MLA Handbook (7th Edition):

Menezes, Nina E. “Random generation and chief length of finite groups.” 2013. Web. 15 Aug 2020.

Vancouver:

Menezes NE. Random generation and chief length of finite groups. [Internet] [Doctoral dissertation]. University of St Andrews; 2013. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10023/3578.

Council of Science Editors:

Menezes NE. Random generation and chief length of finite groups. [Doctoral Dissertation]. University of St Andrews; 2013. Available from: http://hdl.handle.net/10023/3578

16. Larsson, David. Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups.

Degree: Faculty of Science & Engineering, 2015, Linköping UniversityLinköping University

  The work of mathematical giants, such as Lobachevsky, Gauss, Riemann, Klein and Poincaré, to name a few, lies at the foundation of the study… (more)

Subjects/Keywords: Compact Riemann surfaces and uniformization; Fuchsian groups and automorphic functions; Hyperbolic geometry; Topological groups; Permutation groups; Computational methods; Covering spaces; branched coverings; Generators; relations; and presentations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Larsson, D. (2015). Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Larsson, David. “Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups.” 2015. Thesis, Linköping UniversityLinköping University. Accessed August 15, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Larsson, David. “Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups.” 2015. Web. 15 Aug 2020.

Vancouver:

Larsson D. Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups. [Internet] [Thesis]. Linköping UniversityLinköping University; 2015. [cited 2020 Aug 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Larsson D. Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups. [Thesis]. Linköping UniversityLinköping University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119916

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Johannesburg

17. Ras, Charl John. Automatically presentable structures.

Degree: 2012, University of Johannesburg

M.Sc.

In this thesis we study some of the propertie of a clas called automatic structures. Automatic structures are structures that can be encoded (in some defined way) into a set of regular languages. This encoding allows one to prove many interesting properties about automatic structures, including decidabilty results.

Subjects/Keywords: Sequential machine theory; Automata; Formal languages; Equivalence relations (Set theory); Permutation groups; Graph theory; Numbers, Natural; Logic, Symbolic and mathematical

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ras, C. J. (2012). Automatically presentable structures. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6838

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ras, Charl John. “Automatically presentable structures.” 2012. Thesis, University of Johannesburg. Accessed August 15, 2020. http://hdl.handle.net/10210/6838.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ras, Charl John. “Automatically presentable structures.” 2012. Web. 15 Aug 2020.

Vancouver:

Ras CJ. Automatically presentable structures. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10210/6838.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ras CJ. Automatically presentable structures. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6838

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Yang, Keyan. On Orbit Equivalent Permutation Groups.

Degree: PhD, Mathematics, 2008, The Ohio State University

  Two permutation groups <i>G</i>, <i>H</i> = Sym(O) are called orbit equivalent if they have the same orbits on the power set ofO. Primitive orbit… (more)

Subjects/Keywords: Mathematics; permutation groups; orbit equivalent; regular orbits

…ON ORBIT EQUIVALENT PERMUTATION GROUPS DISSERTATION Presented in Partial Fulfillment of… …Graduate Program in Mathematics ABSTRACT Two permutation groups G, H ≤ Sym(Ω) are… …equivalent permutation groups were determined by Seress. In this thesis we prove results toward the… …classification of two-step imprimitive, orbit equivalent permutation groups, which is the next natural… …orbit equivalent, two-step imprimitive permutation 1. A. groups. To appear in ”Computational… 

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yang, K. (2008). On Orbit Equivalent Permutation Groups. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1222455916

Chicago Manual of Style (16th Edition):

Yang, Keyan. “On Orbit Equivalent Permutation Groups.” 2008. Doctoral Dissertation, The Ohio State University. Accessed August 15, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1222455916.

MLA Handbook (7th Edition):

Yang, Keyan. “On Orbit Equivalent Permutation Groups.” 2008. Web. 15 Aug 2020.

Vancouver:

Yang K. On Orbit Equivalent Permutation Groups. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2020 Aug 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1222455916.

Council of Science Editors:

Yang K. On Orbit Equivalent Permutation Groups. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1222455916

19. Avila Girardot , Daniel Felipe. Groebner Bases and Symmetries .

Degree: 2014, Universidad de los Andes

 El álgebra de polinomios siempre ha sido un tema de interés. En particular, entender ideales en anillos de polinomios ha sido fundamental para estudiar objetos… (more)

Subjects/Keywords: Polynomial ideals; Hilbert Basis Theorem; Groebner Bases; Permutation groups.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Avila Girardot , D. F. (2014). Groebner Bases and Symmetries . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/201012216_fecha_2014_07_19_hora_21_42_09_parte_1.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Avila Girardot , Daniel Felipe. “Groebner Bases and Symmetries .” 2014. Thesis, Universidad de los Andes. Accessed August 15, 2020. http://documentodegrado.uniandes.edu.co/documentos/201012216_fecha_2014_07_19_hora_21_42_09_parte_1.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Avila Girardot , Daniel Felipe. “Groebner Bases and Symmetries .” 2014. Web. 15 Aug 2020.

Vancouver:

Avila Girardot DF. Groebner Bases and Symmetries . [Internet] [Thesis]. Universidad de los Andes; 2014. [cited 2020 Aug 15]. Available from: http://documentodegrado.uniandes.edu.co/documentos/201012216_fecha_2014_07_19_hora_21_42_09_parte_1.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Avila Girardot DF. Groebner Bases and Symmetries . [Thesis]. Universidad de los Andes; 2014. Available from: http://documentodegrado.uniandes.edu.co/documentos/201012216_fecha_2014_07_19_hora_21_42_09_parte_1.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas Tech University

20. Aranha, Mario A. Controlled search over finite permutation groups.

Degree: 1984, Texas Tech University

A penetrance learning system is implemented to mechanically find a heuristic to perform a heuristically controlled search over finite permutation group graphs. The learning system is based on probabilistic analysis. A sample solution is evaluated in detail. Seasonably good results were obtained.

Subjects/Keywords: Problem solving; Permutation groups; Heuristic programming; Artificial intelligence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Aranha, M. A. (1984). Controlled search over finite permutation groups. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/9196

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Aranha, Mario A. “Controlled search over finite permutation groups.” 1984. Thesis, Texas Tech University. Accessed August 15, 2020. http://hdl.handle.net/2346/9196.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Aranha, Mario A. “Controlled search over finite permutation groups.” 1984. Web. 15 Aug 2020.

Vancouver:

Aranha MA. Controlled search over finite permutation groups. [Internet] [Thesis]. Texas Tech University; 1984. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2346/9196.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aranha MA. Controlled search over finite permutation groups. [Thesis]. Texas Tech University; 1984. Available from: http://hdl.handle.net/2346/9196

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of the Western Cape

21. Mumba, Nephtale Bvalamanja. Codes, graphs and designs from maximal subgroups of alternating groups .

Degree: 2018, University of the Western Cape

 The main theme of this thesis is the construction of linear codes from adjacency matrices or sub-matrices of adjacency matrices of regular graphs. We first… (more)

Subjects/Keywords: Alternating groups; Automorphism groups; Antipodal graphs; Bipartite graphs; Designs; Graphs; Graph covers; Incidence design; Linear code; Maximal subgroups; Neighbourhood design; Permutation decoding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mumba, N. B. (2018). Codes, graphs and designs from maximal subgroups of alternating groups . (Thesis). University of the Western Cape. Retrieved from http://hdl.handle.net/11394/6165

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mumba, Nephtale Bvalamanja. “Codes, graphs and designs from maximal subgroups of alternating groups .” 2018. Thesis, University of the Western Cape. Accessed August 15, 2020. http://hdl.handle.net/11394/6165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mumba, Nephtale Bvalamanja. “Codes, graphs and designs from maximal subgroups of alternating groups .” 2018. Web. 15 Aug 2020.

Vancouver:

Mumba NB. Codes, graphs and designs from maximal subgroups of alternating groups . [Internet] [Thesis]. University of the Western Cape; 2018. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11394/6165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mumba NB. Codes, graphs and designs from maximal subgroups of alternating groups . [Thesis]. University of the Western Cape; 2018. Available from: http://hdl.handle.net/11394/6165

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


California State University – San Bernardino

22. Kasouha, Abeir Mikhail. Symmetric representations of elements of finite groups.

Degree: MAin Mathematics, Mathematics, 2004, California State University – San Bernardino

This thesis demonstrates an alternative, concise but informative, method for representing group elements, which will prove particularly useful for the sporadic groups. It explains the theory behind symmetric presentations, and describes the algorithm for working with elements represented in this manner.

Subjects/Keywords: Representations of groups; Finite groups; Sporadic groups (Mathematics); Symmetric domains; Algorithms; Permutation groups; Group theory; Transformations (Mathematics); Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kasouha, A. M. (2004). Symmetric representations of elements of finite groups. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/2605

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kasouha, Abeir Mikhail. “Symmetric representations of elements of finite groups.” 2004. Thesis, California State University – San Bernardino. Accessed August 15, 2020. http://scholarworks.lib.csusb.edu/etd-project/2605.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kasouha, Abeir Mikhail. “Symmetric representations of elements of finite groups.” 2004. Web. 15 Aug 2020.

Vancouver:

Kasouha AM. Symmetric representations of elements of finite groups. [Internet] [Thesis]. California State University – San Bernardino; 2004. [cited 2020 Aug 15]. Available from: http://scholarworks.lib.csusb.edu/etd-project/2605.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kasouha AM. Symmetric representations of elements of finite groups. [Thesis]. California State University – San Bernardino; 2004. Available from: http://scholarworks.lib.csusb.edu/etd-project/2605

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


California State University – San Bernardino

23. Marouf, Manal Abdulkarim, Ms. Simple Groups and Related Topics.

Degree: MAin Mathematics, Mathematics, 2015, California State University – San Bernardino

  In this thesis, we will give our discovery of original symmetric presentations of several important groups. We have investigated permutation and monomial progenitors 2*8:… (more)

Subjects/Keywords: Symple Groups; linear group; extensions Homomorphic Image; Isomorphicm Type; Progenitor; Group; Permutation; Monomial; Character; Classes; Magma; Double Coset Enumeration; Mathieu sporadic group; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Marouf, Manal Abdulkarim, M. (2015). Simple Groups and Related Topics. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/239

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Marouf, Manal Abdulkarim, Ms. “Simple Groups and Related Topics.” 2015. Thesis, California State University – San Bernardino. Accessed August 15, 2020. https://scholarworks.lib.csusb.edu/etd/239.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Marouf, Manal Abdulkarim, Ms. “Simple Groups and Related Topics.” 2015. Web. 15 Aug 2020.

Vancouver:

Marouf, Manal Abdulkarim M. Simple Groups and Related Topics. [Internet] [Thesis]. California State University – San Bernardino; 2015. [cited 2020 Aug 15]. Available from: https://scholarworks.lib.csusb.edu/etd/239.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marouf, Manal Abdulkarim M. Simple Groups and Related Topics. [Thesis]. California State University – San Bernardino; 2015. Available from: https://scholarworks.lib.csusb.edu/etd/239

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

24. Daly, Daniel Alan. Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order.

Degree: PhD, Mathematics, 2009, U of Denver

  This thesis is concerned with problems involving permutations. The main focus is on connections between permutation patterns and reduced decompositions with few repetitions. Connections… (more)

Subjects/Keywords: Algebraic combinatorics; Coxeter groups; Permutation patterns; Algebra; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Daly, D. A. (2009). Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/796

Chicago Manual of Style (16th Edition):

Daly, Daniel Alan. “Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order.” 2009. Doctoral Dissertation, U of Denver. Accessed August 15, 2020. https://digitalcommons.du.edu/etd/796.

MLA Handbook (7th Edition):

Daly, Daniel Alan. “Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order.” 2009. Web. 15 Aug 2020.

Vancouver:

Daly DA. Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order. [Internet] [Doctoral dissertation]. U of Denver; 2009. [cited 2020 Aug 15]. Available from: https://digitalcommons.du.edu/etd/796.

Council of Science Editors:

Daly DA. Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order. [Doctoral Dissertation]. U of Denver; 2009. Available from: https://digitalcommons.du.edu/etd/796


University of the Western Cape

25. Kumwenda, Khumbo. Codes, graphs and designs related to iterated line graphs of complete graphs .

Degree: 2011, University of the Western Cape

 In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i =… (more)

Subjects/Keywords: Automorphism groups; Categorical product of graphs; Designs; Graphs; Incidence design; Iterated line graph; Linear code; Neighbourhood design; Permutation decoding; PD-sets; Strong product of graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kumwenda, K. (2011). Codes, graphs and designs related to iterated line graphs of complete graphs . (Thesis). University of the Western Cape. Retrieved from http://hdl.handle.net/11394/1760

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kumwenda, Khumbo. “Codes, graphs and designs related to iterated line graphs of complete graphs .” 2011. Thesis, University of the Western Cape. Accessed August 15, 2020. http://hdl.handle.net/11394/1760.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kumwenda, Khumbo. “Codes, graphs and designs related to iterated line graphs of complete graphs .” 2011. Web. 15 Aug 2020.

Vancouver:

Kumwenda K. Codes, graphs and designs related to iterated line graphs of complete graphs . [Internet] [Thesis]. University of the Western Cape; 2011. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11394/1760.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kumwenda K. Codes, graphs and designs related to iterated line graphs of complete graphs . [Thesis]. University of the Western Cape; 2011. Available from: http://hdl.handle.net/11394/1760

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

26. Falque, Justine. Classification of P-oligomorphic groups, conjectures of Cameron and Macpherson : Classification des groupes P-oligomorphes, conjectures de Cameron et Macpherson.

Degree: Docteur es, Mathématiques et Informatique, 2019, Université Paris-Saclay (ComUE)

 Les travaux présentés dans cette thèse de doctorat relèvent de la combinatoire algébrique et de la théorie des groupes. Précisément, ils apportent une contribution au… (more)

Subjects/Keywords: Combinatoire algébrique; Groupes de permutations oligomorphes; Théorie des invariants; Informatique fondamentale; Profils; Systèmes de blocs d’imprimitivité; Algebraic combinatorics; Oligomorphic permutation groups; Invariant theory; Theoretical computer science; Profiles; Block systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Falque, J. (2019). Classification of P-oligomorphic groups, conjectures of Cameron and Macpherson : Classification des groupes P-oligomorphes, conjectures de Cameron et Macpherson. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2019SACLS484

Chicago Manual of Style (16th Edition):

Falque, Justine. “Classification of P-oligomorphic groups, conjectures of Cameron and Macpherson : Classification des groupes P-oligomorphes, conjectures de Cameron et Macpherson.” 2019. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed August 15, 2020. http://www.theses.fr/2019SACLS484.

MLA Handbook (7th Edition):

Falque, Justine. “Classification of P-oligomorphic groups, conjectures of Cameron and Macpherson : Classification des groupes P-oligomorphes, conjectures de Cameron et Macpherson.” 2019. Web. 15 Aug 2020.

Vancouver:

Falque J. Classification of P-oligomorphic groups, conjectures of Cameron and Macpherson : Classification des groupes P-oligomorphes, conjectures de Cameron et Macpherson. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2019. [cited 2020 Aug 15]. Available from: http://www.theses.fr/2019SACLS484.

Council of Science Editors:

Falque J. Classification of P-oligomorphic groups, conjectures of Cameron and Macpherson : Classification des groupes P-oligomorphes, conjectures de Cameron et Macpherson. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2019. Available from: http://www.theses.fr/2019SACLS484


California State University – San Bernardino

27. Harris, Elena Yavorska. A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄".

Degree: MSin Computer Science, School of Computer Science and Engineering, 2003, California State University – San Bernardino

 This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a… (more)

Subjects/Keywords: Parallel algorithms; Parallel programming (Computer science); Computer programming; Permutation groups; Computer algorithms; Symmetry groups; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Harris, E. Y. (2003). A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄". (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/2432

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Harris, Elena Yavorska. “A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄".” 2003. Thesis, California State University – San Bernardino. Accessed August 15, 2020. http://scholarworks.lib.csusb.edu/etd-project/2432.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Harris, Elena Yavorska. “A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄".” 2003. Web. 15 Aug 2020.

Vancouver:

Harris EY. A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄". [Internet] [Thesis]. California State University – San Bernardino; 2003. [cited 2020 Aug 15]. Available from: http://scholarworks.lib.csusb.edu/etd-project/2432.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harris EY. A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄". [Thesis]. California State University – San Bernardino; 2003. Available from: http://scholarworks.lib.csusb.edu/etd-project/2432

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

28. Bishop, John. A permutational triadic approach to jazz harmony and the chord/scale relationship.

Degree: PhD, Music, 2012, Louisiana State University

 This study provides an original triadic theory that combines existing jazz theory, in particular the chord/scale relationship, and mathematical permutation group theory to analyze repertoire,… (more)

Subjects/Keywords: direct product; geometric duality; octahedral symmetry; dihedral group; cyclic group; toroidal polygon; permutation groups; neo-Riemannian transformations; group theory; triad; reharmonization; improvisation; chord/scale relationship; functional harmony (jazz); Cayley digraph; conjugacy class; semidirect product

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bishop, J. (2012). A permutational triadic approach to jazz harmony and the chord/scale relationship. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-11152012-040803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3698

Chicago Manual of Style (16th Edition):

Bishop, John. “A permutational triadic approach to jazz harmony and the chord/scale relationship.” 2012. Doctoral Dissertation, Louisiana State University. Accessed August 15, 2020. etd-11152012-040803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3698.

MLA Handbook (7th Edition):

Bishop, John. “A permutational triadic approach to jazz harmony and the chord/scale relationship.” 2012. Web. 15 Aug 2020.

Vancouver:

Bishop J. A permutational triadic approach to jazz harmony and the chord/scale relationship. [Internet] [Doctoral dissertation]. Louisiana State University; 2012. [cited 2020 Aug 15]. Available from: etd-11152012-040803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3698.

Council of Science Editors:

Bishop J. A permutational triadic approach to jazz harmony and the chord/scale relationship. [Doctoral Dissertation]. Louisiana State University; 2012. Available from: etd-11152012-040803 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3698

29. Bird, William Herbert. Graph Distinguishability and the Generation of Non-Isomorphic Labellings.

Degree: Dept. of Computer Science, 2013, University of Victoria

 A distinguishing colouring of a graph G is a labelling of the vertices of G with colours such that no non-trivial automorphism of G preserves… (more)

Subjects/Keywords: Distinguishing Number; Sims Table; Schreier-Sims Algorithm; Computational Group Theory; Graph Algorithms; List-Distinguishing Colouring; Distinguishing Colouring; List-Distinguishing Number; Combinatorial Generation; Permutation Groups

permutation groups) normally use multiplication-style notation, so the product of two elements… …operation for permutation groups will be assumed to be function composition, so for two… …lexicographically minimum 2- and 3-colourings Colourings can also be defined for permutation groups H over… …16 Figure 2.3 Permutation Diagrams of C6… …21 Figure 2.4 Permutation Diagrams of B… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bird, W. H. (2013). Graph Distinguishability and the Generation of Non-Isomorphic Labellings. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4839

Chicago Manual of Style (16th Edition):

Bird, William Herbert. “Graph Distinguishability and the Generation of Non-Isomorphic Labellings.” 2013. Masters Thesis, University of Victoria. Accessed August 15, 2020. http://hdl.handle.net/1828/4839.

MLA Handbook (7th Edition):

Bird, William Herbert. “Graph Distinguishability and the Generation of Non-Isomorphic Labellings.” 2013. Web. 15 Aug 2020.

Vancouver:

Bird WH. Graph Distinguishability and the Generation of Non-Isomorphic Labellings. [Internet] [Masters thesis]. University of Victoria; 2013. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1828/4839.

Council of Science Editors:

Bird WH. Graph Distinguishability and the Generation of Non-Isomorphic Labellings. [Masters Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4839


University of Florida

30. Hwang, Rong Chfoo, 1946-. Projection operator method for the SU(2) Clebsch-Gordan coefficients and map of even spin-tensors into tensors and functions on Euclidean 3-space in the theory of SU(2).

Degree: 1976, University of Florida

Subjects/Keywords: Eigenvalues; Infinitesimals; Inner products; Integers; Linear transformations; Mathematical theorems; Mathematical vectors; Permutations; Sine function; Tensors; Clebsch-Gordan coefficients; Mathematics thesis Ph. D; Permutation groups; Tensor algebra; City of Gainesville ( local )

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hwang, Rong Chfoo, 1. (1976). Projection operator method for the SU(2) Clebsch-Gordan coefficients and map of even spin-tensors into tensors and functions on Euclidean 3-space in the theory of SU(2). (Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/AA00047553

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hwang, Rong Chfoo, 1946-. “Projection operator method for the SU(2) Clebsch-Gordan coefficients and map of even spin-tensors into tensors and functions on Euclidean 3-space in the theory of SU(2).” 1976. Thesis, University of Florida. Accessed August 15, 2020. https://ufdc.ufl.edu/AA00047553.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hwang, Rong Chfoo, 1946-. “Projection operator method for the SU(2) Clebsch-Gordan coefficients and map of even spin-tensors into tensors and functions on Euclidean 3-space in the theory of SU(2).” 1976. Web. 15 Aug 2020.

Vancouver:

Hwang, Rong Chfoo 1. Projection operator method for the SU(2) Clebsch-Gordan coefficients and map of even spin-tensors into tensors and functions on Euclidean 3-space in the theory of SU(2). [Internet] [Thesis]. University of Florida; 1976. [cited 2020 Aug 15]. Available from: https://ufdc.ufl.edu/AA00047553.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hwang, Rong Chfoo 1. Projection operator method for the SU(2) Clebsch-Gordan coefficients and map of even spin-tensors into tensors and functions on Euclidean 3-space in the theory of SU(2). [Thesis]. University of Florida; 1976. Available from: https://ufdc.ufl.edu/AA00047553

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2]

.