subject:( Combinatorial designs AND configurations )

Florida Atlantic University

1. Lopez, Oscar A. An Algorithmic Approach to Tran Van Trung's Basic Recursive Construction of t-Designs.

Degree: 2019, Florida Atlantic University

URL: http://fau.digital.flvc.org/islandora/object/fau:41373

►

It was not until the 20th century that combinatorial design theory was studied as a formal subject. This field has many applications, for example in… (more)

Subjects/Keywords: Combinatorial designs and configurations; Algorithms; t-designs

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lopez, O. A. (2019). An Algorithmic Approach to Tran Van Trung's Basic Recursive Construction of t-Designs. (Thesis). Florida Atlantic University. Retrieved from http://fau.digital.flvc.org/islandora/object/fau:41373

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

Lopez, Oscar A. “An Algorithmic Approach to Tran Van Trung's Basic Recursive Construction of t-Designs.” 2019. Thesis, Florida Atlantic University. Accessed January 16, 2021. http://fau.digital.flvc.org/islandora/object/fau:41373.

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

MLA Handbook (7^th Edition):

Lopez, Oscar A. “An Algorithmic Approach to Tran Van Trung's Basic Recursive Construction of t-Designs.” 2019. Web. 16 Jan 2021.

Vancouver:

Lopez OA. An Algorithmic Approach to Tran Van Trung's Basic Recursive Construction of t-Designs. [Internet] [Thesis]. Florida Atlantic University; 2019. [cited 2021 Jan 16]. Available from: http://fau.digital.flvc.org/islandora/object/fau:41373.

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

Council of Science Editors:

Lopez OA. An Algorithmic Approach to Tran Van Trung's Basic Recursive Construction of t-Designs. [Thesis]. Florida Atlantic University; 2019. Available from: http://fau.digital.flvc.org/islandora/object/fau:41373

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

Hong Kong University of Science and Technology

2. Liu, Lu. Effect of query sequence flexibility on product configurator performance.

Degree: 2014, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-71600 ; https://doi.org/10.14711/thesis-b1333906 ; http://repository.ust.hk/ir/bitstream/1783.1-71600/1/th_redirect.html

► Product configurators have been widely used in Mass Customization (MC) to match customers’ requirements with the company’s offerings. The configuration process is important as it… (more)

▼ Product configurators have been widely used in Mass Customization (MC) to match customers’ requirements with the company’s offerings. The configuration process is important as it is directly linked to the economic value an MC offering can create. A good product configurator not only provides customers with good buying experience, but also assists the producer to receive a price premium, comparing with off-the-shelf products. Product configurators usually provide a set of predefined attributes for customers to choose from. Some product configurators operate in a deterministic manner, in which customers need to follow the default sequence to modify the configurable attributes. Others are flexible, so that customers can randomly access the configurable attributes. Since different customers may have different logic to modify the configurable attributes, it can be problematic if a customer’s logic is inconsistent with the default sequence of a deterministic product configurator. The mismatch may cause customer dissatisfaction or abandonment. In contrast, a flexible product configurator seems to be more user-friendly by providing more design freedom. However, as the number of configurable attributes increases, it may require more information processing and efforts from the customers, which could lead to customers’ tendency to follow the default sequence. This research investigated the effect of query sequence flexibility on product configurator’s performance, and whether such effect is influenced by the number of configurable attributes. Performance was assessed through six indices regarding the configured product, the configuration process and the configurator. Experiment results showed that the flexible product configurator was more preferred when the number of configurable attributes was between 6 and 10, but it could not always outperform its deterministic counterpart. Qualitative analysis was also included to provide more insights for companies that are implementing or planning to adopt MC as a marketing strategy.

Subjects/Keywords: Product management ; Mass customization ; Combinatorial designs and configurations

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Liu, L. (2014). Effect of query sequence flexibility on product configurator performance. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-71600 ; https://doi.org/10.14711/thesis-b1333906 ; http://repository.ust.hk/ir/bitstream/1783.1-71600/1/th_redirect.html

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

Liu, Lu. “Effect of query sequence flexibility on product configurator performance.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-71600 ; https://doi.org/10.14711/thesis-b1333906 ; http://repository.ust.hk/ir/bitstream/1783.1-71600/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Liu, Lu. “Effect of query sequence flexibility on product configurator performance.” 2014. Web. 16 Jan 2021.

Vancouver:

Liu L. Effect of query sequence flexibility on product configurator performance. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-71600 ; https://doi.org/10.14711/thesis-b1333906 ; http://repository.ust.hk/ir/bitstream/1783.1-71600/1/th_redirect.html.

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

