arXiv subjects
Publications and source records attributed to Boaz Tsaban.
We give a general method to reduce Hurewicz-type selection hypotheses into standard ones. The method covers the known results of this kind and gives some new ones. Building on that, we show how to derive Ramsey theoretic characterizations for these selection hypotheses.
Contents: 1. Combinatorial and model-theoretical principles related to regularity of ultrafilters and compactness of topological spaces, I; 2. Frechet-Urysohn fans in free topological groups; 3. Packing index of subsets in Polish groups; 4. Symmetric monochromatic subsets in colorings of the Lobachevsky plane; 5. Structural Ramsey theory of metric spaces and topological dynamics of isometry groups; 6. Distinguishing Number of Countable Homogeneous Relational Structures; 7. Indestructible colourings and rainbow Ramsey theorems; 8. Products of Borel subgroups; 9. Selection theorems and treeability; 10. Combinatorial and model-theoretical principles related to regularity of ultrafilters and compactness of topological spaces, IV; 11. A property of Cp[0, 1]; 12. A Dedekind Finite Borel Set; 13. Aronszajn Compacta; 14. A strong antidiamond principle compatible with CH; 15. On the strength of Hausdorff's gap condition; 16. Nonhomogeneous analytic families of trees; 17. Reasonable non-Radon-Nikodym ideals; 18. Continuity and related forcing; 19. An exact Ramsey principle for block sequences; 20. Baire reflection; 21. Tukey classes of ultrafilters on; 22. Countably determined compact abelian groups; 23. A topological reflection principle equivalent to Shelah's Strong Hypothesis; 24. Superfilters, Ramsey theory, and van der Waerden's Theorem.
1. A Wikipedia entry on topological games 2. On a fragment of the universal Baire property for sigma^1_2 sets 3. The coarse classification of homogeneous ultra-metric spaces 4. Ramsey-like embeddings 5. Proper and piecewise proper families of reals 6. Measures and their random reals 7. Obtainable Sizes of Topologies on Finite Sets 8. Spaces of R-places of rational function fields 9. All properties in the Scheepers Diagram are linearly-sigma-additive.
A surprising number of new results in "core" SPM in the last quarter of 2007, and some other beautiful fundamental results are announced.
Contents: 2. Invited contribution: Ultrafilters and small sets 3. Research announcements 3.1. Inverse Systems and I-Favorable Spaces 3.2. Combinatorial and hybrid principles for sigma-directed families of countable sets modulo finite 3.3. A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension 3.4. A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension 3.5. Large continuum, oracles 3.6. Borel hierarchies in infinite products of Polish spaces 3.7. A game for the Borel functions 3.8. On some problems in general topology 4. Problem of the Issue
Contents: 1. Editor's note; 2. Personal impressions from the SPM07 meeting; 3. Research announcements; 3.1. Coloring ordinals by reals; 3.2. Long Borel Hierarchies; 3.3. Rothberger's property in finite powers; 3.4. Special subsets of the reals and tree forcing notions; 3.5. All automorphisms of the Calkin algebra are inner; 3.6. Continuous selections and sigma-spaces; 3.7. On the closure of the diagonal of a T1-space; 3.8. Splitting families and Noetherian type; 3.9. Even more simple cardinal invariants; 3.10. A classification of CO spaces which are continuous images of compact ordered spaces; 4. Problem of the Issue
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of the previously suggested length-based algorithms, that make them applicable to Thompson's group with significant success rates. In particular, this shows that the Shpilrain-Ushakov public key cryptosystem based on Thompson's group is insecure, and suggests that no practical public key cryptosystem based on this group can be secure.
The_Robin_Hood_ game is played as follows: On day i, the Sheriff puts s(i) bags of gold in the cave. On night i, Robin removes r(i) bags from the cave. The game is played for each natural nymber i. Robin wins if each bag which was put in the cave is eventually removed from it; otherwise the Sheriff wins. Gasarch, Golub, and Srinivasan studied the Robin Hood game in the case of random strategies where Robin has no historical memory. We extend their main result to the case of bounded historical memory, and obtain a hierarchy of provably distinct games.
The internal state of the Klimov-Shamir number generator TF-1 consists of four words of size w bits each, whereas its intended strength is 2^{2w}. We exploit an asymmetry in its output function to show that the internal state can be recovered after having 2^w outputs, using 2^{1.5w} operations. For w=32 the attack is practical, but for their recommended w=64 it is only of theoretical interest.
In classical works, Hurewicz and Menger introduced two diagonalization properties for sequences of open covers. Hurewicz found a combinatorial characterization of these notions in terms of continuous images. Recently, Scheepers has shown that these notions are particular cases in a large family of diagonalization schemas. One of the members of this family is weaker than the Hurewicz property and stronger than the Menger property, and it was left open whether it can be characterized combinatorially in terms of continuous images. We give a positive answer. This paper can serve as an exposition of this fascinating subject.
We describe a simple machinery which translates results on algebraic sums of sets of reals into the corresponding results on their cartesian product. Some consequences are: 1. The product of a meager/null-additive set and a strong measure zero/strongly meager set in the Cantor space has strong measure zero/is strongly meager, respectively. 2. Using Scheepers' notation for selection principles: Sfin(Omega,Omega^gp)\cap S1(O,O)=S1(Omega,Omega^gp), and Borel's Conjecture for S1(Omega,Omega) (or just S1(Omega,Omega^gp)) implies Borel's Conjecture. These results extend results of Scheepers and Miller, respectively.
Hurewicz found connections between some topological notions and the combinatorial cardinals b and d. Reclaw gave topological meaning to the definition of the cardinal p. We extend the picture with a topological interpretation of the cardinal t. We compare our notion to the one related to p, and to some other classical notions. This sheds new light on the famous open problem whether p=t.
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation. We show that to a large extent, using the fast generators is as secure as using a randomly chosen generator. On the other hand, we show that if there is some case in which fast generators are less secure, then this could be used by a malicious authority to generate a standard for the Diffie-Hellman key agreement protocol which has a hidden trapdoor.
Whereas the Gerlits-Nagy gamma-property is strictly weaker than the Galvin-Miller strong gamma-property, the corresponding strong notions for the Menger, Hurewicz, Rothberger, Gerlits-Nagy (*), Arkhangel'skii and Sakai properties are equivalent to the original ones. The main result is that almost each of these properties admits the game theoretic characterization suggested by the stronger notion. We also solve a related problem of Kocinac and Scheepers, and answer a question of Iliadis.
A birthday surprise is the event that, given k uniformly random samples from a sample space of size n, at least two of them are identical. We show that Bernoulli numbers can be used to derive arbitrarily exact bounds on the probability of a birthday surprise. This result can be used in arbitrary precision calculators, and it can be applied to better understand some questions in communication security and pseudorandom number generation.
We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the "generic" lattice-ordered group Aut(R) of order automorphisms of the real line. We use these techniques in order to show that for each choice of parameters f,g in Aut(R), the equation xfx=g is effectively solvable in Aut(R).
We study diagonalizations of covers using various selection principles, where the covers are related to linear quasiorderings (tau-covers). This includes: equivalences and nonequivalences, combinatorial characterizations, critical cardinalities and constructions of special sets of reals. This study leads to a solution of a topological problem which was suggested to the author by Scheepers (and stated in an earlier work) and is related to the Minimal Tower problem. We also introduce a variant of the notion of tau-cover, called tau^*-cover, and settle some problems for this variant which are still open in the case of $τ$-covers. This new variant introduces new (and tighter) topological and combinatorial lower bounds on the Minimal Tower problem.
The Hausdorff dimension of a product XxY can be strictly greater than that of Y, even when the Hausdorff dimension of X is zero. But when X is countable, the Hausdorff dimensions of Y and XxY are the same. Diagonalizations of covers define a natural hierarchy of properties which are weaker than ``being countable'' and stronger than ``having Hausdorff dimension zero''. Fremlin asked whether it is enough for X to have the strongest property in this hierarchy (namely, being a gamma-set) in order to assure that the Hausdorff dimensions of Y and XxY are the same. We give a negative answer: Assuming CH, there exists a gamma-set of reals X and a set of reals Y with Hausdorff dimension zero, such that the Hausdorff dimension of X+Y (a Lipschitz image of XxY) is maximal, that is, 1. However, we show that for the notion of a_strong_ gamma-set the answer is positive. Some related problems remain open.