Related papers: Lusin sequences under CH and under Martin's Axiom
It is proved the existence of large algebraic structures \break --including large vector subspaces or infinitely generated free algebras-- inside, among others, the family of Lebesgue measurable functions that are surjective in a strong…
We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such as the full transformation semigroups, the general linear semigroups, and the semigroups of order-preserving transformations of finite…
Define (*) There exists $(\phi_n:\omega_1\to \omega_1:n<\omega)$ such that for every uncountable $I$ which is a subset of $\omega_1$ there exists $n$ such that $\phi_n$ maps $I$ onto $\omega_1$. This is roughly what Sierpinski in his book…
For each vector $x\in \ell^{\infty}$, we can define the non-empty compact set $L_x$ of accumulation points of $x$. Given an infinite subset $A$ of $\mathbb{N}\backslash\{1\}$, we can therefore investigate under which conditions on $A$, the…
If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length…
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least $k$ length substrings. First, we show an $O(mn)$ time algorithm for the problem which gives a…
It is shown that Martin's Axiom for sigma-centred partial orders implies that every maximal orthogonal family in R^N is of size 2^{aleph_0}
We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position every letter of the alphabet may occur with some probability.…
An increasing sequence of positive integers $(n_k)_{k\ge 0}$ is said to be a Jamison sequence if the following property holds true: for every separable complex Banach space $X$ and every $T\in \mathcal{B}(X)$ which is partially…
Let G be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of G is polycyclic. Then the claim is made that any solvable subgroup of G is separable. This is proven for G=SL_n(Z).…
We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…
We study properties of !-limit sets of multivalued semiflows like chain recurrence or the existence of cyclic chains. First, we prove that under certain conditions the omega-limit set of a trajectory is chain recurrent, applying this result…
In this short note we show that if we add predicate for a dense complete indiscernible sequence in a dependent theory then the result is still dependent. This answers a question of Baldwin and Benedikt and implies that every unstable…
We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…
In the paper "Randomizations of Scattered Sentences", Keisler showed that if Martin's axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone.…
We define a countable family of sequences of points in the unit square: the {\it $LS$-sequences of points \`a la Halton}. They reveal a very strange and interesting behaviour, as well as resonance phenomena, for which we have not found an…
We construct an indecomposable continuum with exactly one strong non-cut point. The method is an adaptation of Bellamy $[1]$. We start with an $\omega_1$-chain of indecomposable metric continua and retractions. The inverse limit is an…