Search
Now showing items 11-20 of 30
Finding Cycles In The Kth Power Diagraphs Over Integers Modulo A Prime And Over Gaussian Integers Modulo a Gaussian Prime (thesis)
Given Zp where p is an integer prime, let's de ne G(k) p to be the digraph whose set of vertices is Zp such that there is a directed edge from a vertex a to a vertex b if ak b mod p. First, we nd our own way to decide ...
Permutation Formula (thesis)
Runs in permutations and similar topics have been studied by various authors under different names. Hegarty examined permutations of finite abelian groups which avoid what he called progressions. Riordan studied 3-runs ...
Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)
This is the fourth and nal
thesis that concludes ProfessorWayne M. Dymacek's research project Realizability
of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity,
Minimum Degree, and Maximum Degree. ...
Arithmetic Progressions in Permutations (thesis)
In this thesis we will examine progressions in permutations. We will analyze regular and circular permutations with progressions either modular or regular with rise one or two. We will calculate the number of permutations ...
On the Realizability of Projective Configurations (thesis)
Many natural questions emerge from the work of this thesis. The first chapter may inspire a budding mathematician to work (in the fashion of my thesis advisor) on area relations and equidissections. From the second chapter, ...
Norms of Composition Operators on the Hardy Space
This thesis covers Hilbert spaces, Hardy spaces, their properties, and composition operators.
Chaos and the Dynamics of Quadratic Mappings
The immediate aim of this paper is to systematically investigate dynamical systems governed by a certain class of difference equations. The results obtained do not, however, constitute an isolated piece in a sprawling ...
An Elementary Theorem-Proving Program
My goal is to write a theorem-proving assistant that can , to s ome extent, take a hypothesis (that works on IF-THEN rules) and make some progress toward a realizable goal. However, since I need a more concrete problem ...
Compressions of Linear Operators Yielding a Single Point Numerical Range
This thesis will focus on finding subspaces M such that the compression of T to M, denoted TM, has a single point numerical range. . . . The motivation for finding such subspaces lies in a theorem from quantum coding ...