Related papers: Lusin sequences under CH and under Martin's Axiom

It is shown that any Banach space X of sufficiently large density contains an (infinite) unconditional sequence and a separable quotient. If a density of X is a weakly compact cardinal, then X contains an unconditional sequence of…

We prove a $C^m$ Lusin approximation theorem for horizontal curves in the Heisenberg group. This states that every absolutely continuous horizontal curve whose horizontal velocity is $m-1$ times $L^1$ differentiable almost everywhere…

Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach…

It is shown that the existence of a measurable cardinal is equiconsistent to a model of ZFC in which there is no ordinal-definable, stationary, costationary subset of $\omega_1$

We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side-by-side product of partial orders which we call…

In this paper, among other things, we prove that any subset of $\overline{\mathbb{Q}}^m$ (closed under complex conjugation and which contains the origin) is the exceptional set of uncountable many transcendental entire functions over…

In this short paper, I recall the history of dealing with the lack of compactness of a sequence in the case of an unbounded domain and prove the vanishing Lions-type result for a sequence of Lebesgue-measurable functions. This lemma…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

We show that the analytic continuations of Helson zeta functions $ \zeta_\chi (s)= \sum_1^{\infty}\chi(n)n^{-s} $ can have essentially arbitrary poles and zeroes in the strip $ 21/40 < \Re s < 1 $ (unconditionally), and in the whole…

A sequence $x_1,\dots,x_n,\dots$ of discrete-valued observations is generated according to some unknown probabilistic law (measure) $\mu$. After observing each outcome, one is required to give conditional probabilities of the next…

We prove an L^1 subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L^1-good sequences nearly as sparse as the set of squares. In the process, we prove that…

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…

Let $S = \{q_1, \ldots , q_s\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \ldots q_s^{r_s} M$, where $r_1, \ldots , r_s$ are non-negative integers and $M$ is an integer relatively…

Let $\ell_m$ be a sequence of $m$ points on a line with consecutive points of distance one. For every natural number $n$, we prove the existence of a red/blue-coloring of $\mathbb{E}^n$ containing no red copy of $\ell_2$ and no blue copy of…

We introduce an iteration of forcing notions satisfying the countable chain condition with minimal damage to a strong coloring. Applying this method, we prove that Martin's axiom is strictly stronger than its restriction to forcing notions…

Understanding when linear immersions of nonlinear dynamical systems exist is important since such immersions allow us to leverage the rich tools of linear system theory to analyze nonlinear dynamics. Recently, Liu et al. (2023) showed that…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

Let $\Omega$ be a countable infinite product $\Omega^\N$ of copies of the same probability space $\Omega_1$, and let ${\Xi_n}$ be the sequence of the coordinate projection functions from $\Omega$ to $\Omega_1$. Let $\Psi$ be a possibly…

We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We…