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:(partition theory). Showing records 1 – 30 of 39 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Penn State University

1. Keith, William Jonathan. Ranks of Partitions and Durfee Symbols.

Degree: PhD, Mathematics, 2007, Penn State University

 This thesis presents generalizations of several partition identities related to the rank statistic. One set of these is new: k-marked Durfee symbols, as defined in… (more)

Subjects/Keywords: partition theory; Durfee

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keith, W. J. (2007). Ranks of Partitions and Durfee Symbols. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/7714

Chicago Manual of Style (16th Edition):

Keith, William Jonathan. “Ranks of Partitions and Durfee Symbols.” 2007. Doctoral Dissertation, Penn State University. Accessed July 19, 2019. https://etda.libraries.psu.edu/catalog/7714.

MLA Handbook (7th Edition):

Keith, William Jonathan. “Ranks of Partitions and Durfee Symbols.” 2007. Web. 19 Jul 2019.

Vancouver:

Keith WJ. Ranks of Partitions and Durfee Symbols. [Internet] [Doctoral dissertation]. Penn State University; 2007. [cited 2019 Jul 19]. Available from: https://etda.libraries.psu.edu/catalog/7714.

Council of Science Editors:

Keith WJ. Ranks of Partitions and Durfee Symbols. [Doctoral Dissertation]. Penn State University; 2007. Available from: https://etda.libraries.psu.edu/catalog/7714


San Jose State University

2. Goel, Gayathri. Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives.

Degree: MA, English and Comparative Literature, 2015, San Jose State University

  This study presents an analysis of the trauma and sacrifice of the female body within the genre of South Asian partition narratives. In an… (more)

Subjects/Keywords: Partition Literature; South Asian Literature; Trauma theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goel, G. (2015). Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives. (Masters Thesis). San Jose State University. Retrieved from https://scholarworks.sjsu.edu/etd_theses/4586

Chicago Manual of Style (16th Edition):

Goel, Gayathri. “Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives.” 2015. Masters Thesis, San Jose State University. Accessed July 19, 2019. https://scholarworks.sjsu.edu/etd_theses/4586.

MLA Handbook (7th Edition):

Goel, Gayathri. “Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives.” 2015. Web. 19 Jul 2019.

Vancouver:

Goel G. Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives. [Internet] [Masters thesis]. San Jose State University; 2015. [cited 2019 Jul 19]. Available from: https://scholarworks.sjsu.edu/etd_theses/4586.

Council of Science Editors:

Goel G. Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives. [Masters Thesis]. San Jose State University; 2015. Available from: https://scholarworks.sjsu.edu/etd_theses/4586


University of Colorado

3. Chestnut, Robin Michael. Independent Partitions in Boolean Algebras.

Degree: PhD, Mathematics, 2012, University of Colorado

  This dissertation introduces a generalization of the cardinal invariant independence for Boolean algebras, suggested by the proof of the Balcar-Franek Theorem. The objects of… (more)

Subjects/Keywords: Boolean Algebra; Independence; Logic; Partition; Set Theory; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chestnut, R. M. (2012). Independent Partitions in Boolean Algebras. (Doctoral Dissertation). University of Colorado. Retrieved from http://scholar.colorado.edu/math_gradetds/12

Chicago Manual of Style (16th Edition):

Chestnut, Robin Michael. “Independent Partitions in Boolean Algebras.” 2012. Doctoral Dissertation, University of Colorado. Accessed July 19, 2019. http://scholar.colorado.edu/math_gradetds/12.

MLA Handbook (7th Edition):

Chestnut, Robin Michael. “Independent Partitions in Boolean Algebras.” 2012. Web. 19 Jul 2019.

Vancouver:

Chestnut RM. Independent Partitions in Boolean Algebras. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2019 Jul 19]. Available from: http://scholar.colorado.edu/math_gradetds/12.

Council of Science Editors:

Chestnut RM. Independent Partitions in Boolean Algebras. [Doctoral Dissertation]. University of Colorado; 2012. Available from: http://scholar.colorado.edu/math_gradetds/12


Kent State University

4. Alghamdi, Ohud. Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian.

Degree: MS, College of Arts and Sciences / Department of Mathematical Science, 2016, Kent State University

 In 1958, L. Carleson showed that a set E is removable for Holder continuous solutions of the Laplacian operator if and only if its (n-2+a)-dimensional… (more)

Subjects/Keywords: Mathematics; Fractional Laplacian; Fourier transform; partition of unity; distribution theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alghamdi, O. (2016). Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077

Chicago Manual of Style (16th Edition):

Alghamdi, Ohud. “Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian.” 2016. Masters Thesis, Kent State University. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077.

MLA Handbook (7th Edition):

Alghamdi, Ohud. “Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian.” 2016. Web. 19 Jul 2019.

