Boundedness and convergence of singular integrals on fractal type sets

The topic of this dissertation lies in the intersection of harmonic analysis and fractal geometry. We particulary consider singular integrals in Euclidean spaces with respect to general measures, and we study how the geometric structure of the measures affects certain analytic properties of the operators. The thesis consists of three research articles and an overview. In the first article we construct singular integral operators on lower dimensional Sierpinski gaskets associated with homogeneous Calderón-Zygmund kernels. While these operators are bounded their principal values fail to exist almost everywhere. Conformal iterated function systems generate a broad range of fractal sets. In the second article we prove that many of these limit sets are porous in a very strong sense, by showing that they contain holes spread in every direction. In the following we connect these results with singular integrals. We exploit the fractal structure of these limit sets, in order to establish that singular integrals associated with very general kernels converge weakly. Boundedness questions consist a central topic of investigation in the theory of singular integrals. In the third article we study singular integrals of different measures. We prove a very general boundedness result in the case where the two underlying measures are separated by a Lipshitz graph. As a consequence we show that a certain weak convergence holds for a large class of singular integrals.

On Games on Non-Wellfounded Sets and Stationary Sets

In this thesis we study a few games related to non-wellfounded and stationary sets. Games have turned out to be an important tool in mathematical logic ranging from semantic games defining the truth of a sentence in a given logic to for example games on real numbers whose determinacies have important effects on the consistency of certain large cardinal assumptions. The equality of non-wellfounded sets can be determined by a so called bisimulation game already used to identify processes in theoretical computer science and possible world models for modal logic. Here we present a game to classify non-wellfounded sets according to their branching structure. We also study games on stationary sets moving back to classical wellfounded set theory. We also describe a way to approximate non-wellfounded sets with hereditarily finite wellfounded sets. The framework used to do this is domain theory. In the Banach-Mazur game, also called the ideal game, the players play a descending sequence of stationary sets and the second player tries to keep their intersection stationary. The game is connected to precipitousness of the corresponding ideal. In the pressing down game first player plays regressive functions defined on stationary sets and the second player responds with a stationary set where the function is constant trying to keep the intersection stationary. This game has applications in model theory to the determinacy of the Ehrenfeucht-Fraisse game. We show that it is consistent that these games are not equivalent.

Molecular Tuning of Rhodopsins for High Visual Sensitivity in Different Light Environments : Variation in Absorbance Spectrum and Opsin Sequence within and between Species

Visual pigments of different animal species must have evolved at some stage to match the prevailing light environments, since all visual functions depend on their ability to absorb available photons and transduce the event into a reliable neural signal. There is a large literature on correlation between the light environment and spectral sensitivity between different fish species. However, little work has been done on evolutionary adaptation between separated populations within species. More generally, little is known about the rate of evolutionary adaptation to changing spectral environments. The objective of this thesis is to illuminate the constraints under which the evolutionary tuning of visual pigments works as evident in: scope, tempo, available molecular routes, and signal/noise trade-offs. Aquatic environments offer Nature s own laboratories for research on visual pigment properties, as naturally occurring light environments offer an enormous range of variation in both spectral composition and intensity. The present thesis focuses on the visual pigments that serve dim-light vision in two groups of model species, teleost fishes and mysid crustaceans. The geographical emphasis is in the brackish Baltic Sea area with its well-known postglacial isolation history and its aquatic fauna of both marine and fresh-water origin. The absorbance spectrum of the (single) dim-light visual pigment were recorded by microspectrophotometry (MSP) in single rods of 26 fish species and single rhabdoms of 8 opossum shrimp populations of the genus Mysis inhabiting marine, brackish or freshwater environments. Additionally, spectral sensitivity was determined from six Mysis populations by electroretinogram (ERG) recording. The rod opsin gene was sequenced in individuals of four allopatric populations of the sand goby (Pomatoschistus minutus). Rod opsins of two other goby species were investigated as outgroups for comparison. Rod absorbance spectra of the Baltic subspecies or populations of the primarily marine species herring (Clupea harengus membras), sand goby (P. minutus), and flounder (Platichthys flesus) were long-wavelength-shifted compared to their marine populations. The spectral shifts are consistent with adaptation for improved quantum catch (QC) as well as improved signal-to-noise ratio (SNR) of vision in the Baltic light environment. Since the chromophore of the pigment was pure A1 in all cases, this has apparently been achieved by evolutionary tuning of the opsin visual pigment. By contrast, no opsin-based differences were evident between lake and sea populations of species of fresh-water origin, which can tune their pigment by varying chromophore ratios. A more detailed analysis of differences in absorbance spectra and opsin sequence between and within populations was conducted using the sand goby as model species. Four allopatric populations from the Baltic Sea (B), Swedish west coast (S), English Channel (E), and Adriatic Sea (A) were examined. Rod absorbance spectra, characterized by the wavelength of maximum absorbance (λmax), differed between populations and correlated with differences in the spectral light transmission of the respective water bodies. The greatest λmax shift as well as the greatest opsin sequence difference was between the Baltic and the Adriatic populations. The significant within-population variation of the Baltic λmax values (506-511 nm) was analyzed on the level of individuals and was shown to correlate well with opsin sequence substitutions. The sequences of individuals with λmax at shorter wavelengths were identical to that of the Swedish population, whereas those with λmax at longer wavelengths additionally had substitution F261F/Y in the sixth transmembrane helix of the protein. This substitution (Y261) was also present in the Baltic common gobies and is known to redshift spectra. The tuning mechanism of the long-wavelength type Baltic sand gobies is assumed to be the co-expression of F261 and Y261 in all rods to produce ≈ 5 nm redshift. The polymorphism of the Baltic sand goby population possibly indicates ambiguous selection pressures in the Baltic Sea. The visual pigments of all lake populations of the opossum shrimp (Mysis relicta) were red-shifted by 25 nm compared with all Baltic Sea populations. This is calculated to confer a significant advantage in both QC and SNR in many humus-rich lakes with reddish water. Since only A2 chromophore was present, the differences obviously reflect evolutionary tuning of the visual protein, the opsin. The changes have occurred within the ca. 9000 years that the lakes have been isolated from the Sea after the most recent glaciation. At present, it seems that the mechanism explaining the spectral differences between lake and sea populations is not an amino acid substitution at any other conventional tuning site, but the mechanism is yet to be found.

