No description available.

No description available.

No description available.

In this thesis it is demonstrated that the structure of rectilinear polygons can be exploited to solve a variety of geometric problems efficiently. These problems include: (1) recognizing polygonal properties, such as star-shapedness, monotonicity, and edge-visibility, (2) removing hidden lines, (3) constructing the rectilinear convex hull, (4) decomposing rectilinear polygons into simpler components, and (5) placing guards in rectilinear polygons. / A new tool for computational geometry is introduced which extracts information about the winding properties of rectilinear polygons. Employing this tool as a preprocessing step, efficient and conceptually clear algorithms for the above problems have been designed.

No description available.

No description available.

In this thesis we study moduli stacks \calM_\Phi^n, indexed by an integer n>0 and a CM-type (K,\Phi), which parametrize abelian schemes equipped with action by \OK and an \OK-linear principal polarization, such that the representation of \OK on the relative Lie algebra of the abelian scheme consists of n copies of each character in \Phi. We do this by systematically applying Serre's tensor construction, and for that we first establish a general correspondence between polarizations on abelian schemes M\otimes_R A arising from this construction and polarizations on the abelian scheme A, along with positive definite hermitian forms on the module M. Next we describe a tensor product of categories and apply it to the category \Herm_n(\OK) of finite non-degenerate positive-definite \OK-hermitian modules of rank n and the category fibred in groupoids \calM_\Phi^1 of principally polarized CM abelian schemes. Assuming n is prime to the class number of K, we show that Serre's tensor construction provides an identification of this tensor product with a substack of the moduli space \calM_\Phi^n, and that in some cases, such as when the base is finite type over \CC or an algebraically closed field of characteristic zero, this substack is the entire space. We then use this characterization to describe the Galois action on \calM_\Phi^n(\overline{\QQ}), by using the description of the action on \calM_\Phi^1(\overline{\QQ}) supplied by the main theorem of complex multiplication.

In this thesis we study moduli stacks \calM_\Phi^n, indexed by an integer n>0 and a CM-type (K,\Phi), which parametrize abelian schemes equipped with action by \OK and an \OK-linear principal polarization, such that the representation of \OK on the relative Lie algebra of the abelian scheme consists of n copies of each character in \Phi. We do this by systematically applying Serre's tensor construction, and for that we first establish a general correspondence between polarizations on abelian schemes M\otimes_R A arising from this construction and polarizations on the abelian scheme A, along with positive definite hermitian forms on the module M. Next we describe a tensor product of categories and apply it to the category \Herm_n(\OK) of finite non-degenerate positive-definite \OK-hermitian modules of rank n and the category fibred in groupoids \calM_\Phi^1 of principally polarized CM abelian schemes. Assuming n is prime to the class number of K, we show that Serre's tensor construction provides an identification of this tensor product with a substack of the moduli space \calM_\Phi^n, and that in some cases, such as when the base is finite type over \CC or an algebraically closed field of characteristic zero, this substack is the entire space. We then use this characterization to describe the Galois action on \calM_\Phi^n(\overline{\QQ}), by using the description of the action on \calM_\Phi^1(\overline{\QQ}) supplied by the main theorem of complex multiplication.

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 points and sets (referred to as blocks) such that each point is a member of r blocks, each block is of size k, and these objects satisfy a linearity criterion: no two blocks intersect in more than one point. A geometric configuration requires that the points and blocks be realized as points and lines within the Euclidean plane. We provide improvements on the current bounds for the asymptotic existence of both combinatorial and geometric configurations. In addition, we examine the largely new problem of embedding configurations within larger configurations possessing regularity properties. Additionally, previously undiscovered geometric [r,k]-configurations are found as near-coverings of combinatorial configurations. / Graduate

No description available.