Vancouver:

Alghamdi O. Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian. [Internet] [Masters thesis]. Kent State University; 2016. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077.

Council of Science Editors:

Alghamdi O. Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian. [Masters Thesis]. Kent State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077


University of Tennessee – Knoxville

5. Jacob, Eric J. On a Quantum Form of the Binomial Coefficient.

Degree: MS, Mathematics, 2012, University of Tennessee – Knoxville

  A unique form of the quantum binomial coefficient (n choose k) for k = 2 and 3 is presented in this thesis. An interesting… (more)

Subjects/Keywords: binomial coefficient; quantum; partition; Number Theory; Other Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jacob, E. J. (2012). On a Quantum Form of the Binomial Coefficient. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/1168

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

Jacob, Eric J. “On a Quantum Form of the Binomial Coefficient.” 2012. Thesis, University of Tennessee – Knoxville. Accessed July 19, 2019. https://trace.tennessee.edu/utk_gradthes/1168.

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

MLA Handbook (7th Edition):

Jacob, Eric J. “On a Quantum Form of the Binomial Coefficient.” 2012. Web. 19 Jul 2019.

Vancouver:

Jacob EJ. On a Quantum Form of the Binomial Coefficient. [Internet] [Thesis]. University of Tennessee – Knoxville; 2012. [cited 2019 Jul 19]. Available from: https://trace.tennessee.edu/utk_gradthes/1168.

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

Council of Science Editors:

Jacob EJ. On a Quantum Form of the Binomial Coefficient. [Thesis]. University of Tennessee – Knoxville; 2012. Available from: https://trace.tennessee.edu/utk_gradthes/1168

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


Université de Montréal

6. Champagne-Paradis, Audrey. La conjecture de partitionnement des chemins .

Degree: 2011, Université de Montréal

 Soit G = (V, E) un graphe simple fini. Soit (a, b) un couple d’entiers positifs. On note par τ(G) le nombre de sommets d’un… (more)

Subjects/Keywords: Théorie des graphes; Graph theory; Détour; Detour; Chemin; Path; Plus long chemin; Longest path; Partition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Champagne-Paradis, A. (2011). La conjecture de partitionnement des chemins . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/5288

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

Champagne-Paradis, Audrey. “La conjecture de partitionnement des chemins .” 2011. Thesis, Université de Montréal. Accessed July 19, 2019. http://hdl.handle.net/1866/5288.

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

MLA Handbook (7th Edition):

Champagne-Paradis, Audrey. “La conjecture de partitionnement des chemins .” 2011. Web. 19 Jul 2019.

Vancouver:

Champagne-Paradis A. La conjecture de partitionnement des chemins . [Internet] [Thesis]. Université de Montréal; 2011. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1866/5288.

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

Council of Science Editors:

Champagne-Paradis A. La conjecture de partitionnement des chemins . [Thesis]. Université de Montréal; 2011. Available from: http://hdl.handle.net/1866/5288

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


UCLA

7. Burkovskaya, Anastasia. Essays on Identification.

Degree: Economics, 2016, UCLA

 Chapter 1 considers agents that aggregate several states of the world (i.e., the possible different realizations of an uncertain situation) into an event. They then… (more)

Subjects/Keywords: Economics; Economic theory; ambiguity; decision-making; electoral model; identification; non-parametric estimation; subjective partition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Burkovskaya, A. (2016). Essays on Identification. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/9f25h88w

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

Burkovskaya, Anastasia. “Essays on Identification.” 2016. Thesis, UCLA. Accessed July 19, 2019. http://www.escholarship.org/uc/item/9f25h88w.

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

MLA Handbook (7th Edition):

Burkovskaya, Anastasia. “Essays on Identification.” 2016. Web. 19 Jul 2019.

Vancouver:

Burkovskaya A. Essays on Identification. [Internet] [Thesis]. UCLA; 2016. [cited 2019 Jul 19]. Available from: http://www.escholarship.org/uc/item/9f25h88w.

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

Council of Science Editors:

Burkovskaya A. Essays on Identification. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/9f25h88w

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


University of Oregon

8. Xu, Tianyuan. On the Subregular J-ring of Coxeter Systems.

Degree: 2017, University of Oregon

 Let (W, S) be an arbitrary Coxeter system, and let J be the asymptotic Hecke algebra associated to (W, S) via Kazhdan-Lusztig polynomials by Lusztig.… (more)

Subjects/Keywords: Coxeter groups; Fusion categories; Hecke algebras; Kazhdan-Lusztig theory; Partition quantum groups; Tensor categories

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, T. (2017). On the Subregular J-ring of Coxeter Systems. (Thesis). University of Oregon. Retrieved from http://hdl.handle.net/1794/22741

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

