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:(Combinatorial Algebra). Showing records 1 – 24 of 24 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Rutgers University

1. Gilmer, Justin, 1986-. Discrete local central limit theorems and boolean function complexity measures.

Degree: PhD, Mathematics, 2015, Rutgers University

This thesis consists of 6 chapters (the first being an introduction). Two chapters relate to local central limit theorems, and three chapters relate to various… (more)

Subjects/Keywords: Central limit theorem; Algebra, Boolean; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gilmer, Justin, 1. (2015). Discrete local central limit theorems and boolean function complexity measures. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46347/

Chicago Manual of Style (16th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Doctoral Dissertation, Rutgers University. Accessed October 30, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

MLA Handbook (7th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Web. 30 Oct 2020.

Vancouver:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Oct 30]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

Council of Science Editors:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/


University of Oklahoma

2. Maddox, Julia Louise. Symmetric Tensors and Combinatorics for Finite-Dimensional Representations of Symplectic Lie Algebras.

Degree: PhD, 2012, University of Oklahoma

 First, we develop a result using multilinear algebra to prove, in an elementary way, a useful identity between representations of \mathfrak{sp}(4, ℂ), which involves writing… (more)

Subjects/Keywords: Tensor algebra; Lie algebras; Combinatorial analysis; Multilinear algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maddox, J. L. (2012). Symmetric Tensors and Combinatorics for Finite-Dimensional Representations of Symplectic Lie Algebras. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/318625

Chicago Manual of Style (16th Edition):

Maddox, Julia Louise. “Symmetric Tensors and Combinatorics for Finite-Dimensional Representations of Symplectic Lie Algebras.” 2012. Doctoral Dissertation, University of Oklahoma. Accessed October 30, 2020. http://hdl.handle.net/11244/318625.

MLA Handbook (7th Edition):

Maddox, Julia Louise. “Symmetric Tensors and Combinatorics for Finite-Dimensional Representations of Symplectic Lie Algebras.” 2012. Web. 30 Oct 2020.

Vancouver:

Maddox JL. Symmetric Tensors and Combinatorics for Finite-Dimensional Representations of Symplectic Lie Algebras. [Internet] [Doctoral dissertation]. University of Oklahoma; 2012. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/11244/318625.

Council of Science Editors:

Maddox JL. Symmetric Tensors and Combinatorics for Finite-Dimensional Representations of Symplectic Lie Algebras. [Doctoral Dissertation]. University of Oklahoma; 2012. Available from: http://hdl.handle.net/11244/318625


University of Colorado

3. McGregor-Dorsey, Zachary Strider. Some properties of full heaps.

Degree: PhD, Mathematics, 2013, University of Colorado

  A full heap is a labeled infinite partially ordered set with labeling taken from the vertices of an underlying Dynkin diagram, satisfying certain conditions… (more)

Subjects/Keywords: ADE Classification; Combinatorial Algebra; Dynkin Diagram; Full Heap; Lie Algebra; Minuscule Representation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McGregor-Dorsey, Z. S. (2013). Some properties of full heaps. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/28

Chicago Manual of Style (16th Edition):

McGregor-Dorsey, Zachary Strider. “Some properties of full heaps.” 2013. Doctoral Dissertation, University of Colorado. Accessed October 30, 2020. https://scholar.colorado.edu/math_gradetds/28.

MLA Handbook (7th Edition):

McGregor-Dorsey, Zachary Strider. “Some properties of full heaps.” 2013. Web. 30 Oct 2020.

Vancouver:

McGregor-Dorsey ZS. Some properties of full heaps. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2020 Oct 30]. Available from: https://scholar.colorado.edu/math_gradetds/28.

Council of Science Editors:

McGregor-Dorsey ZS. Some properties of full heaps. [Doctoral Dissertation]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/math_gradetds/28

4. Vanderli de AraÃjo Alves. Sobre o princÃpio fundamental da contagem.

Degree: Master, 2015, Universidade Federal do Ceará

Neste trabalho apresentamos o PrincÃpio Fundamental da Contagem (PFC) como uma consequÃncia do PrincÃpio de InduÃÃo Finita (PIF) e, como aplicaÃÃo do (PFC), apresentamos a… (more)

Subjects/Keywords: MATEMATICA; problemas de contagem; princÃpio fundamental da contagem; problems count; fundamental principle count; AnÃlise combinatÃria; Ãlgebra; Combinatorial analysis; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alves, V. d. A. (2015). Sobre o princÃpio fundamental da contagem. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15768 ;

Chicago Manual of Style (16th Edition):

Alves, Vanderli de AraÃjo. “Sobre o princÃpio fundamental da contagem.” 2015. Masters Thesis, Universidade Federal do Ceará. Accessed October 30, 2020. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15768 ;.

