Spelling suggestions: "subject:"partitions (amathematics)"" "subject:"partitions (bmathematics)""
1 
Partition spaces黃炎明, Wong, Yimming. January 1970 (has links)
published_or_final_version / Mathematics / Doctoral / Doctor of Philosophy

2 
Some results on kline partitions /Akerman, Michael Walter. January 1973 (has links)
Thesis (Ph. D.)Oregon State University, 1973. / Typescript (photocopy). Includes bibliographical references. Also available on the World Wide Web.

3 
The generating function for threeline partitions /Southam, James Lewis. January 1970 (has links)
Thesis (Ph. D.)Oregon State University, 1970. / Typescript (photocopy). Includes bibliographical references (leaf 69). Also available on the World Wide Web.

4 
Studies in the Waring problem ...Mason, Ruth Glidden, January 1934 (has links)
Thesis (Ph. D.)University of Chicago, 1932. / Vita. Lithoprinted. "Private edition, distributed by the University of Chicago libraries, Chicago, Illinois."

5 
Waring's theorem for fourth powers ...Chandler, Emily McCoy, January 1933 (has links)
Thesis (Ph. D.)University of Chicago, 1931. / Vita. Lithoprinted. "Private edition, distributed by the University of Chicago libraries, Chicago, Illinois."

6 
Partition spaces.Wong, Yimming. January 1970 (has links)
ThesisPh. D., University of Hong Kong. / Mimeographed.

7 
MULTIRESTRICTED AND ROWED PARTITIONSHaskell, Charles Thomson, 1924 January 1965 (has links)
No description available.

8 
A Waring problemNiven, Ivan, January 1939 (has links)
Thesis (Ph. D.)University of Chicago, 1938. / Vita. Lithoprinted. "Private edition, distributed by the University of Chicago libraries, Chicago, Illinois."

9 
Extensions of Waring's theorem on seventh powersMauch, Margaret Evelyn, January 1941 (has links)
Thesis (Ph. D.)University of Chicago, 1938. / Lithoprinted. Vita.

10 
PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).GOSSETT, ERIC JAMES. January 1984 (has links)
A strongly regular graph can be design partitioned if the vertices of the graph can be partitioned into two sets V and B such that V is a coclique and every vertex in B is adjacent to the same number of vertices in V. In this case, a balanced incomplete block design can be defined by taking elements of V as objects and elements of B as blocks. Many strongly regular graphs can be design partitioned. The nation of design partitioning is extended to a partitioning by a generalization of block designs called orderfree designs. All strongly regular graphs can be partitioned via orderfree designs. Orderfree designs are used to show the nonexistence of a strongly regular graph with parameters (50,28,18,12). The existence of this graph was previously undecided. A computer algorithm that attempts to construct the adjacency matrix of a strongly regular graph (given a suitable orderfree design) is presented. Two appendices related to the algorithm are included. The first lists all parameter sets (n,a,c,d) with n ≤ 50 and a ≠ d that satisfy the standard feasibility conditions for strongly regular graphs. Additional information is included for each set. The second appendix contains adjacency matrices (with the partitioning by cocliques and orderfree designs exhibited) for most of the parameter sets in the first appendix. The theoretical development is presented in the context of association schemes. Partitioning by orderfree designs extends naturally to any association scheme when cocliques are generalized to {Ø,i} cliques. This extended partitioning is applied to generalized hexagons.

Page generated in 1.066 seconds