Xu, Tianyuan. “On the Subregular J-ring of Coxeter Systems.” 2017. Thesis, University of Oregon. Accessed July 19, 2019. http://hdl.handle.net/1794/22741.

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

MLA Handbook (7th Edition):

Xu, Tianyuan. “On the Subregular J-ring of Coxeter Systems.” 2017. Web. 19 Jul 2019.

Vancouver:

Xu T. On the Subregular J-ring of Coxeter Systems. [Internet] [Thesis]. University of Oregon; 2017. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1794/22741.

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

Council of Science Editors:

Xu T. On the Subregular J-ring of Coxeter Systems. [Thesis]. University of Oregon; 2017. Available from: http://hdl.handle.net/1794/22741

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


University of Illinois – Urbana-Champaign

9. Pechenik, Oliver A. K-theoretic Schubert calculus and applications.

Degree: PhD, Mathematics, 2016, University of Illinois – Urbana-Champaign

 A central result in algebraic combinatorics is the Littlewood-Richardson rule that governs products in the cohomology of Grassmannians. A major theme of the modern Schubert… (more)

Subjects/Keywords: Schubert calculus; K-theory; genomic tableau; cyclic sieving; homomesy; plane partition; resonance; doppelganger

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pechenik, O. A. (2016). K-theoretic Schubert calculus and applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92740

Chicago Manual of Style (16th Edition):

Pechenik, Oliver A. “K-theoretic Schubert calculus and applications.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 19, 2019. http://hdl.handle.net/2142/92740.

MLA Handbook (7th Edition):

Pechenik, Oliver A. “K-theoretic Schubert calculus and applications.” 2016. Web. 19 Jul 2019.

Vancouver:

Pechenik OA. K-theoretic Schubert calculus and applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2142/92740.

Council of Science Editors:

Pechenik OA. K-theoretic Schubert calculus and applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92740


University of Edinburgh

10. Bancarz, Iain. Conditional-entropy metrics for feature selection.

Degree: PhD, 2005, University of Edinburgh

 We examine the task of feature selection, which is a method of forming simplified descriptions of complex data for use in probabilistic classifiers. Feature selection… (more)

Subjects/Keywords: 519; information theory; expected partition entropy; Koller-Sahami

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bancarz, I. (2005). Conditional-entropy metrics for feature selection. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/799

Chicago Manual of Style (16th Edition):

Bancarz, Iain. “Conditional-entropy metrics for feature selection.” 2005. Doctoral Dissertation, University of Edinburgh. Accessed July 19, 2019. http://hdl.handle.net/1842/799.

MLA Handbook (7th Edition):

Bancarz, Iain. “Conditional-entropy metrics for feature selection.” 2005. Web. 19 Jul 2019.

Vancouver:

Bancarz I. Conditional-entropy metrics for feature selection. [Internet] [Doctoral dissertation]. University of Edinburgh; 2005. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1842/799.

Council of Science Editors:

Bancarz I. Conditional-entropy metrics for feature selection. [Doctoral Dissertation]. University of Edinburgh; 2005. Available from: http://hdl.handle.net/1842/799


Queens University

11. Singh, Aarzoo. Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories .

Degree: Gender Studies, 2014, Queens University

 This project considers portable affective objects as sites that hold and emit narratives of colonial displacement, generational ties and ruptures, and loss of identity for… (more)

Subjects/Keywords: South Asian Diaspora; Thing Theory; Affect; Colonial Trauma; Memory; Storytelling; Displacement; Partition; Objects; Heirlooms; Narratives; Material Culture; Belonging; Home

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Singh, A. (2014). Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/12471

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

Singh, Aarzoo. “Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories .” 2014. Thesis, Queens University. Accessed July 19, 2019. http://hdl.handle.net/1974/12471.

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

MLA Handbook (7th Edition):

Singh, Aarzoo. “Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories .” 2014. Web. 19 Jul 2019.

Vancouver:

Singh A. Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories . [Internet] [Thesis]. Queens University; 2014. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1974/12471.

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

Council of Science Editors:

Singh A. Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories . [Thesis]. Queens University; 2014. Available from: http://hdl.handle.net/1974/12471

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


University of Victoria

12. Wodlinger, Jane. Irreversible k-threshold conversion processes on graphs.

Degree: Department of Mathematics and Statistics, 2018, University of Victoria

 Given a graph G and an initial colouring of its vertices with two colours, say black and white, an irreversible k-threshold conversion process on G… (more)

Subjects/Keywords: graph theory; conversion process; irreversible conversion process; k-conversion; decycling; feedback vertex; k-threshold; vertex arboricity; conversion set; forest partition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wodlinger, J. (2018). Irreversible k-threshold conversion processes on graphs. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9282

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