MLA Handbook (7th Edition):

Alves, Vanderli de AraÃjo. “Sobre o princÃpio fundamental da contagem.” 2015. Web. 30 Oct 2020.

Vancouver:

Alves VdA. Sobre o princÃpio fundamental da contagem. [Internet] [Masters thesis]. Universidade Federal do Ceará 2015. [cited 2020 Oct 30]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15768 ;.

Council of Science Editors:

Alves VdA. Sobre o princÃpio fundamental da contagem. [Masters Thesis]. Universidade Federal do Ceará 2015. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15768 ;

5. Hoefel, Andrew Harald. Hilbert Functions in Monomial Algebras.

Degree: PhD, Department of Mathematics & Statistics - Math Division, 2011, Dalhousie University

 In this thesis, we study Hilbert functions of monomial ideals in the polynomial ring and the Kruskal-Katona ring. In particular, we classify Gotzmann edge ideals… (more)

Subjects/Keywords: combinatorial commutative algebra; Hilbert functions; monomial ideals

…x28;V ) Exterior algebra of a vector space V , 17 gens I Minimal monomial generating… …7 S Polynomial ring k[x1 , . . . , xn ], 6 T (V ) Tensor algebra… …algebra R over a field k decomposes into a sequence of vector spaces R0 , R1 , R2 , and so on… …and the dimensions of these vector spaces form an important invariant in commutative algebra… …will focus on combinatorial aspects of the Gotzmann property. Finally, there are strong… 

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):

Hoefel, A. H. (2011). Hilbert Functions in Monomial Algebras. (Doctoral Dissertation). Dalhousie University. Retrieved from http://hdl.handle.net/10222/13998

Chicago Manual of Style (16th Edition):

Hoefel, Andrew Harald. “Hilbert Functions in Monomial Algebras.” 2011. Doctoral Dissertation, Dalhousie University. Accessed October 30, 2020. http://hdl.handle.net/10222/13998.

MLA Handbook (7th Edition):

Hoefel, Andrew Harald. “Hilbert Functions in Monomial Algebras.” 2011. Web. 30 Oct 2020.

Vancouver:

Hoefel AH. Hilbert Functions in Monomial Algebras. [Internet] [Doctoral dissertation]. Dalhousie University; 2011. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10222/13998.

Council of Science Editors:

Hoefel AH. Hilbert Functions in Monomial Algebras. [Doctoral Dissertation]. Dalhousie University; 2011. Available from: http://hdl.handle.net/10222/13998

6. Bultel, Jean-Paul. Déformations d'algèbres de Hopf combinatoires et inversion de Lagrange non commutative : Deformations of combinatorial Hopf algebras and noncommutative Lagrange inversion.

Degree: Docteur es, Informatique, 2011, Université Paris-Est

Cette thèse est consacrée à l’étude de familles à un paramètre de coproduits sur lesfonctions symétriques et leurs analogues non commutatifs. On montre en introduisant… (more)

Subjects/Keywords: Algébres de Hopf combinatoires; Inversion de Lagrange; Algébre de Faraht-Higman; Combinatorial Hopf algebras; Lagrange inversion; Farahat-Higman algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bultel, J. (2011). Déformations d'algèbres de Hopf combinatoires et inversion de Lagrange non commutative : Deformations of combinatorial Hopf algebras and noncommutative Lagrange inversion. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2011PEST1006

Chicago Manual of Style (16th Edition):

Bultel, Jean-Paul. “Déformations d'algèbres de Hopf combinatoires et inversion de Lagrange non commutative : Deformations of combinatorial Hopf algebras and noncommutative Lagrange inversion.” 2011. Doctoral Dissertation, Université Paris-Est. Accessed October 30, 2020. http://www.theses.fr/2011PEST1006.

MLA Handbook (7th Edition):

Bultel, Jean-Paul. “Déformations d'algèbres de Hopf combinatoires et inversion de Lagrange non commutative : Deformations of combinatorial Hopf algebras and noncommutative Lagrange inversion.” 2011. Web. 30 Oct 2020.

Vancouver:

Bultel J. Déformations d'algèbres de Hopf combinatoires et inversion de Lagrange non commutative : Deformations of combinatorial Hopf algebras and noncommutative Lagrange inversion. [Internet] [Doctoral dissertation]. Université Paris-Est; 2011. [cited 2020 Oct 30]. Available from: http://www.theses.fr/2011PEST1006.

Council of Science Editors:

Bultel J. Déformations d'algèbres de Hopf combinatoires et inversion de Lagrange non commutative : Deformations of combinatorial Hopf algebras and noncommutative Lagrange inversion. [Doctoral Dissertation]. Université Paris-Est; 2011. Available from: http://www.theses.fr/2011PEST1006


