Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"University of Victoria" +contributor:("Dukes, Peter")`

.
Showing records 1 – 14 of
14 total matches.

▼ Search Limiters

University of Victoria

1. Niezen, Joanna. Pairwise Balanced Designs of Dimension Three.

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

URL: http://hdl.handle.net/1828/5102

► A linear space is a set of points and lines such that any pair of points lie on exactly one line together. This is equivalent…
(more)

Subjects/Keywords: pairwise balanced design; PBD; Latin square; MOLS; GDD; dimension; linear space; game of Set; Steiner triple system; STS; Steiner space; subspace; Wilson's construction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Niezen, J. (2013). Pairwise Balanced Designs of Dimension Three. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5102

Chicago Manual of Style (16^{th} Edition):

Niezen, Joanna. “Pairwise Balanced Designs of Dimension Three.” 2013. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/5102.

MLA Handbook (7^{th} Edition):

Niezen, Joanna. “Pairwise Balanced Designs of Dimension Three.” 2013. Web. 21 Sep 2020.

Vancouver:

Niezen J. Pairwise Balanced Designs of Dimension Three. [Internet] [Masters thesis]. University of Victoria; 2013. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/5102.

Council of Science Editors:

Niezen J. Pairwise Balanced Designs of Dimension Three. [Masters Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/5102

University of Victoria

2. Flowers, Garret. Embeddings of configurations.

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

URL: http://hdl.handle.net/1828/6049

► In this dissertation, we examine the nature of embeddings with regard to both combinatorial and geometric configurations. A combinatorial [r,k]-configuration is a collection of abstract…
(more)

Subjects/Keywords: configurations; embeddings; geometry; combinatorics; celestial

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Flowers, G. (2015). Embeddings of configurations. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6049

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Flowers, Garret. “Embeddings of configurations.” 2015. Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/6049.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Flowers, Garret. “Embeddings of configurations.” 2015. Web. 21 Sep 2020.

Vancouver:

Flowers G. Embeddings of configurations. [Internet] [Thesis]. University of Victoria; 2015. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/6049.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Flowers G. Embeddings of configurations. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6049

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

3. van Bommel, Christopher Martin. An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares.

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

URL: http://hdl.handle.net/1828/5930

► An incomplete Latin square is a v x v array with an empty n x n subarray with every row and every column containing each…
(more)

Subjects/Keywords: Latin square; Hole; Pairwise balanced design

Record Details Similar Records

❌

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

APA (6^{th} Edition):

van Bommel, C. M. (2015). An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5930

Chicago Manual of Style (16^{th} Edition):

van Bommel, Christopher Martin. “An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares.” 2015. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/5930.

MLA Handbook (7^{th} Edition):

van Bommel, Christopher Martin. “An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares.” 2015. Web. 21 Sep 2020.

Vancouver:

van Bommel CM. An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/5930.

Council of Science Editors:

van Bommel CM. An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/5930

University of Victoria

4. Bowditch, Flora Caroline. Localized structure in graph decompositions.

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

URL: http://hdl.handle.net/1828/11404

► Let v ∈ Z+ and G be a simple graph. A G-decomposition of Kv is a collection F={F1,F2,...,Ft} of subgraphs of Kv such that every…
(more)

Subjects/Keywords: design theory; graph theory; combinatorics; graph decompositions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bowditch, F. C. (2019). Localized structure in graph decompositions. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11404

Chicago Manual of Style (16^{th} Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/11404.

MLA Handbook (7^{th} Edition):

Bowditch, Flora Caroline. “Localized structure in graph decompositions.” 2019. Web. 21 Sep 2020.

Vancouver:

Bowditch FC. Localized structure in graph decompositions. [Internet] [Masters thesis]. University of Victoria; 2019. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/11404.

Council of Science Editors:

Bowditch FC. Localized structure in graph decompositions. [Masters Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11404

University of Victoria

5. Liu, Meixin. Graph decompositions and variance balanced block designs of experiments.

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

URL: http://hdl.handle.net/1828/11056

► We study construction methods for variance balanced design (VBD) with both uncorrelated and correlated errors, where block designs are used to investigate several treatment effects.…
(more)

Subjects/Keywords: Variance balanced block design; Graph decomposition; Experimental design

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, M. (2019). Graph decompositions and variance balanced block designs of experiments. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11056

Chicago Manual of Style (16^{th} Edition):

Liu, Meixin. “Graph decompositions and variance balanced block designs of experiments.” 2019. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/11056.

MLA Handbook (7^{th} Edition):

Liu, Meixin. “Graph decompositions and variance balanced block designs of experiments.” 2019. Web. 21 Sep 2020.

Vancouver:

Liu M. Graph decompositions and variance balanced block designs of experiments. [Internet] [Masters thesis]. University of Victoria; 2019. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/11056.

Council of Science Editors:

Liu M. Graph decompositions and variance balanced block designs of experiments. [Masters Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11056

6. Malloch, Amanda. Thickly resolvable designs.

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

URL: http://hdl.handle.net/1828/7469

► In this dissertation, we consider a generalization of the historically significant problem posed in 1850 by Reverend Thomas Kirkman which asked whether it was possible…
(more)

Subjects/Keywords: combinatorics; design theory; resolvable; asymptotic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Malloch, A. (2016). Thickly resolvable designs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7469

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Malloch, Amanda. “Thickly resolvable designs.” 2016. Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/7469.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Malloch, Amanda. “Thickly resolvable designs.” 2016. Web. 21 Sep 2020.

Vancouver:

Malloch A. Thickly resolvable designs. [Internet] [Thesis]. University of Victoria; 2016. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/7469.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Malloch A. Thickly resolvable designs. [Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7469

Not specified: Masters Thesis or Doctoral Dissertation

7. Garaschuk, Kseniya. Linear methods for rational triangle decompositions.

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

URL: http://hdl.handle.net/1828/5665

► Given a graph G, a K_3-decomposition of G, also called a triangle decomposition, is a set of subgraphs isomorphic to K_3 whose edges partition the…
(more)

Subjects/Keywords: triangle decomposition; linear methods; design theory; graph decomposition

…and Teaching Center at *University* *of* *Victoria* have had some part in
guiding my studies…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garaschuk, K. (2014). Linear methods for rational triangle decompositions. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5665

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Garaschuk, Kseniya. “Linear methods for rational triangle decompositions.” 2014. Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/5665.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Garaschuk, Kseniya. “Linear methods for rational triangle decompositions.” 2014. Web. 21 Sep 2020.

Vancouver:

Garaschuk K. Linear methods for rational triangle decompositions. [Internet] [Thesis]. University of Victoria; 2014. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/5665.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Garaschuk K. Linear methods for rational triangle decompositions. [Thesis]. University of Victoria; 2014. Available from: http://hdl.handle.net/1828/5665

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

8. Malloch, Amanda. The asymptotic existence of graph decompositions with loops.

Degree: Dept. of Mathematics and Statistics, 2009, University of Victoria

URL: http://hdl.handle.net/1828/1705

► Let v [greater than or equal to] k [greater than or equal to] 1 and lamda [greater than or equal to] 0 be integers and…
(more)

Subjects/Keywords: graph decomposition; design theory; UVic Subject Index::Sciences and Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Malloch, A. (2009). The asymptotic existence of graph decompositions with loops. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1705

Chicago Manual of Style (16^{th} Edition):

Malloch, Amanda. “The asymptotic existence of graph decompositions with loops.” 2009. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/1705.

MLA Handbook (7^{th} Edition):

Malloch, Amanda. “The asymptotic existence of graph decompositions with loops.” 2009. Web. 21 Sep 2020.

Vancouver:

Malloch A. The asymptotic existence of graph decompositions with loops. [Internet] [Masters thesis]. University of Victoria; 2009. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/1705.

Council of Science Editors:

Malloch A. The asymptotic existence of graph decompositions with loops. [Masters Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1705

University of Victoria

9. Howard, Leah. Disjoint union-free 3-uniform hypergraphs.

Degree: Dept. of Anthropology, 2006, University of Victoria

URL: http://hdl.handle.net/1828/1868

► A k-uniform hypergraph N = (X. B) of order n is a family of k-subsets B of an n-set X. A k-uniform hypergraph 7 – L…
(more)

Subjects/Keywords: hypergraphs; UVic Subject Index::Sciences and Engineering::Mathematics::Mathematical statistics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howard, L. (2006). Disjoint union-free 3-uniform hypergraphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1868

Chicago Manual of Style (16^{th} Edition):

Howard, Leah. “Disjoint union-free 3-uniform hypergraphs.” 2006. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/1868.

MLA Handbook (7^{th} Edition):

Howard, Leah. “Disjoint union-free 3-uniform hypergraphs.” 2006. Web. 21 Sep 2020.

Vancouver:

Howard L. Disjoint union-free 3-uniform hypergraphs. [Internet] [Masters thesis]. University of Victoria; 2006. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/1868.

Council of Science Editors:

Howard L. Disjoint union-free 3-uniform hypergraphs. [Masters Thesis]. University of Victoria; 2006. Available from: http://hdl.handle.net/1828/1868

University of Victoria

10. Sawchuck, Natalie. Upper and lower bounds on permutation codes of distance four.

Degree: Dept. of Mathematics and Statistics, 2008, University of Victoria

URL: http://hdl.handle.net/1828/1315

► A permutation array, represented by PA(n, d), is a subset of Sn such that any two distinct elements have a distance of at least d…
(more)

Subjects/Keywords: Discrete Mathematics; UVic Subject Index::Sciences and Engineering::Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sawchuck, N. (2008). Upper and lower bounds on permutation codes of distance four. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1315

Chicago Manual of Style (16^{th} Edition):

Sawchuck, Natalie. “Upper and lower bounds on permutation codes of distance four.” 2008. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/1315.

MLA Handbook (7^{th} Edition):

Sawchuck, Natalie. “Upper and lower bounds on permutation codes of distance four.” 2008. Web. 21 Sep 2020.

Vancouver:

Sawchuck N. Upper and lower bounds on permutation codes of distance four. [Internet] [Masters thesis]. University of Victoria; 2008. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/1315.

Council of Science Editors:

Sawchuck N. Upper and lower bounds on permutation codes of distance four. [Masters Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/1315

University of Victoria

11. Chan, Justin. Asymptotic existence results on specific graph decompositions.

Degree: Dept. of Mathematics and Statistics, 2010, University of Victoria

URL: http://hdl.handle.net/1828/2909

► This work examines various asymptotic edge-decomposition problems on graphs. A G-group divisible design (G-GDD) of type [g_1, ..., g_u] and index lambda is a decomposition…
(more)

Subjects/Keywords: combinatorics; combinatorial; design; graph; frame; frames; designs; resolvable; group; divisible; UVic Subject Index::Sciences and Engineering::Mathematics::Pure mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chan, J. (2010). Asymptotic existence results on specific graph decompositions. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2909

Chicago Manual of Style (16^{th} Edition):

Chan, Justin. “Asymptotic existence results on specific graph decompositions.” 2010. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/2909.

MLA Handbook (7^{th} Edition):

Chan, Justin. “Asymptotic existence results on specific graph decompositions.” 2010. Web. 21 Sep 2020.

Vancouver:

Chan J. Asymptotic existence results on specific graph decompositions. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/2909.

Council of Science Editors:

Chan J. Asymptotic existence results on specific graph decompositions. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2909

University of Victoria

12. Howell, Jared. Intersection problem and different pairs problem for Latin squares.

Degree: Dept. of Mathematics and Statistics, 2010, University of Victoria

URL: http://hdl.handle.net/1828/3095

► The intersection of two Latin squares of the same order is the set of cells that contain the same entries in both Latin squares. Determining…
(more)

Subjects/Keywords: Latin squares; UVic Subject Index::Sciences and Engineering::Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howell, J. (2010). Intersection problem and different pairs problem for Latin squares. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3095

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Howell, Jared. “Intersection problem and different pairs problem for Latin squares.” 2010. Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/3095.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Howell, Jared. “Intersection problem and different pairs problem for Latin squares.” 2010. Web. 21 Sep 2020.

Vancouver:

Howell J. Intersection problem and different pairs problem for Latin squares. [Internet] [Thesis]. University of Victoria; 2010. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/3095.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Howell J. Intersection problem and different pairs problem for Latin squares. [Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/3095

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

13. Howard, Leah. Nets of order 4m+2: linear dependence and dimensions of codes.

Degree: Dept. of Mathematics and Statistics, 2009, University of Victoria

URL: http://hdl.handle.net/1828/1566

► A k-net of order n is an incidence structure consisting of n2 points and nk lines. Two lines are said to be parallel if they…
(more)

Subjects/Keywords: combinatorics; design theory; UVic Subject Index::Sciences and Engineering::Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howard, L. (2009). Nets of order 4m+2: linear dependence and dimensions of codes. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1566

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Howard, Leah. “Nets of order 4m+2: linear dependence and dimensions of codes.” 2009. Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/1566.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Howard, Leah. “Nets of order 4m+2: linear dependence and dimensions of codes.” 2009. Web. 21 Sep 2020.

Vancouver:

Howard L. Nets of order 4m+2: linear dependence and dimensions of codes. [Internet] [Thesis]. University of Victoria; 2009. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/1566.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Howard L. Nets of order 4m+2: linear dependence and dimensions of codes. [Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1566

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

14. Parton, Kristin. PermuNim : an impartial game of permutation avoidance.

Degree: Dept. of Mathematics and Statistics, 2010, University of Victoria

URL: http://hdl.handle.net/1828/2522

► PermuNim is an impartial combinatorial game played on a board of squares where each player takes turns playing in rows and columns of the board…
(more)

Subjects/Keywords: Permutations; Games; UVic Subject Index::Sciences and Engineering::Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Parton, K. (2010). PermuNim : an impartial game of permutation avoidance. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2522

Chicago Manual of Style (16^{th} Edition):

Parton, Kristin. “PermuNim : an impartial game of permutation avoidance.” 2010. Masters Thesis, University of Victoria. Accessed September 21, 2020. http://hdl.handle.net/1828/2522.

MLA Handbook (7^{th} Edition):

Parton, Kristin. “PermuNim : an impartial game of permutation avoidance.” 2010. Web. 21 Sep 2020.

Vancouver:

Parton K. PermuNim : an impartial game of permutation avoidance. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1828/2522.

Council of Science Editors:

Parton K. PermuNim : an impartial game of permutation avoidance. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2522