Wodlinger, Jane. “Irreversible k-threshold conversion processes on graphs.” 2018. Thesis, University of Victoria. Accessed July 19, 2019. https://dspace.library.uvic.ca//handle/1828/9282.

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

MLA Handbook (7th Edition):

Wodlinger, Jane. “Irreversible k-threshold conversion processes on graphs.” 2018. Web. 19 Jul 2019.

Vancouver:

Wodlinger J. Irreversible k-threshold conversion processes on graphs. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Jul 19]. Available from: https://dspace.library.uvic.ca//handle/1828/9282.

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

Council of Science Editors:

Wodlinger J. Irreversible k-threshold conversion processes on graphs. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9282

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


University of Akron

13. Bellissimo, Michael Robert. A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK.

Degree: MS, Mathematics, 2018, University of Akron

 Our goal is to be able to determine the distance between two partitions in the same Rouquier block. This paper explores a lower bound on… (more)

Subjects/Keywords: Mathematics; partitions; badness; Rouquier Block; representation theory; combinatorics; Brauer Graph; diameter of a Brauer Graph; partition theory; Young Diagram; decomposition matrix; p-core; abacus; p-regular partitions; Littlewood-Richardson Rule

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bellissimo, M. R. (2018). A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK. (Masters Thesis). University of Akron. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649

Chicago Manual of Style (16th Edition):

Bellissimo, Michael Robert. “A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK.” 2018. Masters Thesis, University of Akron. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649.

MLA Handbook (7th Edition):

Bellissimo, Michael Robert. “A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK.” 2018. Web. 19 Jul 2019.

Vancouver:

Bellissimo MR. A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK. [Internet] [Masters thesis]. University of Akron; 2018. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649.

Council of Science Editors:

Bellissimo MR. A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK. [Masters Thesis]. University of Akron; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649


Georgia Southern University

14. Smoot, Nicolas A. A Partition Function Connected with the Göllnitz-Gordon Identities.

Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2016, Georgia Southern University

  Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition(more)

Subjects/Keywords: integer partitions; circle method; number theory; partition identities; Analysis; Number Theory; Jack N. Averitt College of Graduate Studies, Electronic Theses & Dissertations, ETDs, Student Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Smoot, N. A. (2016). A Partition Function Connected with the Göllnitz-Gordon Identities. (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/1389

Chicago Manual of Style (16th Edition):

Smoot, Nicolas A. “A Partition Function Connected with the Göllnitz-Gordon Identities.” 2016. Masters Thesis, Georgia Southern University. Accessed July 19, 2019. https://digitalcommons.georgiasouthern.edu/etd/1389.

MLA Handbook (7th Edition):

Smoot, Nicolas A. “A Partition Function Connected with the Göllnitz-Gordon Identities.” 2016. Web. 19 Jul 2019.

Vancouver:

Smoot NA. A Partition Function Connected with the Göllnitz-Gordon Identities. [Internet] [Masters thesis]. Georgia Southern University; 2016. [cited 2019 Jul 19]. Available from: https://digitalcommons.georgiasouthern.edu/etd/1389.

Council of Science Editors:

Smoot NA. A Partition Function Connected with the Göllnitz-Gordon Identities. [Masters Thesis]. Georgia Southern University; 2016. Available from: https://digitalcommons.georgiasouthern.edu/etd/1389


University of Toledo

15. Debnath, Jayanta Kumar. Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure.

Degree: MS, Electrical Engineering, 2016, University of Toledo

 This thesis demonstrates development of a complete suite of path planning, elevator scheduling and resource allocation algorithms to manage multiple concurrent requests, in real time… (more)

Subjects/Keywords: Artificial Intelligence; fully-automated robotic parking; elevator scheduling; real-time; optimal; genetic algorithm; queuing theory; nested partition; UML; simulation software design; multithreaded; path planning; scheduling; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Debnath, J. K. (2016). Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure. (Masters Thesis). University of Toledo. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189

Chicago Manual of Style (16th Edition):

Debnath, Jayanta Kumar. “Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure.” 2016. Masters Thesis, University of Toledo. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189.

MLA Handbook (7th Edition):

Debnath, Jayanta Kumar. “Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure.” 2016. Web. 19 Jul 2019.

Vancouver:

Debnath JK. Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure. [Internet] [Masters thesis]. University of Toledo; 2016. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189.

Council of Science Editors:

Debnath JK. Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure. [Masters Thesis]. University of Toledo; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189

16. JardÃnia Sobrinho Goes. Sobre grupos unicamente cobertos.

Degree: Master, 2011, Universidade Federal do Ceará

Este trabalho à baseado no artigo "Uniquely Covered Groups" de M. A. Brodie, que investiga grupos finitos que possuem uma Ãnica cobertura irredundante por subgrupos… (more)

Subjects/Keywords: irredundant; finite covering; subgrupo maximal; partiÃÃo; irredundante; cobertura finita; ALGEBRA; partition; maximal subgroup; teoria dos grupos; grupos finitos; group theory; finite groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goes, J. S. (2011). Sobre grupos unicamente cobertos. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;

Chicago Manual of Style (16th Edition):

Goes, JardÃnia Sobrinho. “Sobre grupos unicamente cobertos.” 2011. Masters Thesis, Universidade Federal do Ceará. Accessed July 19, 2019. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;.

MLA Handbook (7th Edition):

Goes, JardÃnia Sobrinho. “Sobre grupos unicamente cobertos.” 2011. Web. 19 Jul 2019.

Vancouver:

Goes JS. Sobre grupos unicamente cobertos. [Internet] [Masters thesis]. Universidade Federal do Ceará 2011. [cited 2019 Jul 19]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;.

Council of Science Editors:

Goes JS. Sobre grupos unicamente cobertos. [Masters Thesis]. Universidade Federal do Ceará 2011. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;


Indian Institute of Science

17. Ghoshdastidar, Debarghya. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.

Degree: 2016, Indian Institute of Science

 Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is… (more)

Subjects/Keywords: Spectral Theory; Uniform Hypergraphs; Tensor Spectral Method; Hypergraph Coloring; Uniform Hypergraph Partitioning; Non-uniform Hypergraphs; Spectral Hypergraph Partitioning; Bipartite Hypergraphs; Planted Partition Model; Hypergraph Partitioning; Hypergraphs; Spectral Algorithms; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghoshdastidar, D. (2016). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.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):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf.

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

