Degree spectra of the successor relation of computable linear orderings

We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees. © 2008 Springer-Verlag

The 2D/3D Best-Fit Problem

In computer systems, the best-fit problem can be described as a search for the best transformation matrix to transform input mea- sured points from their coordinate system into a CAD model coordinate system using a criteria function for optimization. For example, if the criterion is Mini- mum Sum of Deviations, we search for a transformation matrix M that minimizes the sum of all distances from an matrix-transformed measure points to a CAD model

Facial soft tissue thicknesses in Bulgarian adults: relation to sex, body mass index and bilateral asymmetry

Background: The aim of the study is to measure the facial soft tissue thicknesses (STTs) in Bulgarians, to evaluate the relation of the STTs to the nutritional status, sex and bilateral asymmetry, and to examine the correlations between the separate STTs as well as between the STTs and body weight, height, and body mass index (BMI). In the present study, the facial STTs were measured on computed tomography scans of the head of Bulgarian adults. Materials and methods: The STTs were measured at 7 midline and 9 bilateral landmarks. The measurements were performed in the free software InVesalius in the axial and sagittal planes. The mean, standard deviation, minimum and maximum values, median and coefficient of variation were reported for the STT at each landmark according to the sex and BMI category. The BMI, sex and bilateral differences were assessed for statistical significance. Pearson correlation analysis was applied to assess the strength and direction of the relationships between the STTs and body height, weight and BMI, as well as between separate STTs. Results and Conclusions: The facial soft tissues in Bulgarian adults changed in accordance with the nutritional status of the individual and in both sexes all STTs augmented with the increasing BMI. For both normal and overweight BMI categories, males had more soft tissue at the majority of facial points than females, as the only exceptions were observed in the cheek zone, where STTs were thicker in females. Significant bilateral differences were observed in either sex and BMI category. Stronger correlations were established for the STTs in the jaw region and between the cheek and jaw soft tissues. Besides, the correlations between the homologous bilateral landmarks were among the strongest ones

On cohesive powers of linear orders

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals when thought of as linear orders. We investigate the cohesive powers of computable linear orders, with special emphasis on computable copies of $\omega$. If $\mathcal{L}$ is a computable copy of $\omega$ that is computably isomorphic to the standard presentation of $\omega$, then every cohesive power of $\mathcal{L}$ has order-type $\omega + \zeta\eta$. However, there are computable copies of $\omega$, necessarily not computably isomorphic to the standard presentation, having cohesive powers not elementarily equivalent to $\omega + \zeta\eta$. For example, we show that there is a computable copy of $\omega$ with a cohesive power of order-type $\omega + \eta$. Our most general result is that if $X \subseteq \mathbb{N} \setminus \{0\}$ is either a $\Sigma_2$ set or a $\Pi_2$ set, thought of as a set of finite order-types, then there is a computable copy of $\omega$ with a cohesive power of order-type $\omega + \sigma(X \cup \{\omega + \zeta\eta + \omega^*\})$, where $\sigma(X \cup \{\omega + \zeta\eta + \omega^*\})$ denotes the shuffle of the order-types in $X$ and the order-type $\omega + \zeta\eta + \omega^*$. Furthermore, if $X$ is finite and non-empty, then there is a computable copy of $\omega$ with a cohesive power of order-type $\omega + \sigma(X)$

Spectra of high n and non-low n degrees

We survey known results on spectra of structures and on spectra of relations on computable structures, asking when the set of all highn degrees can be such a spectrum, and likewise for the set of non-low n degrees. We then repeat these questions specifically for linear orders and for relations on the computable dense linear order ℚ. New results include realizations of the set of non-low n Turing degrees as the spectrum of a relation on ℚ for all n≥1, and a realization of the set of all non-low n Turing degrees as the spectrum of a linear order whenever n≥2. The state of current knowledge is summarized in a table in the concluding section. © 2010 The Author. Published by Oxford University Press. All rights reserved

Strong jump inversion

© The Author(s) 2018. We say that a structure A admits strong jump inversion provided that for every oracle X, if X' computes D(C)'for some C ≅ A, then X computes D(B) for some B ≅ A. Jockusch and Soare (1991, APAL, 52, 39-64) showed that there are low linear orderings without computable copies, but Downey and Jockusch (1994, PAMS, 122, 871-880) showed that every Boolean algebra admits strong jump inversion. More recently, D. Marker and R. Miller (2017, JSL, 82, 1-25) have shown that all countable models of DCF0 (the theory of differentially closed fields of characteristic 0) admit strong jump inversion. We establish a general result with sufficient conditions for a structure A to admit strong jump inversion. Our conditions involve an enumeration of B1-types, where these are made up of formulas that are Boolean combinations of existential formulas. Our general result applies to some familiar kinds of structures, including some classes of linear orderings and trees. We do not get the result of Downey and Jockusch for arbitrary Boolean algebras, but we do get a result for Boolean algebras with no 1-atom, with some extra information on the complexity of the isomorphism. Our general result gives the result of Marker and Miller. In order to apply our general result, we produce a computable enumeration of the types realized in models of DCF0. This also yields the fact that the saturated model of DCF0 has a decidable copy

Degree spectra of the successor relation of computable linear orderings

We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees. © 2008 Springer-Verlag