Florida Atlantic University

7. Bozovic, Vladimir. Algebraic and combinatorial aspects of group factorizations.

Degree: PhD, 2008, Florida Atlantic University

Summary: The aim of this work is to investigate some algebraic and combinatorial aspects of group factorizations. The main contribution of this dissertation is a… (more)

Subjects/Keywords: Physical measurements; Mapping (Mathematics); Combinatorial enumeration problems; Algebra, Abstract

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bozovic, V. (2008). Algebraic and combinatorial aspects of group factorizations. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/107805

Chicago Manual of Style (16th Edition):

Bozovic, Vladimir. “Algebraic and combinatorial aspects of group factorizations.” 2008. Doctoral Dissertation, Florida Atlantic University. Accessed October 30, 2020. http://purl.flvc.org/FAU/107805.

MLA Handbook (7th Edition):

Bozovic, Vladimir. “Algebraic and combinatorial aspects of group factorizations.” 2008. Web. 30 Oct 2020.

Vancouver:

Bozovic V. Algebraic and combinatorial aspects of group factorizations. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2008. [cited 2020 Oct 30]. Available from: http://purl.flvc.org/FAU/107805.

Council of Science Editors:

Bozovic V. Algebraic and combinatorial aspects of group factorizations. [Doctoral Dissertation]. Florida Atlantic University; 2008. Available from: http://purl.flvc.org/FAU/107805


University of Florida

8. Cheng, Jialong. Towards Combinatorial Characterizations and Algorithms for Bar-And-Joint Independence and Rigidity in 3D and Higher Dimensions.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2013, University of Florida

Combinatorial characterization of generic bar-and-joint rigidity in 3D and higher dimensions is a long open problem. This translates to a combinatorial characterization of the exact… (more)

Subjects/Keywords: Algebra; Distance functions; Embeddings; Equations; Infinitesimals; Mathematics; Matroids; Nucleation; Roofs; Vertices; 3d  – bound  – characterization  – combinatorial  – matroid  – rigidity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, J. (2013). Towards Combinatorial Characterizations and Algorithms for Bar-And-Joint Independence and Rigidity in 3D and Higher Dimensions. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0046127

Chicago Manual of Style (16th Edition):

Cheng, Jialong. “Towards Combinatorial Characterizations and Algorithms for Bar-And-Joint Independence and Rigidity in 3D and Higher Dimensions.” 2013. Doctoral Dissertation, University of Florida. Accessed October 30, 2020. https://ufdc.ufl.edu/UFE0046127.

MLA Handbook (7th Edition):

Cheng, Jialong. “Towards Combinatorial Characterizations and Algorithms for Bar-And-Joint Independence and Rigidity in 3D and Higher Dimensions.” 2013. Web. 30 Oct 2020.

Vancouver:

Cheng J. Towards Combinatorial Characterizations and Algorithms for Bar-And-Joint Independence and Rigidity in 3D and Higher Dimensions. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2020 Oct 30]. Available from: https://ufdc.ufl.edu/UFE0046127.

Council of Science Editors:

Cheng J. Towards Combinatorial Characterizations and Algorithms for Bar-And-Joint Independence and Rigidity in 3D and Higher Dimensions. [Doctoral Dissertation]. University of Florida; 2013. Available from: https://ufdc.ufl.edu/UFE0046127


Simon Fraser University

9. Harms, Daryl Dean. A symbolic algebra environment for research in network reliability.

Degree: 1992, Simon Fraser University

Subjects/Keywords: Computer networks  – Reliability.; Algebra, Abstract.; Combinatorial designs and configurations.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harms, D. D. (1992). A symbolic algebra environment for research in network reliability. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/3815

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):

Harms, Daryl Dean. “A symbolic algebra environment for research in network reliability.” 1992. Thesis, Simon Fraser University. Accessed October 30, 2020. http://summit.sfu.ca/item/3815.

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

MLA Handbook (7th Edition):

Harms, Daryl Dean. “A symbolic algebra environment for research in network reliability.” 1992. Web. 30 Oct 2020.

Vancouver:

Harms DD. A symbolic algebra environment for research in network reliability. [Internet] [Thesis]. Simon Fraser University; 1992. [cited 2020 Oct 30]. Available from: http://summit.sfu.ca/item/3815.

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

Council of Science Editors:

Harms DD. A symbolic algebra environment for research in network reliability. [Thesis]. Simon Fraser University; 1992. Available from: http://summit.sfu.ca/item/3815

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


California State University – San Bernardino

10. Cramm, Kenneth Peter. Solutions to the Chinese Postman Problem.

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

 Considering the Chinese Postman Problem, in which a mailman must deliver mail to houses in a neighborhood. The mailman must cover each side of the… (more)

