相关论文: Lusin sequences under CH and under Martin's Axiom
In this paper it is proved that, when $Q$ is a quiver that admits some closure, for any algebraically closed field $K$ and any finite dimensional $K$-linear representation $\mathcal{X}$ of $Q$, if ${\rm Ext}^1_{KQ}(\mathcal{X},KQ)=0$ then…
A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every…
We present a new method to obtain infinite Sidon sequences, based on the discrete logarithm. We construct an infinite Sidon sequence A, with A(x)= x^{\sqrt 2-1+o(1)}. Ruzsa proved the existence of a Sidon sequence with similar counting…
Let $X$ be a compact metric space and let $v$ be a sub-additive capacity defined on $X$. We show that Lusin's theorem with respect to $v$ holds if and only if $v$ is continuous from above.
The paper is concerned with the problem whether a nonseparable Banach space must contain an uncountable set of vectors such that the distances between every two distinct vectors of the set are the same. Such sets are called equilateral. We…
Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…
We deal with a conjectured dichotomy for compact Hausdorff spaces: each such space contains a non-trivial converging omega-sequence or a non-trivial converging omega_1-sequence. We establish that this dichotomy holds in a variety of models;…
We consider Dynkin algebras, these are the hereditary artin algebras of finite representation type. The indecomposable modules for a Dynkin algebra correspond bijectively to the positive roots of a Dynkin diagram. Given a Dynkin algebra…
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…
In this paper, we investigate relationships between $|\seq(A)|$ and $|\Part_{\fin}(A)|$ in the absence of the Axiom of Choice, where $\seq(A)$ is the set of finite sequences of elements in a set $A$ and $\Part_{\fin}(A)$ is the set of…
We show that the composition of omega-series by surreal numbers, or more generally by elements of any confluent field of transseries, is monotonic in its second argument. In particular, omega-series and LE-series interpreted as functions…
Lineability is a property enjoyed by some subsets within a vector space X. A subset A of X is called lineable whenever A contains, except for zero, an infinite dimensional vector subspace. If, additionally, X is endowed with richer…
Kucera and Gacs independently showed that every infinite sequence is Turing reducible to a Martin-Lof random sequence. This result is extended by showing that every infinite sequence S is Turing reducible to a Martin-Lof random sequence R…
A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
For every total recursive time bound $t$, a constant fraction of all compressible (low Kolmogorov complexity) strings is $t$-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of…
Given a string $T$ with length $n$ whose characters are drawn from an ordered alphabet of size $\sigma$, its longest Lyndon subsequence is a longest subsequence of $T$ that is a Lyndon word. We propose algorithms for finding such a…
In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…
We show that if we assume Martin's Axiom, then there exists a nontrivial twisted sum of c_0 and C(K), for every compact space K with finite height and weight at least continuum. This result settles the problem of existence of nontrivial…