MLA Handbook (7th Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Web. 19 Jul 2019.

Vancouver:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf.

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

Council of Science Editors:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Thesis]. Indian Institute of Science; 2016. Available from: http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf

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

18. Ma, Jie. Judicious partitions of graphs and hypergraphs.

Degree: PhD, Mathematics, 2011, Georgia Tech

 Classical partitioning problems, like the Max-Cut problem, ask for partitions that optimize one quantity, which are important to such fields as VLSI design, combinatorial optimization,… (more)

Subjects/Keywords: Judicious partition; Azuma-Hoeffding inequality; Hypergraphs; Graph theory

…a k-partition of V(G) is a collection of subsets of V(G), V1 , V2… …of probability theory. Given a sample space, let X be a random variable and A be an event… …partition V1 , V2 of V(G), where G is a weighted graph, that maximizes the total weight… …the Maximum Bipartite Subgraph Problem: Given a graph G, find a partition V1 , V2 of V(G… …graphs. However, it is easy to prove that any graph with m edges has a partition V1 , V2 with… 

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

Ma, J. (2011). Judicious partitions of graphs and hypergraphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/41064

Chicago Manual of Style (16th Edition):

Ma, Jie. “Judicious partitions of graphs and hypergraphs.” 2011. Doctoral Dissertation, Georgia Tech. Accessed July 19, 2019. http://hdl.handle.net/1853/41064.

MLA Handbook (7th Edition):

Ma, Jie. “Judicious partitions of graphs and hypergraphs.” 2011. Web. 19 Jul 2019.

Vancouver:

Ma J. Judicious partitions of graphs and hypergraphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1853/41064.

Council of Science Editors:

Ma J. Judicious partitions of graphs and hypergraphs. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/41064

19. Böörs, Mikael. Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games.

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

  Game theory is the study of strategic interaction between rational agents. The need for understanding interaction arises in many different fields, such as: economics,… (more)

Subjects/Keywords: Game theory; Classification; 2x2 Games; Symmetric Games; Decomposition; Partition; Number of Games; Spelteori; Klassificering; 2x2-spel; Symmetriska spel; Dekomposition; Partitionering; Antal spel; Other Mathematics; Annan matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Böörs, M. (2017). Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991

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

Böörs, Mikael. “Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games.” 2017. Thesis, Linköping UniversityLinköping University. Accessed July 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991.

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

MLA Handbook (7th Edition):

Böörs, Mikael. “Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games.” 2017. Web. 19 Jul 2019.

Vancouver:

Böörs M. Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games. [Internet] [Thesis]. Linköping UniversityLinköping University; 2017. [cited 2019 Jul 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991.

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

Council of Science Editors:

Böörs M. Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games. [Thesis]. Linköping UniversityLinköping University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991

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


Indian Institute of Science

20. Ghoshdastidar, Debarghya. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.

Degree: 2016, Indian Institute of Science

 Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is… (more)

Subjects/Keywords: Spectral Theory; Uniform Hypergraphs; Tensor Spectral Method; Hypergraph Coloring; Uniform Hypergraph Partitioning; Non-uniform Hypergraphs; Spectral Hypergraph Partitioning; Bipartite Hypergraphs; Planted Partition Model; Hypergraph Partitioning; Hypergraphs; Spectral Algorithms; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghoshdastidar, D. (2016). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2947

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

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/2947.

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

MLA Handbook (7th Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Web. 19 Jul 2019.

Vancouver:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/2947.

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

Council of Science Editors:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Thesis]. Indian Institute of Science; 2016. Available from: http://hdl.handle.net/2005/2947

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


University of Florida

21. Jennings-Shaffer, Christopher M. Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations.

Degree: PhD, Mathematics, 2015, University of Florida

 In additive number theory a function of particular interest is the partition function. Related to counting the number of partitions of n is to weight… (more)

Subjects/Keywords: Analytics; Arithmetic; Generating function; Integers; Mathematical congruence; Mathematical inequalities; Mathematics; Number theory; Property partitioning; Vector spaces; congruences  – overpartition  – partition  – q-series  – quasi-modular  – spt  – spt-crank

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jennings-Shaffer, C. M. (2015). Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047655

Chicago Manual of Style (16th Edition):

Jennings-Shaffer, Christopher M. “Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations.” 2015. Doctoral Dissertation, University of Florida. Accessed July 19, 2019. http://ufdc.ufl.edu/UFE0047655.

MLA Handbook (7th Edition):

Jennings-Shaffer, Christopher M. “Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations.” 2015. Web. 19 Jul 2019.

Vancouver:

Jennings-Shaffer CM. Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Jul 19]. Available from: http://ufdc.ufl.edu/UFE0047655.

Council of Science Editors:

Jennings-Shaffer CM. Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0047655


University of North Texas

22. May, Russell J. A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities.

Degree: 2001, University of North Texas

 Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Further, we present a streamlined proof that J<λ+(a)… (more)

Subjects/Keywords: Set theory.; Axiom of Determinancy; possible cofinalities; strong partition relation; proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

May, R. J. (2001). A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc2789/

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

May, Russell J. “A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities.” 2001. Thesis, University of North Texas. Accessed July 19, 2019. https://digital.library.unt.edu/ark:/67531/metadc2789/.

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

MLA Handbook (7th Edition):

May, Russell J. “A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities.” 2001. Web. 19 Jul 2019.

Vancouver:

May RJ. A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities. [Internet] [Thesis]. University of North Texas; 2001. [cited 2019 Jul 19]. Available from: https://digital.library.unt.edu/ark:/67531/metadc2789/.

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

Council of Science Editors:

May RJ. A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities. [Thesis]. University of North Texas; 2001. Available from: https://digital.library.unt.edu/ark:/67531/metadc2789/

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


University of North Texas

23. De Fina, Karina M. Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects.

Degree: 2004, University of North Texas

 The purpose of this thesis is to analyze the thermochemical properties of solutes in nonelectrolyte pure solvents and to develop mathematical expressions with the ability… (more)

Subjects/Keywords: Solubility.; Solvents.; Solution (Chemistry); mobile order theory; solubility; partition coefficients

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Fina, K. M. (2004). Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc4626/

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

De Fina, Karina M. “Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects.” 2004. Thesis, University of North Texas. Accessed July 19, 2019. https://digital.library.unt.edu/ark:/67531/metadc4626/.

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

MLA Handbook (7th Edition):

De Fina, Karina M. “Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects.” 2004. Web. 19 Jul 2019.

Vancouver:

De Fina KM. Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects. [Internet] [Thesis]. University of North Texas; 2004. [cited 2019 Jul 19]. Available from: https://digital.library.unt.edu/ark:/67531/metadc4626/.

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

Council of Science Editors:

De Fina KM. Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects. [Thesis]. University of North Texas; 2004. Available from: https://digital.library.unt.edu/ark:/67531/metadc4626/

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

24. Farhangi, Sohail. On Refinements of Van der Waerden's Theorem.

Degree: MS, Mathematics, 2016, Virginia Tech

We examine different methods of generalize Van der Waerden's Theorem, the Multidimensional Van der Waerden Theorem, the Canonical Van der Waerden Theorem, and other Variants. Advisors/Committee Members: Brown, Ezra A. (committeechair), Mihalcea, Constantin Leonardo (committee member), Floyd, William J. (committee member).

Subjects/Keywords: Van der Waerdens Theorem; Arithmetic Progression; Ramsey Theory; Partition Regularity; Canonical Ramsey Theory

…states that for any finite partition of Z+ , at least one of the partition classes contains… …of points in Z+ , then for any partition of Z+ , at least one of the partition classes… …finite structure you choose in one of the partition classes, which is certainly not a random… …and any partition of Z+ into r sets, at least 1 partition class contains a k-term S-A.P… …n, nZ+ , is a Large set. To see this, we note that for any k, r ∈ Z+ , and any partition… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farhangi, S. (2016). On Refinements of Van der Waerden's Theorem. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/73355

Chicago Manual of Style (16th Edition):

Farhangi, Sohail. “On Refinements of Van der Waerden's Theorem.” 2016. Masters Thesis, Virginia Tech. Accessed July 19, 2019. http://hdl.handle.net/10919/73355.

MLA Handbook (7th Edition):

Farhangi, Sohail. “On Refinements of Van der Waerden's Theorem.” 2016. Web. 19 Jul 2019.

Vancouver:

Farhangi S. On Refinements of Van der Waerden's Theorem. [Internet] [Masters thesis]. Virginia Tech; 2016. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/10919/73355.

Council of Science Editors:

Farhangi S. On Refinements of Van der Waerden's Theorem. [Masters Thesis]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/73355


University of Southern California

25. Yerramalli, Srinivas. Communication and cooperation in underwater acoustic networks.

Degree: PhD, Electrical Engineering, 2013, University of Southern California

 In this thesis, we present a study of several problems related to underwater point to point communications and network formation. We explore techniques to improve… (more)

Subjects/Keywords: underwater communications; wideband communications; OFDM; Doppler; time scale; partial FFT; estimator analysis; resampling; channel estimation; cooperation; game theory; wireless networks; partition form games; interference modeling; multiple access channels; broadcast channels; duality; Generalized Nash Equilibrium Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yerramalli, S. (2013). Communication and cooperation in underwater acoustic networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465

Chicago Manual of Style (16th Edition):

Yerramalli, Srinivas. “Communication and cooperation in underwater acoustic networks.” 2013. Doctoral Dissertation, University of Southern California. Accessed July 19, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465.

MLA Handbook (7th Edition):

Yerramalli, Srinivas. “Communication and cooperation in underwater acoustic networks.” 2013. Web. 19 Jul 2019.

Vancouver:

Yerramalli S. Communication and cooperation in underwater acoustic networks. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2019 Jul 19]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465.