Accuracy of absorbed dose in external photon beam radiotherapy : what level is sufficient and how to approach it?

Radiation therapy (RT) plays currently significant role in curative treatments of several cancers. External beam RT is carried out mostly by using megavoltage beams of linear accelerators. Tumor eradication and normal tissue complications correlate to dose absorbed in tissues. Normally this dependence is steep and it is crucial that actual dose within patient accurately correspond to the planned dose. All factors in a RT procedure contain uncertainties requiring strict quality assurance. From hospital physicist´s point of a view, technical quality control (QC), dose calculations and methods for verification of correct treatment location are the most important subjects. Most important factor in technical QC is the verification that radiation production of an accelerator, called output, is within narrow acceptable limits. The output measurements are carried out according to a locally chosen dosimetric QC program defining measurement time interval and action levels. Dose calculation algorithms need to be configured for the accelerators by using measured beam data. The uncertainty of such data sets limits for best achievable calculation accuracy. All these dosimetric measurements require good experience, are workful, take up resources needed for treatments and are prone to several random and systematic sources of errors. Appropriate verification of treatment location is more important in intensity modulated radiation therapy (IMRT) than in conventional RT. This is due to steep dose gradients produced within or close to healthy tissues locating only a few millimetres from the targeted volume. The thesis was concentrated in investigation of the quality of dosimetric measurements, the efficacy of dosimetric QC programs, the verification of measured beam data and the effect of positional errors on the dose received by the major salivary glands in head and neck IMRT. A method was developed for the estimation of the effect of the use of different dosimetric QC programs on the overall uncertainty of dose. Data were provided to facilitate the choice of a sufficient QC program. The method takes into account local output stability and reproducibility of the dosimetric QC measurements. A method based on the model fitting of the results of the QC measurements was proposed for the estimation of both of these factors. The reduction of random measurement errors and optimization of QC procedure were also investigated. A method and suggestions were presented for these purposes. The accuracy of beam data was evaluated in Finnish RT centres. Sufficient accuracy level was estimated for the beam data. A method based on the use of reference beam data was developed for the QC of beam data. Dosimetric and geometric accuracy requirements were evaluated for head and neck IMRT when function of the major salivary glands is intended to be spared. These criteria are based on the dose response obtained for the glands. Random measurement errors could be reduced enabling lowering of action levels and prolongation of measurement time interval from 1 month to even 6 months simultaneously maintaining dose accuracy. The combined effect of the proposed methods, suggestions and criteria was found to facilitate the avoidance of maximal dose errors of up to even about 8 %. In addition, their use may make the strictest recommended overall dose accuracy level of 3 % (1SD) achievable.

Playing Games on Sets and Models

The most prominent objective of the thesis is the development of the generalized descriptive set theory, as we call it. There, we study the space of all functions from a fixed uncountable cardinal to itself, or to a finite set of size two. These correspond to generalized notions of the universal Baire space (functions from natural numbers to themselves with the product topology) and the Cantor space (functions from natural numbers to the {0,1}-set) respectively. We generalize the notion of Borel sets in three different ways and study the corresponding Borel structures with the aims of generalizing classical theorems of descriptive set theory or providing counter examples. In particular we are interested in equivalence relations on these spaces and their Borel reducibility to each other. The last chapter shows, using game-theoretic techniques, that the order of Borel equivalence relations under Borel reduciblity has very high complexity. The techniques in the above described set theoretical side of the thesis include forcing, general topological notions such as meager sets and combinatorial games of infinite length. By coding uncountable models to functions, we are able to apply the understanding of the generalized descriptive set theory to the model theory of uncountable models. The links between the theorems of model theory (including Shelah's classification theory) and the theorems in pure set theory are provided using game theoretic techniques from Ehrenfeucht-Fraïssé games in model theory to cub-games in set theory. The bottom line of the research declairs that the descriptive (set theoretic) complexity of an isomorphism relation of a first-order definable model class goes in synch with the stability theoretical complexity of the corresponding first-order theory. The first chapter of the thesis has slightly different focus and is purely concerned with a certain modification of the well known Ehrenfeucht-Fraïssé games. There we (me and my supervisor Tapani Hyttinen) answer some natural questions about that game mainly concerning determinacy and its relation to the standard EF-game

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.