Related papers: Perfect sets of random reals

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…

We present some Zermelo-Fraenkel consistency results regarding bi-orderability of groups, as well as a construction of groups with Conradian orders whose every action on metric spaces has bounded orbits. A classical consequence of the…

We analyse the Boolean-valued random forcing $B_{M,\Omega}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in…

We say that a real X is n-generic relative to a perfect tree T if X is a path through T and for all Sigma^0_n (T) sets S, there exists a number k such that either X|k is in S or for all tau in T extending X|k we have tau is not in S. A real…

This paper is an investigation of the relationship between G\"odel's second incompleteness theorem and the well-foundedness of jump hierarchies. It follows from a classic theorem of Spector's that the relation $\{(A,B) \in \mathbb{R}^2 :…

For a digraph $\Gamma$, a subset $C$ of $V(\Gamma)$ is a perfect code if $C$ is a dominating set such that every vertex of $\Gamma$ is dominated by exactly one vertex in $C$. In this paper, we classify strongly connected 2-valent Cayley…

Two-dimensional version of the classical Mycielski theorem says that for every comeager or conull set $X\subseteq [0,1]^2$ there exists a perfect set $P\subseteq [0,1]$ such that $P\times P\subseteq X\cup \Delta$. We consider…

A classical theorem due to Mycielski states that an equivalence relation $E$ having the Baire property and meager equivalence classes must have a perfect set of pairwise inequivalent elements. We consider equivalence relations with…

In this note we provide a counter-example to a conjecture of K. Pardue [Thesis, Brandeis University, 1994.], which asserts that if a monomial ideal is $p$-Borel-fixed, then its $\naturals$-graded Betti table, after passing to any field does…

Given a graph $G = (V,E)$, a \emph{perfect dominating set} is a subset of vertices $V' \subseteq V(G)$ such that each vertex $v \in V(G)\setminus V'$ is dominated by exactly one vertex $v' \in V'$. An \emph{efficient dominating set} is a…

Recognizing when a ring is a complete matrix ring is of significant importance in algebra. It is well-known folklore that a ring $R$ is a complete $n\times n$ matrix ring, so $R\cong M_{n}(S)$ for some ring $S$, if and only if it contains a…

Let $\gamma(G)$ and $\beta(G)$ denote the domination number and the covering number of a graph $G$, respectively. A connected non-trivial graph $G$ is said to be $\gamma\beta$-{perfect} if $\gamma(H)=\beta(H)$ for every non-trivial induced…

We show that $ZF+DC+$"all Turing invariant sets of reals have the perfect set property" implies that all sets of reals have the perfect set property. We also show that this result generalizes to all countable analytic equivalence relations.

We prove that the statement `For all Borel ideals I and J on $\omega$, every isomorphism between Boolean algebras $P(\omega)/I$ and $P(\omega)/J$ has a continuous representation' is relatively consistent with ZFC. In this model every…

Let $G$ be a graph without isolated vertices. The total domination number of $G$ is the minimum number of vertices that can dominate all vertices in $G$, and the paired domination number of $G$ is the minimum number of vertices in a…

We show that the set of Liouville numbers is either null or non-$\sigma$-finite with respect to every translation invariant Borel measure on $\RR$, in particular, with respect to every Hausdorff measure $\iH^g$ with gauge function $g$. This…

All spaces are assumed to be separable and metrizable. Our main result is that the statement "For every space $X$, every closed subset of $X$ has the perfect set property if and only if every analytic subset of $X$ has the perfect set…

We prove that if $\vec{R}$ is a computable sequence of subsets of $\omega$ which admits no computable cohesive set, then no 3-generic computes any $\vec{R}$-cohesive set; and there exists a Martin-L\"{o}f random which computes no…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…