Council of Science Editors:

Yerramalli S. Communication and cooperation in underwater acoustic networks. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465


East Tennessee State University

26. Lachniet, Jason. Alliance Partitions in Graphs.

Degree: MS, Mathematical Sciences, 2007, East Tennessee State University

  For a graph G=(V,E), a nonempty subset S contained in V is called a defensive alliance if for each v in S, there are… (more)

Subjects/Keywords: domination; alliance partition; defensive alliance; graph theory; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lachniet, J. (2007). Alliance Partitions in Graphs. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2080

Chicago Manual of Style (16th Edition):

Lachniet, Jason. “Alliance Partitions in Graphs.” 2007. Masters Thesis, East Tennessee State University. Accessed July 19, 2019. https://dc.etsu.edu/etd/2080.

MLA Handbook (7th Edition):

Lachniet, Jason. “Alliance Partitions in Graphs.” 2007. Web. 19 Jul 2019.

Vancouver:

Lachniet J. Alliance Partitions in Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2007. [cited 2019 Jul 19]. Available from: https://dc.etsu.edu/etd/2080.

Council of Science Editors:

Lachniet J. Alliance Partitions in Graphs. [Masters Thesis]. East Tennessee State University; 2007. Available from: https://dc.etsu.edu/etd/2080


The Ohio State University