Subjects/Keywords: Leonhard Euler 1707-1783; Graph theory; Mathematical optimization; Algebra; Combinatorial optimization; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cramm, K. P. (2000). Solutions to the Chinese Postman Problem. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/1683

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):

Cramm, Kenneth Peter. “Solutions to the Chinese Postman Problem.” 2000. Thesis, California State University – San Bernardino. Accessed October 30, 2020. http://scholarworks.lib.csusb.edu/etd-project/1683.

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

MLA Handbook (7th Edition):

Cramm, Kenneth Peter. “Solutions to the Chinese Postman Problem.” 2000. Web. 30 Oct 2020.

Vancouver:

Cramm KP. Solutions to the Chinese Postman Problem. [Internet] [Thesis]. California State University – San Bernardino; 2000. [cited 2020 Oct 30]. Available from: http://scholarworks.lib.csusb.edu/etd-project/1683.

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

Council of Science Editors:

Cramm KP. Solutions to the Chinese Postman Problem. [Thesis]. California State University – San Bernardino; 2000. Available from: http://scholarworks.lib.csusb.edu/etd-project/1683

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

11. Huntemann, Svenja. Simplicial Complexes of Placement Games.

Degree: MS, Department of Mathematics & Statistics - Math Division, 2013, Dalhousie University

 Placement games are a subclass of combinatorial games which are played on graphs. In this thesis, we demonstrate that placement games could be considered as… (more)

Subjects/Keywords: Combinatorial Game Theory; Commutative Algebra; Combinatorial commutative algebra; Combinatorics; Simplicial Complex; Placement Game

combinatorial game theory and combinatorial commutative algebra to apply results from one area to the… …Algebra Combinatorial commutative algebra is an area in which combinatorial concepts are used… …combinatorial algebra lies in the relationship between square-free monomial ideals and simplicial… …caps indicates a combinatorial game LG,B 16 Legal ideal of the game G played on the board… …supporting me in all my endeavours. ix Chapter 1 Introduction 1.1 Motivation Combinatorial… 

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):

Huntemann, S. (2013). Simplicial Complexes of Placement Games. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/35472

Chicago Manual of Style (16th Edition):

Huntemann, Svenja. “Simplicial Complexes of Placement Games.” 2013. Masters Thesis, Dalhousie University. Accessed October 30, 2020. http://hdl.handle.net/10222/35472.

MLA Handbook (7th Edition):

Huntemann, Svenja. “Simplicial Complexes of Placement Games.” 2013. Web. 30 Oct 2020.

Vancouver:

Huntemann S. Simplicial Complexes of Placement Games. [Internet] [Masters thesis]. Dalhousie University; 2013. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10222/35472.

Council of Science Editors:

Huntemann S. Simplicial Complexes of Placement Games. [Masters Thesis]. Dalhousie University; 2013. Available from: http://hdl.handle.net/10222/35472


California State University – San Bernardino

12. Shibalovich, Paul. Fundamental theorem of algebra.

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

 The fundamental theorem of algebra (FTA) is an important theorem in algebra. This theorem asserts that the complex field is algebracially closed. This thesis will… (more)

Subjects/Keywords: Fundamental theorem of algebra; Embedding theorems; Approximate identities (Algebra); Combinatorial analysis; Algorithms; Equations; Mathematics; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shibalovich, P. (2002). Fundamental theorem of algebra. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/2203

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):

Shibalovich, Paul. “Fundamental theorem of algebra.” 2002. Thesis, California State University – San Bernardino. Accessed October 30, 2020. http://scholarworks.lib.csusb.edu/etd-project/2203.

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

MLA Handbook (7th Edition):

Shibalovich, Paul. “Fundamental theorem of algebra.” 2002. Web. 30 Oct 2020.

Vancouver:

Shibalovich P. Fundamental theorem of algebra. [Internet] [Thesis]. California State University – San Bernardino; 2002. [cited 2020 Oct 30]. Available from: http://scholarworks.lib.csusb.edu/etd-project/2203.

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

Council of Science Editors:

Shibalovich P. Fundamental theorem of algebra. [Thesis]. California State University – San Bernardino; 2002. Available from: http://scholarworks.lib.csusb.edu/etd-project/2203

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

13. Chmutov, Michael S. The Structure of W-graphs Arising in Kazhdan-Lusztig Theory.

Degree: PhD, Mathematics, 2014, University of Michigan

 This thesis is primarily about the combinatorial aspects of Kazhdan-Lusztig theory. Central to this area is the notion of a W-graph, a certain weighted directed… (more)

Subjects/Keywords: W-graphs; Iwahori-Hecke Algebra; Combinatorial Representation Theory; Mathematics; Science

