Now showing items 1-13 of 13

• #### 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 ...
• #### Exploring Extreme Points and Related Properties of Tsirelson Space (thesis) ﻿

Tsirelson space was constructed in 1974 as the first example of a Banach space without an embedded c0 or lp space. In 1989, Casazza and Shura wrote a book Tsirelson's Space devoted to Tsirelson space and its many properties. ...
• #### 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 ...

• #### Periods of Linearly Recurring Sequences (thesis) ﻿

In this thesis, we investigate sequences defined by linear recurrence relations. These are sequences whose subsequent terms are generated using some linear combination of the previous terms. We call the equation that ...
• #### 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) ﻿

Our work continues a long tradition in graph theory studying the relation- ship between vertex connectivity, edge connectivity, and minimum degree. [From Introduction]
• #### 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. ...

• #### Steinhaus graphs and pendent vertices (thesis) ﻿

Steinhaus graphs have many interesting properties, yet there are many things about them that are not yet known. In , a formula was discovered for the total number of Steinhaus graphs on 11 vertices with at least one ...

• #### Towards an Automated and Customizable Linear Cryptanalysis of Substitution-Permutation Network Cipher (thesis) ﻿

The increasing scale of the Internet of Things exposes the proprietors and users to a number of security threats in terms of invasion of privacy, identity thefts and the like. It is therefore absolutely necessary that the ...
• #### Up-growing On-line Linear Discrepancy of Triple-optimal Partially Ordered Sets (thesis) ﻿

Whether we acknowledge it as a poset or not, posets arise in many natural contexts, and many also seem to warrant linear extensions (or rankings) of the poset. In some sense, the linear discrepancy of a linear extension L ...