No description available.

An MSc dissertation by Shivani Singh. University of Witwatersrand Faculty of Science, School of Mathematics. August 2016. / These symmetries have interesting applications to enumerative combinatorics and to Ramsey theory. The aim of this thesis will be to present some important results in these fields. In particular, we shall enumerate the r-ary symmetric bracelets of length n. / LG2017

Thesis (Ph. D.)--University of Rhode Island, 2005. / Typescript. Includes bibliographical references (leaves 73-74).

Thesis (Ph.D.)--University of Adelaide, School of Architecture, Landscape Architecture and Urban Design, 2000? / Bibliography: leaves 231-239.

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.

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 statistical experimental design, coding theory, authentication codes, and cryptography. Major approaches to the problem of discovering new t-designs rely on (i) the construction of large sets of t designs, (ii) using prescribed automorphism groups, (iii) recursive construction methods. In 2017 and 2018, Tran Van Trung introduced new recursive techniques to construct t – (v, k, λ) designs. These methods are of purely combinatorial nature and require using "ingredient" t-designs or resolutions whose parameters satisfy a system of non-linear equations. Even after restricting the range of parameters in this new method, the task is computationally intractable. In this work, we enhance Tran Van Trung's "Basic Construction" by a robust and efficient hybrid computational apparatus which enables us to construct hundreds of thousands of new t – (v, k, Λ) designs from previously known ingredient designs. Towards the end of the dissertation we also create a new family of 2-resolutions, which will be infinite if there are infinitely many Sophie Germain primes. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2019. / FAU Electronic Theses and Dissertations Collection

Thesis (Ph. D.)--University of Rhode Island, 2004. / Typescript. Includes bibliographical references (leaves 66-68).

No description available.

This work was motivated by the well-known question: "Does there exist a nondesarguesian projective plane of prime order?" For a prime p < 11, there is only the pappian plane of order p. Hence, such planes are indeed desarguesian. Thus, it is of interest to examine whether there are non-desarguesian planes of order 11. A suggestion by Ascher Wagner in 1985 was made to Spyros S. Magliveras: "Begin with a non-desarguesian plane of order pk, k > 1, determine all subplanes of order p up to collineations, and check whether one of these is non-desarguesian." In this manuscript we use a group-theoretic methodology to determine the subplane structures of some non-desarguesian planes. In particular, we determine orbit representatives of all proper Q-subplanes both of a Veblen-Wedderburn (VW) plane of order 121 and of the Hughes plane of order 121, under their full collineation groups. In PI, there are 13 orbits of Baer subplanes, all of which are desarguesian, and approximately 3000 orbits of Fano subplanes. In Sigma , there are 8 orbits of Baer subplanes, all of which are desarguesian, 2 orbits of subplanes of order 3, and at most 408; 075 distinct Fano subplanes. In addition to the above results, we also study the subplane structures of some non-desarguesian planes, such as the Hall plane of order 25, the Hughes planes of order 25 and 49, and the Figueora planes of order 27 and 125. A surprising discovery by L. Puccio and M. J. de Resmini was the existence of a plane of order 3 in the Hughes plane of order 25. We generalize this result, showing that there are subplanes of order 3 in the Hughes planes of order q2, where q is a prime power and q 5 (mod 6). Furthermore, we analyze the structure of the full collineation groups of certain Veblen- Wedderburn (VW) planes of orders 25, 49 and 121, and discuss how to recover the planes from their collineation groups. / by Cafer Caliskan. / Thesis (Ph.D.)--Florida Atlantic University, 2010. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2010. Mode of access: World Wide Web.

No description available.