…S. Chmutov Chair: John R. Stembridge This thesis is primarily about the combinatorial… …weighted directed graph which encodes a representation of the Iwahori-Hecke algebra of a Coxeter… …independent proof of a weaker result that these graphs can be characterized by simple combinatorial… …deals with combinatorial constructions called W -graphs. They are weighted directed graphs… …with additional structure that encodes certain representations of the IwahoriHecke algebra HW… 

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):

Chmutov, M. S. (2014). The Structure of W-graphs Arising in Kazhdan-Lusztig Theory. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/108802

Chicago Manual of Style (16th Edition):

Chmutov, Michael S. “The Structure of W-graphs Arising in Kazhdan-Lusztig Theory.” 2014. Doctoral Dissertation, University of Michigan. Accessed October 30, 2020. http://hdl.handle.net/2027.42/108802.

MLA Handbook (7th Edition):

Chmutov, Michael S. “The Structure of W-graphs Arising in Kazhdan-Lusztig Theory.” 2014. Web. 30 Oct 2020.

Vancouver:

Chmutov MS. The Structure of W-graphs Arising in Kazhdan-Lusztig Theory. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2027.42/108802.

Council of Science Editors:

Chmutov MS. The Structure of W-graphs Arising in Kazhdan-Lusztig Theory. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/108802


California State University – San Bernardino

14. Stutsman, Michelle Diane. Semisimplicity for Hopf algebras.

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

Subjects/Keywords: Hopf algegras; Mathematical physics; Lie algebras; Algebra; Combinatorial analysis; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stutsman, M. D. (1996). Semisimplicity for Hopf algebras. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/1247

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):

Stutsman, Michelle Diane. “Semisimplicity for Hopf algebras.” 1996. Thesis, California State University – San Bernardino. Accessed October 30, 2020. http://scholarworks.lib.csusb.edu/etd-project/1247.

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

MLA Handbook (7th Edition):

Stutsman, Michelle Diane. “Semisimplicity for Hopf algebras.” 1996. Web. 30 Oct 2020.

Vancouver:

Stutsman MD. Semisimplicity for Hopf algebras. [Internet] [Thesis]. California State University – San Bernardino; 1996. [cited 2020 Oct 30]. Available from: http://scholarworks.lib.csusb.edu/etd-project/1247.

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

Council of Science Editors:

Stutsman MD. Semisimplicity for Hopf algebras. [Thesis]. California State University – San Bernardino; 1996. Available from: http://scholarworks.lib.csusb.edu/etd-project/1247

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

15. Maurice, Rémi. Algèbres de Hopf combinatoires : Combinatorial Hopf algebras.

Degree: Docteur es, Informatique, 2013, Université Paris-Est

Cette thèse se situe dans le domaine de la combinatoire algébrique. Autrement dit, l'idée est d'utiliser des structures algébriques, en l'occurence des algèbres de Hopf… (more)

Subjects/Keywords: Algèbre de Hopf combinatoire; Réalisation polynomiale; Matrices tassées; Matrices à signes alternants; Combinatorial Hopf algebra; Polynomial realization; Packed matrices; Alternating sign matrices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maurice, R. (2013). Algèbres de Hopf combinatoires : Combinatorial Hopf algebras. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2013PEST1196

Chicago Manual of Style (16th Edition):

Maurice, Rémi. “Algèbres de Hopf combinatoires : Combinatorial Hopf algebras.” 2013. Doctoral Dissertation, Université Paris-Est. Accessed October 30, 2020. http://www.theses.fr/2013PEST1196.

MLA Handbook (7th Edition):

Maurice, Rémi. “Algèbres de Hopf combinatoires : Combinatorial Hopf algebras.” 2013. Web. 30 Oct 2020.

Vancouver:

Maurice R. Algèbres de Hopf combinatoires : Combinatorial Hopf algebras. [Internet] [Doctoral dissertation]. Université Paris-Est; 2013. [cited 2020 Oct 30]. Available from: http://www.theses.fr/2013PEST1196.

Council of Science Editors:

Maurice R. Algèbres de Hopf combinatoires : Combinatorial Hopf algebras. [Doctoral Dissertation]. Université Paris-Est; 2013. Available from: http://www.theses.fr/2013PEST1196


University of Adelaide

16. Glynn, David Gerald. Finite projective planes and related combinatorial systems / David G. Glynn.

Degree: 1978, University of Adelaide

Subjects/Keywords: QA471 .G58 1978; Geometry, Projective.; Finite fields (Algebra); Combinatorial geometry.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Glynn, D. G. (1978). Finite projective planes and related combinatorial systems / David G. Glynn. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/20804

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):