Council of Science Editors:

Liu L. Effect of query sequence flexibility on product configurator performance. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-71600 ; https://doi.org/10.14711/thesis-b1333906 ; http://repository.ust.hk/ir/bitstream/1783.1-71600/1/th_redirect.html

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

The Ohio State University

3. Moon, Aeryung. Some results in designs and association schemes.

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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487160321861079

Subjects/Keywords: Mathematics; Combinatorial designs and configurations

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Moon, A. (1981). Some results in designs and association schemes. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487160321861079

Chicago Manual of Style (16^th Edition):

Moon, Aeryung. “Some results in designs and association schemes.” 1981. Doctoral Dissertation, The Ohio State University. Accessed January 16, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487160321861079.

MLA Handbook (7^th Edition):

Moon, Aeryung. “Some results in designs and association schemes.” 1981. Web. 16 Jan 2021.

Vancouver:

Moon A. Some results in designs and association schemes. [Internet] [Doctoral dissertation]. The Ohio State University; 1981. [cited 2021 Jan 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487160321861079.

Council of Science Editors:

Moon A. Some results in designs and association schemes. [Doctoral Dissertation]. The Ohio State University; 1981. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487160321861079

4. Hedgpeth, Marianne Austin. Linear and circular k-combinations with restrictions.

Degree: 1969, NC Docks

URL: http://libres.uncg.edu/ir/uncg/f/hedgpeth_marianne_1969.pdf

► For several years problems involving k-combinations of n objects have filled the literature. Most of these have concerned combinations taken on a line, but selections… (more)

Subjects/Keywords: Combinatorial designs and configurations; Combinations

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hedgpeth, M. A. (1969). Linear and circular k-combinations with restrictions. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/hedgpeth_marianne_1969.pdf

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

Hedgpeth, Marianne Austin. “Linear and circular k-combinations with restrictions.” 1969. Thesis, NC Docks. Accessed January 16, 2021. http://libres.uncg.edu/ir/uncg/f/hedgpeth_marianne_1969.pdf.

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

MLA Handbook (7^th Edition):

Hedgpeth, Marianne Austin. “Linear and circular k-combinations with restrictions.” 1969. Web. 16 Jan 2021.

Vancouver:

Hedgpeth MA. Linear and circular k-combinations with restrictions. [Internet] [Thesis]. NC Docks; 1969. [cited 2021 Jan 16]. Available from: http://libres.uncg.edu/ir/uncg/f/hedgpeth_marianne_1969.pdf.

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

Council of Science Editors:

Hedgpeth MA. Linear and circular k-combinations with restrictions. [Thesis]. NC Docks; 1969. Available from: http://libres.uncg.edu/ir/uncg/f/hedgpeth_marianne_1969.pdf

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

University of Sydney

5. Sarvate, Dinesh Gopalrao. Theory of combinatorial designs : with applications to encryption and the design of experiments .

Degree: 1987, University of Sydney

URL: http://hdl.handle.net/2123/7258

Subjects/Keywords: Block designs; Combinatorial designs and configurations.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sarvate, D. G. (1987). Theory of combinatorial designs : with applications to encryption and the design of experiments . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/7258

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

Sarvate, Dinesh Gopalrao. “Theory of combinatorial designs : with applications to encryption and the design of experiments .” 1987. Thesis, University of Sydney. Accessed January 16, 2021. http://hdl.handle.net/2123/7258.

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

MLA Handbook (7^th Edition):

Sarvate, Dinesh Gopalrao. “Theory of combinatorial designs : with applications to encryption and the design of experiments .” 1987. Web. 16 Jan 2021.

Vancouver:

Sarvate DG. Theory of combinatorial designs : with applications to encryption and the design of experiments . [Internet] [Thesis]. University of Sydney; 1987. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2123/7258.

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

Council of Science Editors:

Sarvate DG. Theory of combinatorial designs : with applications to encryption and the design of experiments . [Thesis]. University of Sydney; 1987. Available from: http://hdl.handle.net/2123/7258

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

Florida Atlantic University

6. Kolotoglu, Emre. Construction of combinatorial designs with prescribed automorphism groups.

Degree: PhD, 2013, Florida Atlantic University

URL: http://purl.flvc.org/fcla/dt/3360795

Summary: In this dissertation, we study some open problems concerning the existence or non-existence of some combinatorial designs. We give the construction or proof of non-existence of some Steiner systems, large sets of designs, and graph designs, with prescribed automorphism groups.

System requirements: Adobe Reader.

Subjects/Keywords: Combinatorial designs and configurations; Finite geometries; Curves, Algebraic; Automorphisms; Mathematical optimization; Steiner systems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kolotoglu, E. (2013). Construction of combinatorial designs with prescribed automorphism groups. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/fcla/dt/3360795

Chicago Manual of Style (16^th Edition):

Kolotoglu, Emre. “Construction of combinatorial designs with prescribed automorphism groups.” 2013. Doctoral Dissertation, Florida Atlantic University. Accessed January 16, 2021. http://purl.flvc.org/fcla/dt/3360795.

MLA Handbook (7^th Edition):

Kolotoglu, Emre. “Construction of combinatorial designs with prescribed automorphism groups.” 2013. Web. 16 Jan 2021.

Vancouver:

Kolotoglu E. Construction of combinatorial designs with prescribed automorphism groups. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2013. [cited 2021 Jan 16]. Available from: http://purl.flvc.org/fcla/dt/3360795.

Council of Science Editors:

Kolotoglu E. Construction of combinatorial designs with prescribed automorphism groups. [Doctoral Dissertation]. Florida Atlantic University; 2013. Available from: http://purl.flvc.org/fcla/dt/3360795

Simon Fraser University

7. Meijer, Paul Theo. Connectivities and diameters of circulant graphs.

Degree: 1991, Simon Fraser University

URL: http://summit.sfu.ca/item/3536

Subjects/Keywords: Graph theory.; Combinatorial designs and configurations.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Meijer, P. T. (1991). Connectivities and diameters of circulant graphs. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/3536

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

Meijer, Paul Theo. “Connectivities and diameters of circulant graphs.” 1991. Thesis, Simon Fraser University. Accessed January 16, 2021. http://summit.sfu.ca/item/3536.

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

MLA Handbook (7^th Edition):

Meijer, Paul Theo. “Connectivities and diameters of circulant graphs.” 1991. Web. 16 Jan 2021.

Vancouver:

Meijer PT. Connectivities and diameters of circulant graphs. [Internet] [Thesis]. Simon Fraser University; 1991. [cited 2021 Jan 16]. Available from: http://summit.sfu.ca/item/3536.

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

Council of Science Editors:

Meijer PT. Connectivities and diameters of circulant graphs. [Thesis]. Simon Fraser University; 1991. Available from: http://summit.sfu.ca/item/3536

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

Simon Fraser University

8. Chen, Taiyu. Connectivity in vertex-transitive graphs.

Degree: 1994, Simon Fraser University

URL: http://summit.sfu.ca/item/5073

Subjects/Keywords: Graph theory.; Combinatorial designs and configurations.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chen, T. (1994). Connectivity in vertex-transitive graphs. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5073

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

Chen, Taiyu. “Connectivity in vertex-transitive graphs.” 1994. Thesis, Simon Fraser University. Accessed January 16, 2021. http://summit.sfu.ca/item/5073.

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

MLA Handbook (7^th Edition):

Chen, Taiyu. “Connectivity in vertex-transitive graphs.” 1994. Web. 16 Jan 2021.

Vancouver:

Chen T. Connectivity in vertex-transitive graphs. [Internet] [Thesis]. Simon Fraser University; 1994. [cited 2021 Jan 16]. Available from: http://summit.sfu.ca/item/5073.

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

Council of Science Editors:

Chen T. Connectivity in vertex-transitive graphs. [Thesis]. Simon Fraser University; 1994. Available from: http://summit.sfu.ca/item/5073

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

Simon Fraser University

9. Bluskov, Iliya. New designs and coverings.

Degree: 1997, Simon Fraser University

URL: http://summit.sfu.ca/item/7343

Subjects/Keywords: Combinatorial packing and covering.; Combinatorial designs and configurations.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bluskov, I. (1997). New designs and coverings. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/7343

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

Bluskov, Iliya. “New designs and coverings.” 1997. Thesis, Simon Fraser University. Accessed January 16, 2021. http://summit.sfu.ca/item/7343.

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

MLA Handbook (7^th Edition):

Bluskov, Iliya. “New designs and coverings.” 1997. Web. 16 Jan 2021.

Vancouver:

Bluskov I. New designs and coverings. [Internet] [Thesis]. Simon Fraser University; 1997. [cited 2021 Jan 16]. Available from: http://summit.sfu.ca/item/7343.

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

Council of Science Editors:

Bluskov I. New designs and coverings. [Thesis]. Simon Fraser University; 1997. Available from: http://summit.sfu.ca/item/7343

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

University of Arizona

10. Modisett, Matthew Clayton. A characterization of the circularity of certain balanced incomplete block designs.

Degree: 1988, University of Arizona

URL: http://hdl.handle.net/10150/184393

► When defining a structure to fulfill a set of axioms that are similar to those prescribed by Euclid, one must select a set of points… (more)

▼ When defining a structure to fulfill a set of axioms that are similar to those prescribed by Euclid, one must select a set of points and then define what is meant by a line and what is meant by a circle. When properly defined these labels will have properties which are similar to their counterparts in the (complex) plane, the lines and circles which Euclid undoubtedly had in mind. In this manner, the geometer may employ his intuition from the complex plane to prove theorems about other systems. Most "finite geometries" have clearly defined notions of points and lines but fail to define circles. The two notable exceptions are the circles in a finite affine plane and the circles in a Mobius plane. Using the geometry of Euclid as motivation, we strive to develop structures with both lines and circles. The only successful example other than the complex plane is the affine plane over a finite field, where all of Euclid's geometry holds except for any assertions involving order or continuity. To complement the prolific work concerning finite geometries and their lines, we provide a general definition of a circle, or more correctly, of a collection of circles and present some preliminary results concerning the construction of such structures. Our definition includes the circles of an affine plane over a finite field and the circles in a Mobius plane as special cases. We develop a necessary and sufficient condition for circularity, present computational techniques for determining circularity and give varying constructions. We devote a chapter to the use of circular designs in coding theory. It is proven that these structures are not useful in the theory of error-correcting codes, since more efficient codes are known, for example the Reed-Muller codes. However, the theory developed in the earlier chapters does have applications to Cryptology. We present five encryption methods utilizing circular structures. Advisors/Committee Members: Clay, James R (advisor), Benson, Clark (committeemember), Brillhart, John (committeemember), Gay, David (committeemember), Greenlee, W. M. (committeemember).

Subjects/Keywords: Incomplete block designs.; Combinatorial designs and configurations.; Circle.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Modisett, M. C. (1988). A characterization of the circularity of certain balanced incomplete block designs. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/184393

Chicago Manual of Style (16^th Edition):

Modisett, Matthew Clayton. “A characterization of the circularity of certain balanced incomplete block designs. ” 1988. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/184393.

MLA Handbook (7^th Edition):

Modisett, Matthew Clayton. “A characterization of the circularity of certain balanced incomplete block designs. ” 1988. Web. 16 Jan 2021.

Vancouver:

Modisett MC. A characterization of the circularity of certain balanced incomplete block designs. [Internet] [Doctoral dissertation]. University of Arizona; 1988. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/184393.

Council of Science Editors:

Modisett MC. A characterization of the circularity of certain balanced incomplete block designs. [Doctoral Dissertation]. University of Arizona; 1988. Available from: http://hdl.handle.net/10150/184393

Florida Atlantic University

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

Degree: 2015, Florida Atlantic University

URL: http://purl.flvc.org/fau/fd/FA00004471 ; (URL) http://purl.flvc.org/fau/fd/FA00004471

►

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

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

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

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

Chicago Manual of Style (16^th Edition):

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

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

MLA Handbook (7^th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

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

Simon Fraser University

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

Degree: 1992, Simon Fraser University

URL: http://summit.sfu.ca/item/3815

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

Harms, Daryl Dean. “A symbolic algebra environment for research in network reliability.” 1992. Thesis, Simon Fraser University. Accessed January 16, 2021. 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 (7^th Edition):

Harms, Daryl Dean. “A symbolic algebra environment for research in network reliability.” 1992. Web. 16 Jan 2021.

Vancouver:

Harms DD. A symbolic algebra environment for research in network reliability. [Internet] [Thesis]. Simon Fraser University; 1992. [cited 2021 Jan 16]. 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

Simon Fraser University

13. Yu, Min-li. Resolvable path designs of complete graphs.

Degree: 1987, Simon Fraser University

URL: http://summit.sfu.ca/item/5314

Subjects/Keywords: Complete graphs.; Combinatorial designs and configurations.; Graph theory.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Yu, M. (1987). Resolvable path designs of complete graphs. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5314

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

Yu, Min-li. “Resolvable path designs of complete graphs.” 1987. Thesis, Simon Fraser University. Accessed January 16, 2021. http://summit.sfu.ca/item/5314.

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

MLA Handbook (7^th Edition):

Yu, Min-li. “Resolvable path designs of complete graphs.” 1987. Web. 16 Jan 2021.

Vancouver:

Yu M. Resolvable path designs of complete graphs. [Internet] [Thesis]. Simon Fraser University; 1987. [cited 2021 Jan 16]. Available from: http://summit.sfu.ca/item/5314.

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

Council of Science Editors:

Yu M. Resolvable path designs of complete graphs. [Thesis]. Simon Fraser University; 1987. Available from: http://summit.sfu.ca/item/5314

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

The Ohio State University

14. Hong, Yiming. On the nonexistence of perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e > 3 and q > 3.

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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487255963556229

Subjects/Keywords: Mathematics; Coding theory; Combinatorial designs and configurations

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hong, Y. (1984). On the nonexistence of perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e > 3 and q > 3. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487255963556229

Chicago Manual of Style (16^th Edition):

Hong, Yiming. “On the nonexistence of perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e > 3 and q > 3.” 1984. Doctoral Dissertation, The Ohio State University. Accessed January 16, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487255963556229.

MLA Handbook (7^th Edition):

Hong, Yiming. “On the nonexistence of perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e > 3 and q > 3.” 1984. Web. 16 Jan 2021.

Vancouver:

Hong Y. On the nonexistence of perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e > 3 and q > 3. [Internet] [Doctoral dissertation]. The Ohio State University; 1984. [cited 2021 Jan 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487255963556229.

Council of Science Editors:

Hong Y. On the nonexistence of perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e > 3 and q > 3. [Doctoral Dissertation]. The Ohio State University; 1984. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487255963556229

The Ohio State University

15. Huang, Tayuan. Some results on the association schemes of bilinear forms .

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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919111685

Subjects/Keywords: Mathematics; Bilinear forms; Combinatorial designs and configurations; Graph theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Huang, T. (1985). Some results on the association schemes of bilinear forms . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919111685

Chicago Manual of Style (16^th Edition):

Huang, Tayuan. “Some results on the association schemes of bilinear forms .” 1985. Doctoral Dissertation, The Ohio State University. Accessed January 16, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919111685.

MLA Handbook (7^th Edition):

Huang, Tayuan. “Some results on the association schemes of bilinear forms .” 1985. Web. 16 Jan 2021.

Vancouver:

Huang T. Some results on the association schemes of bilinear forms . [Internet] [Doctoral dissertation]. The Ohio State University; 1985. [cited 2021 Jan 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919111685.

Council of Science Editors:

Huang T. Some results on the association schemes of bilinear forms . [Doctoral Dissertation]. The Ohio State University; 1985. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919111685

California State University – San Bernardino

16. Holland, Eric. The traveling salesman problem improving K-opt via edge cut equivalence sets.

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

URL: http://scholarworks.lib.csusb.edu/etd-project/1844

The traveling salesman problem (TSP) has become a classic in the field of combinatorial optimization. Attracting computer scientists and mathematicians, the problem involves finding a minimum cost Hamiltonian cycle in a weighted graph.

Subjects/Keywords: Combinatorial designs and configurations – Data processing; Traveling-salesman problem; Computer algorithms; Combinatorial optimization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Holland, E. (2001). The traveling salesman problem improving K-opt via edge cut equivalence sets. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/1844

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

Holland, Eric. “The traveling salesman problem improving K-opt via edge cut equivalence sets.” 2001. Thesis, California State University – San Bernardino. Accessed January 16, 2021. http://scholarworks.lib.csusb.edu/etd-project/1844.

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

MLA Handbook (7^th Edition):

Holland, Eric. “The traveling salesman problem improving K-opt via edge cut equivalence sets.” 2001. Web. 16 Jan 2021.

Vancouver:

Holland E. The traveling salesman problem improving K-opt via edge cut equivalence sets. [Internet] [Thesis]. California State University – San Bernardino; 2001. [cited 2021 Jan 16]. Available from: http://scholarworks.lib.csusb.edu/etd-project/1844.

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

Council of Science Editors:

Holland E. The traveling salesman problem improving K-opt via edge cut equivalence sets. [Thesis]. California State University – San Bernardino; 2001. Available from: http://scholarworks.lib.csusb.edu/etd-project/1844

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

University of Adelaide

17. Chang, Teng-Wen. Geometric typed feature structures : toward design space exploration / Teng-Wen Chang.

Degree: 1999, University of Adelaide

URL: http://hdl.handle.net/2440/19427

Demonstrates the significance and usefulness of representation in geometry by generating various floor design layouts for a typical Australian house, a single fronted cottage and the building enclosures. Advisors/Committee Members: School of Architecture, Landscape Architecture and Urban Design (school).

Subjects/Keywords: Architecture, Domestic Australia Designs and plans Mathematics; Combinatorial designs and configurations.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chang, T. (1999). Geometric typed feature structures : toward design space exploration / Teng-Wen Chang. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/19427

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

Chang, Teng-Wen. “Geometric typed feature structures : toward design space exploration / Teng-Wen Chang.” 1999. Thesis, University of Adelaide. Accessed January 16, 2021. http://hdl.handle.net/2440/19427.

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

MLA Handbook (7^th Edition):

Chang, Teng-Wen. “Geometric typed feature structures : toward design space exploration / Teng-Wen Chang.” 1999. Web. 16 Jan 2021.

Vancouver:

Chang T. Geometric typed feature structures : toward design space exploration / Teng-Wen Chang. [Internet] [Thesis]. University of Adelaide; 1999. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2440/19427.

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

Council of Science Editors:

Chang T. Geometric typed feature structures : toward design space exploration / Teng-Wen Chang. [Thesis]. University of Adelaide; 1999. Available from: http://hdl.handle.net/2440/19427

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

Simon Fraser University

18. Hare, Donovan Ross. Block-intersection graph of pairwise balance designs.

Degree: 1991, Simon Fraser University

URL: http://summit.sfu.ca/item/4515

Subjects/Keywords: Combinatorial designs and configurations.; Graph theory.; Hamiltonian graph theory.; Block designs.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hare, D. R. (1991). Block-intersection graph of pairwise balance designs. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/4515

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

Hare, Donovan Ross. “Block-intersection graph of pairwise balance designs.” 1991. Thesis, Simon Fraser University. Accessed January 16, 2021. http://summit.sfu.ca/item/4515.

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

MLA Handbook (7^th Edition):

Hare, Donovan Ross. “Block-intersection graph of pairwise balance designs.” 1991. Web. 16 Jan 2021.

Vancouver:

Hare DR. Block-intersection graph of pairwise balance designs. [Internet] [Thesis]. Simon Fraser University; 1991. [cited 2021 Jan 16]. Available from: http://summit.sfu.ca/item/4515.

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

Council of Science Editors:

Hare DR. Block-intersection graph of pairwise balance designs. [Thesis]. Simon Fraser University; 1991. Available from: http://summit.sfu.ca/item/4515

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

University of Adelaide

19. Datta, Sambit. Unfolding design spaces interactively / by Sambit Datta.

Degree: 2004, University of Adelaide

URL: http://hdl.handle.net/2440/22094

Subjects/Keywords: Architectural design Data processing.; Combinatorial designs and configurations.; Virtual reality in architecture.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Datta, S. (2004). Unfolding design spaces interactively / by Sambit Datta. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/22094

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

Datta, Sambit. “Unfolding design spaces interactively / by Sambit Datta.” 2004. Thesis, University of Adelaide. Accessed January 16, 2021. http://hdl.handle.net/2440/22094.

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

MLA Handbook (7^th Edition):

Datta, Sambit. “Unfolding design spaces interactively / by Sambit Datta.” 2004. Web. 16 Jan 2021.

Vancouver:

Datta S. Unfolding design spaces interactively / by Sambit Datta. [Internet] [Thesis]. University of Adelaide; 2004. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2440/22094.

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

Council of Science Editors:

Datta S. Unfolding design spaces interactively / by Sambit Datta. [Thesis]. University of Adelaide; 2004. Available from: http://hdl.handle.net/2440/22094

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

Florida Atlantic University

20. Caliskan, Cafer. On projected planes.

Degree: PhD, 2010, Florida Atlantic University

URL: http://purl.flvc.org/FAU/1927609

►

Summary: This work was motivated by the well-known question: "Does there exist a nondesarguesian projective plane of prime order?" For a prime p < 11,… (more)

Subjects/Keywords: Projected planes; Combinatorial designs and configurations; Surfaces, Algebraic; Manifolds (Mathematics)

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Caliskan, C. (2010). On projected planes. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/1927609

Chicago Manual of Style (16^th Edition):

Caliskan, Cafer. “On projected planes.” 2010. Doctoral Dissertation, Florida Atlantic University. Accessed January 16, 2021. http://purl.flvc.org/FAU/1927609.

MLA Handbook (7^th Edition):

Caliskan, Cafer. “On projected planes.” 2010. Web. 16 Jan 2021.

Vancouver:

Caliskan C. On projected planes. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2010. [cited 2021 Jan 16]. Available from: http://purl.flvc.org/FAU/1927609.

Council of Science Editors:

Caliskan C. On projected planes. [Doctoral Dissertation]. Florida Atlantic University; 2010. Available from: http://purl.flvc.org/FAU/1927609

University of North Texas

21. Somporn Sutinuntopas. Applications of Graph Theory and Topology to Combinatorial Designs.

Degree: 1988, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc331968/

► This dissertation is concerned with the existence and the isomorphism of designs. The first part studies the existence of designs. Chapter I shows how to… (more)

Subjects/Keywords: isomorphisms; affine designs; isomorphic designs; Tutte's theorem; Isomorphisms (Mathematics); Graph theory.; Topology.; Combinatorial designs and configurations.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sutinuntopas, S. (1988). Applications of Graph Theory and Topology to Combinatorial Designs. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc331968/

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

Sutinuntopas, Somporn. “Applications of Graph Theory and Topology to Combinatorial Designs.” 1988. Thesis, University of North Texas. Accessed January 16, 2021. https://digital.library.unt.edu/ark:/67531/metadc331968/.

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

MLA Handbook (7^th Edition):

Sutinuntopas, Somporn. “Applications of Graph Theory and Topology to Combinatorial Designs.” 1988. Web. 16 Jan 2021.

Vancouver:

Sutinuntopas S. Applications of Graph Theory and Topology to Combinatorial Designs. [Internet] [Thesis]. University of North Texas; 1988. [cited 2021 Jan 16]. Available from: https://digital.library.unt.edu/ark:/67531/metadc331968/.

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

Council of Science Editors:

Sutinuntopas S. Applications of Graph Theory and Topology to Combinatorial Designs. [Thesis]. University of North Texas; 1988. Available from: https://digital.library.unt.edu/ark:/67531/metadc331968/

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

Georgia Tech

22. Wingkono, Gracy A. Combinatorial Technique for Biomaterial Design.

Degree: MS, Chemical Engineering, 2004, Georgia Tech

URL: http://hdl.handle.net/1853/7264

► Combinatorial techniques have changed the paradigm of materials research by allowing a faster data acquisition in complex problems with multidimensional parameter space. The focus of… (more)

Subjects/Keywords: Protein adsorption; Cellular adhesion; Cellular response; Crystallization; Dewetting; Phase separation; Combinatorial; Phase transformations (Statistical physics); Crystallization; Combinatorial designs and configurations; Combinatorial chemistry; Cell adhesion; Biomedical materials Design

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wingkono, G. A. (2004). Combinatorial Technique for Biomaterial Design. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/7264

Chicago Manual of Style (16^th Edition):

Wingkono, Gracy A. “Combinatorial Technique for Biomaterial Design.” 2004. Masters Thesis, Georgia Tech. Accessed January 16, 2021. http://hdl.handle.net/1853/7264.

MLA Handbook (7^th Edition):

Wingkono, Gracy A. “Combinatorial Technique for Biomaterial Design.” 2004. Web. 16 Jan 2021.

Vancouver:

Wingkono GA. Combinatorial Technique for Biomaterial Design. [Internet] [Masters thesis]. Georgia Tech; 2004. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1853/7264.

Council of Science Editors:

Wingkono GA. Combinatorial Technique for Biomaterial Design. [Masters Thesis]. Georgia Tech; 2004. Available from: http://hdl.handle.net/1853/7264

University of Michigan

23. Hobart, Sylvia Anne. Coherent Configurations Of Type (2,2;4) And Designs.

Degree: PhD, Pure Sciences, 1987, University of Michigan

URL: http://hdl.handle.net/2027.42/128098

► Coherent configurations of type (2,2;n) correspond to complementary pairs of 2-designs; these are symmetric for n = 2, and quasi-symmetric for n = 3. The… (more)

▼ Coherent configurations of type (2,2;n) correspond to complementary pairs of 2-designs; these are symmetric for n = 2, and quasi-symmetric for n = 3. The Witt design \varphi(4,7,23) is the only quasi-symmetric 4-design. It is an open question whether its extension \varphi(5,8,24), is the only 5-design with three intersection sizes. However \varphi(5,8,24), together with its complement, corresponds to a coherent configuration (c.c.) of type (2,2;4), which led to the study of those configurations in this thesis. The blocks of the pair of complementary designs associated with a c.c. of type (2,2;4) form an association scheme with three associate classes called the block configuration, which can be either symmetric or nonsymmetric. The symmetric case is more common, and we list many examples. We show that the c.c. of type (2,2;4) generated by \varphi(5,8,24) is characterized by the intersection numbers of the block configuration. We also study the case where the block configuration is imprimitive, and designs based on systems of linked symmetric designs are constructed and characterized. Most quasi-symmetric designs cannot be associated with a c.c. of type (2,2;4) with nonsymmetric block configuration, and we only know of one family of examples. We show that these are the only c.c.'s of type (2,2;4) with imprimitive nonsymmetric block configuration. A design is regular if the number of blocks intersecting a given block in a given number of points depends only on the intersection size. We use work of Calderbank and Delsarte to give a set of inequalities for regular designs. A design is a t-design only if the first t of these hold with equality. This leads to a condition for a regular (t-1)-design to be a t-design. This part of the thesis does not require any knowledge of coherent configurations. We show, using work of Cameron, that a 2n-design with n-1 intersection sizes generates a c.c. of type (2,2;4) in a natural way. Essentially, if t is large and the number of intersection sizes is small, then matrix theoretic arguments show that the design must have a great deal of regularity. We then apply this together with the inequalities from earlier to establish necessary equations for 5-designs with three intersection sizes.

Subjects/Keywords: Coherent; Configurations; Designs; Type

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hobart, S. A. (1987). Coherent Configurations Of Type (2,2;4) And Designs. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/128098

Chicago Manual of Style (16^th Edition):

Hobart, Sylvia Anne. “Coherent Configurations Of Type (2,2;4) And Designs.” 1987. Doctoral Dissertation, University of Michigan. Accessed January 16, 2021. http://hdl.handle.net/2027.42/128098.

MLA Handbook (7^th Edition):

Hobart, Sylvia Anne. “Coherent Configurations Of Type (2,2;4) And Designs.” 1987. Web. 16 Jan 2021.

Vancouver:

Hobart SA. Coherent Configurations Of Type (2,2;4) And Designs. [Internet] [Doctoral dissertation]. University of Michigan; 1987. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2027.42/128098.

Council of Science Editors:

Hobart SA. Coherent Configurations Of Type (2,2;4) And Designs. [Doctoral Dissertation]. University of Michigan; 1987. Available from: http://hdl.handle.net/2027.42/128098

The Ohio State University

24. Manickam, Nachimuthu. Distribution invariants of association schemes.

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

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147296

Subjects/Keywords: Mathematics; Combinational designs and configurations; Invariants

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Manickam, N. (1986). Distribution invariants of association schemes. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147296

Chicago Manual of Style (16^th Edition):

Manickam, Nachimuthu. “Distribution invariants of association schemes.” 1986. Doctoral Dissertation, The Ohio State University. Accessed January 16, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147296.

MLA Handbook (7^th Edition):

Manickam, Nachimuthu. “Distribution invariants of association schemes.” 1986. Web. 16 Jan 2021.

Vancouver:

Manickam N. Distribution invariants of association schemes. [Internet] [Doctoral dissertation]. The Ohio State University; 1986. [cited 2021 Jan 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147296.

Council of Science Editors:

Manickam N. Distribution invariants of association schemes. [Doctoral Dissertation]. The Ohio State University; 1986. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147296

25. Savinien, Jean P.X. Cohomology and K-theory of aperiodic tilings.

Degree: PhD, Mathematics, 2008, Georgia Tech

URL: http://hdl.handle.net/1853/24732

► We study the K-theory and cohomology of spaces of aperiodic and repetitive tilings with finite local complexity. Given such a tiling, we build a spectral… (more)

Subjects/Keywords: K-theory; Tilings; Cohomology; Homology theory; K-theory; Aperiodic tilings; Algebraic topology; Tiling (Mathematics); Combinatorial designs and configurations; Mathematics; Spectral sequences (Mathematics)

…the local configurations of their representatives in T , as illustrated by the figure below… …the local configurations of their representatives in Tp . The second point needs… …multicollared prototiles” and the graph that link them according to the local configurations of their…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Savinien, J. P. X. (2008). Cohomology and K-theory of aperiodic tilings. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24732

Chicago Manual of Style (16^th Edition):

Savinien, Jean P X. “Cohomology and K-theory of aperiodic tilings.” 2008. Doctoral Dissertation, Georgia Tech. Accessed January 16, 2021. http://hdl.handle.net/1853/24732.

MLA Handbook (7^th Edition):

Savinien, Jean P X. “Cohomology and K-theory of aperiodic tilings.” 2008. Web. 16 Jan 2021.

Vancouver:

Savinien JPX. Cohomology and K-theory of aperiodic tilings. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1853/24732.

Council of Science Editors:

Savinien JPX. Cohomology and K-theory of aperiodic tilings. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24732

Open Access Theses and Dissertations