Related papers: Arcs in the Plane

We show that there exists $0<\alpha_0<1$ (depending on the parameters) such that the fractal percolation is almost surely purely $\alpha$-unrectifiable for all $\alpha>\alpha_0$.

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…

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions.…

We make use of a finite support product of $\omega_1$ clones of the Jensen minimal $\varPi^1_2$ singleton forcing to obtain a model of ZFC in which every non-empty lightface analytically definable set of reals contains a lightface…

In [DJL07] it was shown that if A is an affine hyperplane arrangement in C^n, then at most one of the L^2-Betti numbers of its complement is non--zero. We will prove an analogous statement for complements of any algebraic curve in C^2.…

We show that it is consistent with ZFC that there is a simple nuclear non-separable C*-algebra which is not isomorphic to its opposite algebra. We can furthermore guarantee that this example is an inductive limit of unital copies of the…

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…

We investigate the set I(f) of points that converge to infinity under iteration of the map f(z) = e^z-1 and show that it is the disjoint union of countably many rays and uncountable union of infinite sets whose points escape to infinity…

A graph is 1-planar if it has a drawing where each edge is crossed at most once. A drawing is RAC (Right Angle Crossing) if the edges cross only at right angles. The relationships between 1-planar graphs and RAC drawings have been partially…

Using a modification of the invariant Jensen forcing, we define a model of ZFC, in which, for a given $n\ge3$, there exists a lightface $\varPi^1_n$ set of reals, which is a ${\mathsf E}_0$ equivalence class, hence a countable set, and…

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

Let ${\mathcal A}$ be a nonempty real central arrangement of hyperplanes and ${\rm \bf Ch}$ be the set of chambers of ${\mathcal A}$. Each hyperplane $H$ defines a half-space $H^{+} $ and the other half-space $H^{-}$. Let $B = \{+, -\}$.…

What sets A \subset Z^n can be written in the form (K-K) \cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely…

We show, for several fake projective planes with nontrivial automorphism group, that the bicanonical map is an embedding.

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…

An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is an L-shape, and every edge is either…

Classical theory proves that every primitive recursive function is strongly representable in PA; that formal Peano Arithmetic, PA, and formal primitive recursive arithmetic, PRA, can both be interpreted in Zermelo-Fraenkel Set Theory, ZF;…