Glynn, David Gerald. “Finite projective planes and related combinatorial systems / David G. Glynn.” 1978. Thesis, University of Adelaide. Accessed October 30, 2020. http://hdl.handle.net/2440/20804.

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

MLA Handbook (7th Edition):

Glynn, David Gerald. “Finite projective planes and related combinatorial systems / David G. Glynn.” 1978. Web. 30 Oct 2020.

Vancouver:

Glynn DG. Finite projective planes and related combinatorial systems / David G. Glynn. [Internet] [Thesis]. University of Adelaide; 1978. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2440/20804.

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

Council of Science Editors:

Glynn DG. Finite projective planes and related combinatorial systems / David G. Glynn. [Thesis]. University of Adelaide; 1978. Available from: http://hdl.handle.net/2440/20804

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

17. Qi, Guanqiu. Test Algebra for Concurrent Combinatorial Testing.

Degree: Computer Science, 2014, Arizona State University

Subjects/Keywords: Computer science; Algebra; Combinatorial testing; Concurrent; SaaS; TaaS

…100 7 INTEGRATED FAULT DETECTION AND TEST ALGEBRA FOR COMBINATORIAL TESTING IN TAAS (… …ALGEBRA FOR CONCURRENT COMBINATORIAL TESTING 3.1 Test Algebra Let C be a finite set of… …59 5 TEST ALGEBRA EXECUTION IN A CLOUD ENVIRONMENT . . . . . . 63 5.1 TA Concurrent… …82 6 TAAS (TESTING-AS-A-SERVICE) DESIGN FOR COMBINATORIAL TESTING… …32 4.1 The Relationship Between TA and Combinatorial Testing . . . . . . . . . . . . . 38… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qi, G. (2014). Test Algebra for Concurrent Combinatorial Testing. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/26872

Chicago Manual of Style (16th Edition):

Qi, Guanqiu. “Test Algebra for Concurrent Combinatorial Testing.” 2014. Doctoral Dissertation, Arizona State University. Accessed October 30, 2020. http://repository.asu.edu/items/26872.

MLA Handbook (7th Edition):

Qi, Guanqiu. “Test Algebra for Concurrent Combinatorial Testing.” 2014. Web. 30 Oct 2020.

Vancouver:

Qi G. Test Algebra for Concurrent Combinatorial Testing. [Internet] [Doctoral dissertation]. Arizona State University; 2014. [cited 2020 Oct 30]. Available from: http://repository.asu.edu/items/26872.

Council of Science Editors:

Qi G. Test Algebra for Concurrent Combinatorial Testing. [Doctoral Dissertation]. Arizona State University; 2014. Available from: http://repository.asu.edu/items/26872


University of Georgia

18. Tillema, Erik. Students' construction of algebraic symbol systems.

Degree: 2014, University of Georgia

 The purpose of this study was to understand how eighth grade students used their symbolizing activity in interaction with a teacher-researcher to begin constructing an… (more)

Subjects/Keywords: Algebra; Algebraic Reasoning; Notation; Symbol Systems; Algebraic Symbol Systems; Multiplicative Combinations; Combinatorial Reasoning; Two-Dimensional Multiplicative Reasoning; Operations; Scheme Theory; Quantitative Reasoning; Radical Constructivism; T

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tillema, E. (2014). Students' construction of algebraic symbol systems. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/24302

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):

Tillema, Erik. “Students' construction of algebraic symbol systems.” 2014. Thesis, University of Georgia. Accessed October 30, 2020. http://hdl.handle.net/10724/24302.

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

MLA Handbook (7th Edition):

Tillema, Erik. “Students' construction of algebraic symbol systems.” 2014. Web. 30 Oct 2020.

Vancouver:

Tillema E. Students' construction of algebraic symbol systems. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10724/24302.

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

Council of Science Editors:

Tillema E. Students' construction of algebraic symbol systems. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/24302

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


Rutgers University

19. Aggarwal, Monica, 1981-. On Rota-Baxter Nijenhuis TD algebra.

Degree: Mathematical Sciences, 2014, Rutgers University

Subjects/Keywords: Combinatorial analysis; Algebra; Rota, Gian-Carlo, – 1932-1999 – Criticism and interpretation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aggarwal, Monica, 1. (2014). On Rota-Baxter Nijenhuis TD algebra. (Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/43729/

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):

Aggarwal, Monica, 1981-. “On Rota-Baxter Nijenhuis TD algebra.” 2014. Thesis, Rutgers University. Accessed October 30, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/43729/.

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

MLA Handbook (7th Edition):

Aggarwal, Monica, 1981-. “On Rota-Baxter Nijenhuis TD algebra.” 2014. Web. 30 Oct 2020.

Vancouver:

Aggarwal, Monica 1. On Rota-Baxter Nijenhuis TD algebra. [Internet] [Thesis]. Rutgers University; 2014. [cited 2020 Oct 30]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/43729/.

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

