Spelling suggestions: "subject:"combinatorial designs anda configurations"" "subject:"combinatorial designs ando configurations""
11 
Unfolding design spaces interactively / by Sambit Datta.Datta, Sambit January 2004 (has links)
"June 27, 2004" / Includes bibliographical references (leaves 180195) / xiii, 195 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)University of Adelaide, School of Architecture, Landscape Architecture and Urban Design, 2004

12 
New quartet methods in phylogenetic combinatiorics /WeyerMenkhoff, Jan. January 1900 (has links)
Thesis (doctoral)Universität Bielefeld, 2003. / Includes bibliographical references (p. 147152).

13 
Geometric typed feature structures : toward design space exploration / TengWen Chang.Chang, TengWen January 1999 (has links)
Bibliography: leaves 231239. / x, 290 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / 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. / Thesis (Ph.D.)University of Adelaide, School of Architecture, Landscape Architecture and Urban Design, 2000?

14 
New quartet methods in phylogenetic combinatorics /WeyerMenkhoff, Jan. January 2003 (has links)
Univ., Diss.Bielefeld, 2003.

15 
Some results on the association schemes of bilinear forms /Huang, Tayuan January 1985 (has links)
No description available.

16 
Applications of Graph Theory and Topology to Combinatorial DesignsSomporn Sutinuntopas 12 1900 (has links)
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 obtain a design from a difference family. Chapters II to IV study the existence of an affine 3(p^m,4,λ) design where the vset is the Galois field GF(p^m). Associated to each prime p, this paper constructs a graph. If the graph has a 1factor, then a difference family and hence an affine design exists. The question arises of how to determine when the graph has a 1factor. It is not hard to see that the graph is connected and of even order. Tutte's theorem shows that if the graph is 2connected and regular of degree three, then the graph has a 1factor. By using the concept of quadratic reciprocity, this paper shows that if p Ξ 53 or 77 (mod 120), the graph is almost regular of degree three, i.e., every vertex has degree three, except two vertices each have degree tow. Adding an extra edge joining the two vertices with degree tow gives a regular graph of degree three. Also, Tutte proved that if A is an edge of the graph satisfying the above conditions, then it must have a 1factor which contains A. The second part of the dissertation is concerned with determining if two designs are isomorphic. Here the vset is any group G and translation by any element in G gives a design automorphism. Given a design B and its difference family D, two topological spaces, B and D, are constructed. We give topological conditions which imply that a design isomorphism is a group isomorphism.

17 
Construction of combinatorial designs with prescribed automorphism groupsUnknown Date (has links)
In this dissertation, we study some open problems concerning the existence or nonexistence of some combinatorial designs. We give the construction or proof of nonexistence of some Steiner systems, large sets of designs, and graph designs, with prescribed automorphism groups. / by Emre Kolotoæglu. / Thesis (Ph.D.)Florida Atlantic University, 2013. / Includes bibliography. / Mode of access: World Wide Web. / System requirements: Adobe Reader.

18 
Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q)Unknown Date (has links)
Every transitive permutation representation of a finite group is the representation of the group in its action on the cosets of a particular subgroup of the group. The group has a certain rank for each of these representations. We first find almost all rank3 and rank4 transitive representations of the projective special linear group P SL(2, q) where q = pm and p is an odd prime. We also determine the rank of P SL (2, p) in terms of p on the cosets of particular given subgroups. We then investigate the construction of rank3 transitive and primitive extensions of a simple group, such that the extension group formed is also simple. In the latter context we present a new, group theoretic construction of the famous HoffmanSingleton graph as a rank3 graph. / Includes bibliography. / Dissertation (Ph.D.)Florida Atlantic University, 2015 / FAU Electronic Theses and Dissertations Collection

19 
Essays in optimal auction designJarman, Ben. January 2008 (has links)
Thesis (Ph. D.)University of Sydney, 2009. / Title from title screen (viewed May 1, 2009) Submitted in fulfilment of the requirements for the degree of Doctor of Philosophy Economics to the Faculty of Economics and Business, University of Sydney. Degree awarded 2009; thesis submitted 2008. Bibliography: leaves 9397. Also available in print form.

20 
The traveling salesman problem improving Kopt via edge cut equivalence setsHolland, Eric 01 January 2001 (has links)
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.

Page generated in 0.2211 seconds