Pure Mathematics
http://hdl.handle.net/10012/9932
2019-06-18T13:38:03Z
2019-06-18T13:38:03Z
Degrees of Categoricity and the Isomorphism Problem
Mahmoud, Mohammad
http://hdl.handle.net/10012/14753
2019-06-13T02:30:42Z
2019-06-12T00:00:00Z
Degrees of Categoricity and the Isomorphism Problem
Mahmoud, Mohammad
In this thesis, we study notions of complexity related to computable structures.
We first study degrees of categoricity for computable tree structures. We show that, for any computable ordinal $\alpha$, there exists a computable tree of rank $\alpha+1$ with strong degree of categoricity ${\bf 0}^{(2\alpha)}$ if $\alpha$ is finite, and with strong degree of categoricity ${\bf 0}^{(2\alpha+1)}$ if $\alpha$ is infinite. For a computable limit ordinal $\alpha$, we show that there is a computable tree of rank $\alpha$ with strong degree of categoricity ${\bf 0}^{(\alpha)}$ (which equals ${\bf 0}^{(2\alpha)}$).
In general, it is not the case that every Turing degree is the degree of categoricity of some structure. However, it is known that every degree that is of a computably enumerable (c.e.) set\ in and above $\mathbf{0}^{(\alpha)}$, for $\alpha$ a successor ordinal, is a degree of categoricity. In this thesis, we include joint work with Csima, Deveau and Harrison-Trainor which shows that every degree c.e.\ in and above $\mathbf{0}^{(\alpha)}$, for $\alpha$ a limit ordinal, is a degree of categoricity. We also show that every degree c.e.\ in and above $\mathbf{0}^{(\omega)}$ is the degree of categoricity of a prime model, making progress towards a question of Bazhenov and Marchuk.
After that, we study the isomorphism problem for tree structures. It follows from our proofs regarding the degrees of categoricity for these structures that, for every computable ordinal $\alpha>0$, the isomorphism problem for trees of rank $\alpha$ is $\Pi_{2\alpha}$-complete.
We also discuss the isomorphism problem for pregeometries in which dependent elements are dense and the closure operator is relatively intrinsically computably enumerable. We show that, if $K$ is a class of such pregeometries, then the isomorphism problem for the class $K$ is $\Pi_3$-hard.
Finally, we study the Turing ordinal.
We observed that the definition of the Turing ordinal has two parts each of which alone can define a specific ordinal which we call the upper and lower Turing ordinals. The Turing ordinal exists if and only if these two ordinals exist and are equal.
We give examples of classes of computable structures such that the upper Turing ordinal is $\beta$ and the lower Turing ordinal is $\alpha$ for all computable ordinals $\alpha<\beta$.
2019-06-12T00:00:00Z
Sidon and Kronecker-like sets in compact abelian groups
Yang, Xu
http://hdl.handle.net/10012/14746
2019-06-08T02:30:21Z
2019-06-07T00:00:00Z
Sidon and Kronecker-like sets in compact abelian groups
Yang, Xu
Let $G$ be a compact abelian group and $\Ga$ be its discrete dual group. In this thesis we study various types of interpolation sets.
A subset $E \subset \Ga$ is Sidon if every bounded function on $E$ can be interpolated by the Fourier transform of a finite complex measure. Sidon sets have been extensively studied, and one significant breakthrough, that Sidonicity is equivalent to proportional quasi-independence, was proved by Bourgain and Pisier during the early 80s. In this thesis we will give a detailed demonstration of Pisier's approach. We also seek for possible extensions of Pisier's theorems. Based on Pisier's techniques, we will show Sidonicity is equivalent to proportional independence of higher degrees and minimal constants.
A subset $E \subset \Ga$ is $\e$-Kronecker if every function on $E$ with range in the unit circle can be interpolated by a continuous character on $\Ga$ with an error of $\e$. We will prove some interesting properties of $\e$-Kronecker sets and give an estimation of the Sidon constant of such sets. Generalizations of Kronecker sets include binary Kronecker sets and $N$-pseudo-Rademacher sets. We compute the binary Kronecker constants of some interesting examples. For $N$-pseudo-Rademacher sets, we give a characterization of such sets, describe their structures and prove the existence of large $N$-pseudo-Rademacher sets.
2019-06-07T00:00:00Z
The Logarithmic Derivative and Model-Theoretic Analysability in Differentially Closed Fields
Jin, Ruizhang
http://hdl.handle.net/10012/14379
2019-01-23T03:30:47Z
2019-01-22T00:00:00Z
The Logarithmic Derivative and Model-Theoretic Analysability in Differentially Closed Fields
Jin, Ruizhang
This thesis deals with internal and analysable types, mainly in the context of the stable theory of differentially closed fields. Two main problems are dealt with: the construction of types analysable in the constants with specific properties, and a criterion for a given analysable type to be actually internal to the constants.
For analysable types, the notion of canonical analyses is introduced. A type has a canonical analysis if all its analyses of shortest length are interalgebraic. Given a finite sequence of ranks, it is constructed, in the theory of differentially closed field, a type analysable in the constants such that it admits a canonical analysis and each step of the analysis is of the given rank. The construction of such a type starts from the well-known example of δ(logδx)=0, whose generic type is analysable in the constants in 2 steps but is not internal to the constants. Along the way, techniques for comparing analyses in stable theories are developed, including in particular the notions of analyses by reductions and by coreductions.
The property of the logδ function is further studied when the following question is raised: given a type internal to the constants, is its preimage under logδ, which is 2-step analysable in the constants, ever internal to the constants? The question is answered positively, and a criterion for when the preimage is indeed internal is proposed. Partial results are proven for this conjectured criterion, namely the cases where the group of automorphisms (the binding group) of the given internal type is additive, multiplicative, or trivial. In particular, the conjecture is resolved for generic types of equations of the form δx=f(x) where f is a rational function over the constants. It is discovered that the related problem where logδ is replaced by δ is significantly different, and the analogue of the conjecture fails in this case.
Also included in this thesis are two examples asked for in the literature: internality of a particular twisted D-group, and a 2-step analysable set with independent fibres.
2019-01-22T00:00:00Z
Compressions of Compact Tuples
Passer, Benjamin
Shalit, Orr
http://hdl.handle.net/10012/14299
2019-01-05T03:30:54Z
2019-03-01T00:00:00Z
Compressions of Compact Tuples
Passer, Benjamin; Shalit, Orr
We study the matrix range of a tuple of compact operators on a Hilbert space and examine the notions of minimal, nonsingular, and fully compressed tuples. In this pursuit, we refine previous results by characterizing nonsingular compact tuples in terms of matrix extreme points of the matrix range. Further, we find that a compact tuple A is fully compressed if and only if it is multiplicity-free and the Shilov ideal is trivial, which occurs if and only if A is minimal and nonsingular. Fully compressed compact tuples are therefore uniquely determined up to unitary equivalence by their matrix ranges. We also produce a proof of this fact which does not depend on the concept of nonsingularity.
The final publication is available at Elsevier via https://doi.org/10.1016/j.laa.2018.12.002. © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
2019-03-01T00:00:00Z