Council of Science Editors:

Aggarwal, Monica 1. On Rota-Baxter Nijenhuis TD algebra. [Thesis]. Rutgers University; 2014. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/43729/

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


Central Queensland University

20. Mortensen, Ross C. Towards determining the transition matrix between symmetric group bases.

Degree: 2008, Central Queensland University

"The aim of this research is to develop a mathematical framework for the derivation of the transition matrix between symmetric group bases. This problem arises in the study of quantum mechanics. To do this, we follow the current methods of abstract algebra, specifically group theory and group representation theory" – Abstract.

Subjects/Keywords: Mathematics; Transition matrix; Algebra; Group representation theory; Group theory; Quantum mechanics; Combinatorial algorithms; 010105 Group Theory and Generalisations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mortensen, R. C. (2008). Towards determining the transition matrix between symmetric group bases. (Thesis). Central Queensland University. Retrieved from http://hdl.cqu.edu.au/10018/61265

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):

Mortensen, Ross C. “Towards determining the transition matrix between symmetric group bases.” 2008. Thesis, Central Queensland University. Accessed October 30, 2020. http://hdl.cqu.edu.au/10018/61265.

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

MLA Handbook (7th Edition):

Mortensen, Ross C. “Towards determining the transition matrix between symmetric group bases.” 2008. Web. 30 Oct 2020.

Vancouver:

Mortensen RC. Towards determining the transition matrix between symmetric group bases. [Internet] [Thesis]. Central Queensland University; 2008. [cited 2020 Oct 30]. Available from: http://hdl.cqu.edu.au/10018/61265.

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

Council of Science Editors:

Mortensen RC. Towards determining the transition matrix between symmetric group bases. [Thesis]. Central Queensland University; 2008. Available from: http://hdl.cqu.edu.au/10018/61265

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

21. Armenoff, Nicholas D. Free Resolutions Associated to Representable Matroids.

Degree: 2015, University of Kentucky

 As a matroid is naturally a simplicial complex, one can study its combinatorial properties via the associated Stanley-Reisner ideal and its corresponding free resolution. Using… (more)

Subjects/Keywords: Cellular resolution; representable matroid; error-correcting code; combinatorial geometry; finite projective geometry; Algebra

…Introduction When studying properties of combinatorial and algebraic structures whose subsets are… …subsets which are independent. Matroids, structures which abstract the combinatorial properties… …of linear independence, arise naturally when studying such combinatorial and algebraic… …exist, the most common encoding scheme for this type of error-correction uses linear algebra… …combinatorial properties determining the generalized Hamming weights of a code, we will recast the… 

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):

Armenoff, N. D. (2015). Free Resolutions Associated to Representable Matroids. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/math_etds/27

Chicago Manual of Style (16th Edition):

Armenoff, Nicholas D. “Free Resolutions Associated to Representable Matroids.” 2015. Doctoral Dissertation, University of Kentucky. Accessed October 30, 2020. https://uknowledge.uky.edu/math_etds/27.

MLA Handbook (7th Edition):

Armenoff, Nicholas D. “Free Resolutions Associated to Representable Matroids.” 2015. Web. 30 Oct 2020.

Vancouver:

Armenoff ND. Free Resolutions Associated to Representable Matroids. [Internet] [Doctoral dissertation]. University of Kentucky; 2015. [cited 2020 Oct 30]. Available from: https://uknowledge.uky.edu/math_etds/27.

Council of Science Editors:

Armenoff ND. Free Resolutions Associated to Representable Matroids. [Doctoral Dissertation]. University of Kentucky; 2015. Available from: https://uknowledge.uky.edu/math_etds/27


University of St Andrews

22. Distler, Andreas. Classification and enumeration of finite semigroups.

Degree: PhD, 2010, University of St Andrews

 The classification of finite semigroups is difficult even for small orders because of their large number. Most finite semigroups are nilpotent of nilpotency rank 3.… (more)

Subjects/Keywords: 004; Nilpotent semigroups; Enumerative combinatorics; Data library; Power group enumeration; 3-nilpotent; Computer search; Constraint satisfaction; Computer algebra; QA182.D5; Semigroups; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Distler, A. (2010). Classification and enumeration of finite semigroups. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/945

Chicago Manual of Style (16th Edition):

Distler, Andreas. “Classification and enumeration of finite semigroups.” 2010. Doctoral Dissertation, University of St Andrews. Accessed October 30, 2020. http://hdl.handle.net/10023/945.

MLA Handbook (7th Edition):

Distler, Andreas. “Classification and enumeration of finite semigroups.” 2010. Web. 30 Oct 2020.

Vancouver:

