Related papers: Uncountable strongly surjective linear orders
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a…
We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
We extend a dichotomy between 1-basedness and supersimplicity proved in a previous paper. The generalization we get is to arbitrary language, with no restrictions on the topology (we do not demand type-definabilty of the open set in the…
We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular…
We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
We study analytic and Borel subsets defined similarily to the old example of analytic complete set given by Luzin. Luzin's example, which is essentially a subset of the Baire space, is based on the natural partial order on naturals, i.e.…
We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…
Recently, Liu, Moursi and Vanderwerff have introduced the class of super strongly nonexpansive mappings as a counterpart to operators which are maximally monotone and uniformly monotone. We give a quantitative study of these notions in the…
For k>=3 let A \subset [1,N] be a set not containing a solution to a_1 x_1+...+a_k x_k=a_1 x_{k+1}+...+a_k x_{2k} in distinct integers. We prove that there is an epsilon>0 depending on the coefficients of the equation such that every such A…
We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…
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…
Assuming the existence of a proper class of supercompact cardinals, we force that for every regular cardinal $\kappa$, there are $\kappa^+$-Aronszajn trees and all such trees are special.
The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…
If ZFC is consistent, then each of the following are consistent with ZFC + 2^{{aleph_0}}= aleph_2 : 1.) X subseteq R is of strong measure zero iff |X| <= aleph_1 + there is a generalized Sierpinski set. 2.) The union of aleph_1 many strong…
A space is called linearly H-closed iff any chain cover possesses a dense member. This property lies strictly between feeble compactness and H-closedness. While regular H-closed spaces are compact, there are linearly H-closed spaces which…
A class of acyclic digraphs $\mathscr{C}$ is linearly unavoidable if there exists a constant $c$ such that every digraph $D\in \mathscr{C}$ is contained in all tournaments of order $c\cdot |V(D)|$. The class of all acyclic digraphs is not…
We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…
The classical Baldwin-Lachlan characterization of uncountably categorical theories is known to fail in continuous logic in that not every inseparably categorical theory has a strongly minimal set. Here we investigate these issues by…