27. Zhang, Luyao. Bounded Rationality and Mechanism Design.

Degree: PhD, Economics, 2018, The Ohio State University

  Mechanism Design Theory, introduced by 2007 Nobel laureates Hurwicz, Maskin, and Myerson, has guided economic institutions worldwide to achieve desirable goals in allocating scarce… (more)

Subjects/Keywords: Applied Mathematics; Epistemology; Philosophy of Science; Behavioral Sciences; Experimental Psychology; Economics; Behavioral Psychology; Cognitive Psychology; Economic Theory; Ethics; Neurosciences; Psychology; Bounded Rationality, Mechanism Design, mistrust, dominant strategy mechanism, transdisciplinary conversations, axiomatic approaches, obviously strategy-proof mechanism, partition obvious preference, information partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, L. (2018). Bounded Rationality and Mechanism Design. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569

Chicago Manual of Style (16th Edition):

Zhang, Luyao. “Bounded Rationality and Mechanism Design.” 2018. Doctoral Dissertation, The Ohio State University. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569.

MLA Handbook (7th Edition):

Zhang, Luyao. “Bounded Rationality and Mechanism Design.” 2018. Web. 19 Jul 2019.

Vancouver:

Zhang L. Bounded Rationality and Mechanism Design. [Internet] [Doctoral dissertation]. The Ohio State University; 2018. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569.

Council of Science Editors:

Zhang L. Bounded Rationality and Mechanism Design. [Doctoral Dissertation]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569

28. Rodger, R.J. A Pedagogical Introduction to the AGT Conjecture.

Degree: 2013, Universiteit Utrecht

 The AGT conjecture is a natural identification between certain information-rich objects in 4d N=2 supersymmetric gauge theories and Liouville conformal field theory. Though relatively easy… (more)

Subjects/Keywords: AGT; Gaiotto curve; trifundamental; Nekrasov partition function; Liouville conformal field theory

…supersymmetries. We assume that Q and Q positive-definite metric, i.e. our theory is unitary. We can… …immediately deduce some interesting properties of supersymmetric field theory from these relations… …because our theory is unitary (i.e. our states live in a vector As {Q1 , Q space with… …particle, i.e. a gauge boson. As for our N = 2 theory, if we start with a Clifford vacuum with… …the fore in contemporary gauge theory literature. 1.3.2 Massive Irreducible… 

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

Rodger, R. J. (2013). A Pedagogical Introduction to the AGT Conjecture. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/280134

Chicago Manual of Style (16th Edition):

Rodger, R J. “A Pedagogical Introduction to the AGT Conjecture.” 2013. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/280134.

MLA Handbook (7th Edition):

Rodger, R J. “A Pedagogical Introduction to the AGT Conjecture.” 2013. Web. 19 Jul 2019.

Vancouver:

Rodger RJ. A Pedagogical Introduction to the AGT Conjecture. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/280134.

Council of Science Editors:

Rodger RJ. A Pedagogical Introduction to the AGT Conjecture. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/280134

29. Chiru, Cezar. Resource based analysis of Ethernet communication between software partitions.

Degree: Design and Engineering, 2015, Mälardalen University

  Nowadays, Industrial Control Systems (ICSs) are becoming larger and implement more complex functions. Therefore, technologies that are currently used to implement these functions, like… (more)

Subjects/Keywords: virtualisation; real-time theory; software partition; hypervisor; Response Time Analysis; Xen

partition, which has the same behavior as a physical computer. It runs an operating system and… …running in the virtual machine is not dependent of the hardware that the software partition is… …running on. This means that the software partition can run an operating system, different from… …partition Ubuntu partition Ubuntu partition Fedora partition Xen Hypervisor (Virtual… …SW – Software partition Vif Core 1 Full Duplex Ethernet Legend Different VLans Port 5… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiru, C. (2015). Resource based analysis of Ethernet communication between software partitions. (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396

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

Chiru, Cezar. “Resource based analysis of Ethernet communication between software partitions.” 2015. Thesis, Mälardalen University. Accessed July 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396.

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

MLA Handbook (7th Edition):

Chiru, Cezar. “Resource based analysis of Ethernet communication between software partitions.” 2015. Web. 19 Jul 2019.

Vancouver:

Chiru C. Resource based analysis of Ethernet communication between software partitions. [Internet] [Thesis]. Mälardalen University; 2015. [cited 2019 Jul 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396.

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

Council of Science Editors:

Chiru C. Resource based analysis of Ethernet communication between software partitions. [Thesis]. Mälardalen University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396

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


University of Cambridge

30. Imseis, Ardi. The United Nations and the Question of Palestine: A Study in International Legal Subalternity .

Degree: 2019, University of Cambridge

 As one of the longest running disputes on the United Nations agenda, the conventional wisdom holds that the UN’s position on the question of Palestine… (more)

Subjects/Keywords: United Nations; Palestine; International law; International Organization; International Legal History; Critical International Legal Theory; Third World Approaches to International Law; Rule of Law; Rule by Law; League of Nations; Partition; Belligerent Occupation; Illegal occupation; Statehood; UN Membership; International Legal Subalternity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Imseis, A. (2019). The United Nations and the Question of Palestine: A Study in International Legal Subalternity . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/290775

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

Imseis, Ardi. “The United Nations and the Question of Palestine: A Study in International Legal Subalternity .” 2019. Thesis, University of Cambridge. Accessed July 19, 2019. https://www.repository.cam.ac.uk/handle/1810/290775.

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

MLA Handbook (7th Edition):

Imseis, Ardi. “The United Nations and the Question of Palestine: A Study in International Legal Subalternity .” 2019. Web. 19 Jul 2019.

Vancouver:

Imseis A. The United Nations and the Question of Palestine: A Study in International Legal Subalternity . [Internet] [Thesis]. University of Cambridge; 2019. [cited 2019 Jul 19]. Available from: https://www.repository.cam.ac.uk/handle/1810/290775.

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

Council of Science Editors:

Imseis A. The United Nations and the Question of Palestine: A Study in International Legal Subalternity . [Thesis]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/290775

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

[1] [2]

.