Distler A. Classification and enumeration of finite semigroups. [Internet] [Doctoral dissertation]. University of St Andrews; 2010. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10023/945.

Council of Science Editors:

Distler A. Classification and enumeration of finite semigroups. [Doctoral Dissertation]. University of St Andrews; 2010. Available from: http://hdl.handle.net/10023/945

23. Sáenz de Cabezón Irigaray, Eduardo. Combinatorial Koszul Homology: Computations and Applications = Homología de Koszul combinatoria: Cálculos y aplicaciones.

Degree: 2008, Universidad de La Rioja

With a particular focus on explicit computations and applications of the Koszul homology and Betti numbers of monomial ideals, the main goals od this thesis… (more)

Subjects/Keywords: combinatorial commutative algebra; monomial ideals; Betti numbers; algebraic analysis of system reliability; formal theory of differential systems; homología de Koszul; álgebra conmutativa combinatoria; ideales monomiales; números de Betti; análisis algebráico de la fiabilidad de sistemas; teoría formal de sistemas diferenciales; Koszul homology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sáenz de Cabezón Irigaray, E. (2008). Combinatorial Koszul Homology: Computations and Applications = Homología de Koszul combinatoria: Cálculos y aplicaciones. (Thesis). Universidad de La Rioja. Retrieved from https://dialnet.unirioja.es/servlet/oaites?codigo=13745

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):

Sáenz de Cabezón Irigaray, Eduardo. “Combinatorial Koszul Homology: Computations and Applications = Homología de Koszul combinatoria: Cálculos y aplicaciones.” 2008. Thesis, Universidad de La Rioja. Accessed October 30, 2020. https://dialnet.unirioja.es/servlet/oaites?codigo=13745.

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

MLA Handbook (7th Edition):

Sáenz de Cabezón Irigaray, Eduardo. “Combinatorial Koszul Homology: Computations and Applications = Homología de Koszul combinatoria: Cálculos y aplicaciones.” 2008. Web. 30 Oct 2020.

Vancouver:

Sáenz de Cabezón Irigaray E. Combinatorial Koszul Homology: Computations and Applications = Homología de Koszul combinatoria: Cálculos y aplicaciones. [Internet] [Thesis]. Universidad de La Rioja; 2008. [cited 2020 Oct 30]. Available from: https://dialnet.unirioja.es/servlet/oaites?codigo=13745.

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

Council of Science Editors:

Sáenz de Cabezón Irigaray E. Combinatorial Koszul Homology: Computations and Applications = Homología de Koszul combinatoria: Cálculos y aplicaciones. [Thesis]. Universidad de La Rioja; 2008. Available from: https://dialnet.unirioja.es/servlet/oaites?codigo=13745

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

24. Anderson, Jennifer. Multiplication Rules for Schur and Quasisymmetric Schur Functions.

Degree: 2015, Marshall University

 An important problem in algebraic combinatorics is finding expansions of products of symmetric functions as sums of symmetric functions. Schur functions form a well-known basis… (more)

Subjects/Keywords: Combinatorics; Littlewood-Richardson rule; Quasisymmetric Schur functions; Remmel-Whitney rule; Schur functions; <; p>; Schur functions.<; /p>; <; p>; Algebraic functions.<; /p>; <; p>; Combinatorial analysis.<; /p>;

algebra, Philosophical Transactions of the Royal Society of London. Series A, Containing Papers… …combinatorial algorithms, and symmetric functions, vol. 203, Springer Science & Business Media, 2001… …x28;3 sections) Math I Honors, (2 sections) Algebra II Pendleton County Middle… …Coursework Abstract Algebra I/II Advanced Calculus I/II Probability and Statistics I/II Number… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anderson, J. (2015). Multiplication Rules for Schur and Quasisymmetric Schur Functions. (Thesis). Marshall University. Retrieved from https://mds.marshall.edu/etd/912

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):

Anderson, Jennifer. “Multiplication Rules for Schur and Quasisymmetric Schur Functions.” 2015. Thesis, Marshall University. Accessed October 30, 2020. https://mds.marshall.edu/etd/912.

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

MLA Handbook (7th Edition):

Anderson, Jennifer. “Multiplication Rules for Schur and Quasisymmetric Schur Functions.” 2015. Web. 30 Oct 2020.

Vancouver:

Anderson J. Multiplication Rules for Schur and Quasisymmetric Schur Functions. [Internet] [Thesis]. Marshall University; 2015. [cited 2020 Oct 30]. Available from: https://mds.marshall.edu/etd/912.

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

Council of Science Editors:

Anderson J. Multiplication Rules for Schur and Quasisymmetric Schur Functions. [Thesis]. Marshall University; 2015. Available from: https://mds.marshall.edu/etd/912

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

.