This dissertation is in the area of complex dynamics, more specifically focused on the iteration of rational functions. Given a well-chosen family of rational functions, parameterized by a complex parameter, we are especially interested in regularity properties of the Hausdorff dimension of Julia sets of these polynomials considered as a function of the parameters. In this dissertation I deal with a family of polynomials of degree at least 3 depending in a holomorphic way on a parameter, focusing on the point where the dynamics and topology of the polynomials drastically change. In such a context proving continuity is quite challenging while real analyticity will most likely break. Our approach will, on the one hand, build on the existing methods of proving continuity of Hausdorff dimension, primarily based on proving continuity, in the weak* topology of measures on the Riemann sphere, of canonical conformal measures, but will also require methods which, up to my best knowledge, have not been implemented anywhere yet. Our main result gives a surprising example where the Hausdorff dimension of the Julia set is continuous in the parameter, but where the Julia set itself is not.

In geometry we will consider n-dimensional generalizations of the Power of a Point Theorem and of Pascal's Hexagon Theorem. In generalizing the Power of a Point Theorem, we will consider collections of cones determined by the intersections of an (n-1)-sphere and a pair of hyperplanes. We will then use these constructions to produce an n-dimensional generalization of Pascal's Hexagon Theorem, a classical plane geometry result which states that "Given a hexagon inscribed in a conic section, the three pairs of continuations of opposite sides meet on a straight line." Our generalization of this theorem will consider a pair of n-simplices intersecting an (n-1)-sphere, and will conclude with the intersections of corresponding faces lying in a hyperplane. In graph theory we will explore the interaction between zero forcing and cut-sets. The color change rule which lies at the center of zero forcing says "Suppose that each of the vertices of a graph are colored either blue or white. If u is a blue vertex and v is its only white neighbor, then u can force v to change to blue." The concept of zero forcing was introduced by the AIM Minimum Rank - Special Graphs Work Group in 2007 as a …

Graded Hecke algebras are deformations of skew group algebras which arise from a group acting on a polynomial ring. Over fields of characteristic zero, these deformations have been studied in depth and include both symplectic reflection algebras and rational Cherednik algebras as examples. In Lusztig's graded affine Hecke algebras, the action of the group is deformed, but not the commutativity of the vectors. In Drinfeld's Hecke algebras, the commutativity of the vectors is deformed, but not the action of the group. Lusztig's algebras are all isomorphic to Drinfeld's algebras in the nonmodular setting. We find new deformations in the modular setting, i.e., when the characteristic of the underlying field divides the order of the group. We use Poincare-Birkhoff-Witt conditions to classify these deformations arising from the symmetric group acting on a polynomial ring in arbitrary characteristic, including the modular case.

As soon as Bennett and Gill first demonstrated that, relative to a randomly chosen oracle, P is not equal to NP with probability 1, the random oracle hypothesis began piquing the interest of mathematicians and computer scientists. This was quickly disproven in several ways, most famously in 1992 with the result that IP equals PSPACE, in spite of the classes being shown unequal with probability 1. Here, we propose what could be considered strengthening of the random oracle hypothesis, using a stricter notion of what it means for a set to be 'large'. In particular, we suggest using largeness with respect to the Ramsey forcing notion. In this new context, we demonstrate that the set of oracles separating NP and coNP is 'not small', and obtain similar results for the separation of PSPACE from PH along with the separation of NP from BQP. In a related set of results, we demonstrate that these classes are all of the same descriptive complexity. Finally we demonstrate that this strengthening of the hypothesis turns it into a sufficient condition for unrelativized relationships, at least in the three cases considered here.

The structure and geometry of subspaces of a given Banach space is among the most fundamental questions in Functional Analysis. In 1961, Kadec and Pelczyński pioneered a field of study by analyzing the structures of subspaces and basic sequences in L_p[0,1] under a naturally occurring restriction of p, 2 < p <\infty. They proved that any infinite-dimensional subspace X\subset L_p[0,1] for 2<p<\infty must either be isomorphic to l_2 and complemented in L_p or must contain a complemented subspace which is isomorphic to l_p. Many works since have studied the relationships between the sides of this dichotomy, chiefly by weakening hypotheses on side of the equation to gain stronger assumptions on the other. In this way, Johnson and Odell were able to show in 1974 that if X contains no further subspace which is isomorphic to l_2, then it must embed into l_p. Kalton and Werner further strengthened this result in 1993 by showing that such an embedding must be almost isometric. We start by analyzing the tools and definitions originally introduced in 1961 and define a natural extension to these methods. By analyzing this extension, we provide a constructive and streamlined reproving of Kalton and Werner's theorem: Let X be …

In a stopping rule problem, a real-time player decides to stop or continue at stage n based on the observations up to that stage, but in a k-step look-ahead stopping rule problem, we suppose the player knows k steps ahead. The aim of this Ph.D. dissertation is to study this type of prophet problems for simple random walk, determine the optimal stopping rule and calculate the expected return for them. The optimal one-step look-ahead stopping rule for a finite simple random walk is determined in this work. We also study two infinite horizon stopping rule problems, sum with negative drift problems and discounted sum problems. The optimal one, two and three-step look-ahead stopping rules are introduced for the sum with negative drift problem for simple random walk. We also compare the maximum expected returns and calculate the upper bound for the advantage of the prophet over the decision maker. The last chapter of this dissertation concentrates on the discounted sum problem for simple random walk. Optimal one-step look-ahead stopping rule is defined and lastly we compare the optimal expected return for one-step look-ahead prophet with a real-time decision maker.

In this dissertation we prove some results about the existence of families of Aronszajn trees on successors of regular cardinals which are pairwise not club isomorphic. The history of this topic begins with a theorem of Gaifman and Specker in the 1960s which asserts the existence from ZFC of many pairwise not isomorphic Aronszajn trees. Since that result was proven, the focus has turned to comparing Aronszajn trees with respect to isomorphisms on a club of levels, instead of on the entire tree. In the 1980s Abraham and Shelah proved that the Proper Forcing Axiom implies that any two Aronszajn trees on the first uncountable cardinal are club isomorphic. This theorem was generalized to higher cardinals in recent work of Krueger. Abraham and Shelah also proved that the opposite holds under diamond principles. In this dissertation we address the existence of pairwise not club isomorphic Aronszajn trees on higher cardinals from a variety of cardinal arithmetic and diamond principle assumptions. For example, on the successor of a regular cardinal, assuming GCH and the diamond principle on the critical cofinality, there exists a large collection of special Aronszajn trees such that any two of them do not contain club isomorphic subtrees.

We proved that the topological conjugacy relation on $T_1$, a subclass of Toeplitz subshifts, is hyperfinite, extending Kaya's result that the topological conjugate relation of Toeplitz subshifts with growing blocks is hyperfinite. A close concept about the topological conjugacy is the flip conjugacy, which has been broadly studied in terms of the topological full groups. Particularly, we provided an equivalent characterization on Toeplitz subshifts with single hole structure to be flip invariant.