Related papers: Lusin sequences under CH and under Martin's Axiom
A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering…
Given a sequence of n numbers, the Maximum Consecutive Subsums Problem (MCSP) asks for the maximum consecutive sum of lengths l for each l = 1,...,n. No algorithm is known for this problem which is significantly better than the naive…
An {\it Omnibus Sequence} of length $n$ is one that has each possible "message" of length $k$ embedded in it as a subsequence. We study various properties of Omnibus Sequences in this paper, making connections, whenever possible, to the…
An asymptotic formula is presented for the number of planar lattice convex polygonal lines joining the origin to a distant point of the diagonal. The formula involves the non-trivial zeros of the zeta function and leads to a necessary and…
We construct a generic extension of $L$ satisfying Martin's Axiom, $2^{\aleph_0}=\aleph_3$, a lightface $\Delta^1_3$ wellorder of the reals, and $\Sigma^1_n$-uniformization for every $n\geq 2$ simultaneously.
It is shown that the independence of the continuum hypothesis points to the unique definite status of the set of intermediate cardinality: the intermediate set exists only as a subset of continuum. This latent status is a consequence of…
In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
In this paper we prove that every collection of measurable functions $f_\alpha$, $|\alpha|=m$ coincides a.e. with $m$th order derivatives of a function $g\in C^{m-1}$ whose derivatives of order $m-1$ may have any modulus of continuity…
We prove the following consistency result for cardinal sequences of length $< \om_3$: if GCH holds and $\la \geq \om_2$ is a regular cardinal, then in some cardinal-preserving generic extension $2^{\om} = \la$ and for every ordinal $\eta <…
The longest square subsequence (LSS) problem consists of computing a longest subsequence of a given string $S$ that is a square, i.e., a longest subsequence of form $XX$ appearing in $S$. It is known that an LSS of a string $S$ of length…
We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing math.LO/0406440. If |A|+|T|<= mu, I subseteq C, |I| >=beth_{|T|^+}(mu) then some J subseteq I of cardinality mu^+ is an…
Recently Greg Martin derived an interesting formula for the least common multiple of {1,2,...,n}. Here, we give an exposition of a concise proof in terms of the sine function.
We introduce the notion of indivisible sequences and show that to any indivisible sequence $\{S, \Psi: S \to R\}$ we can associate faithfully flat ring maps $R \to R'$ that are not descendable. As a corollary, we obtain the first example of…
Assume $\mathcal{C}$ is the class of all linear orders $L$ such that $L$ is not a countable union of well ordered sets, and every uncountable subset of $L$ contains a copy of $\omega_1$. We show it is consistent that $\mathcal{C}$ has…
The halting probability of a Turing machine is the probability that the machine will halt if it starts with a random stream written on its one-way input tape. When the machine is universal, this probability is referred to as Chaitin's omega…
We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…
It is proved that there exists an (omega-1,omega-1) Souslin gap in the Boolean algebra (L(nu)/Fin,subseteq^*_ae) for every nonseparable measure nu. Thus a Souslin, also known as destructible, (omega-1,omega-1) gap in P(N)/Fin can always be…
For any composant $E \subset \mathbb H^*$ and corresponding near-coherence class $\mathscr E \subset \omega^*$ we prove the following are equivalent : (1) $E$ properly contains a dense semicontinuum. (2) Each countable subset of $E$ is…
We study projective stationary sets. The Projective Stationary Reflection principle is the statement that every projective stationary set contains an increasing continuous $\in$--chain of length $\omega_1$. We show that if Martin's Maximum…