Related papers: A Rigid Kurepa Tree From a Free Suslin Tree
We consider a class of compacta X such that the maps from X onto metric compacta define an Aronszajn tree of closed subsets of X.
We find sufficient conditions under which the product of spaces that have a $\pi$-tree also has a $\pi$-tree. These conditions give new examples of spaces with a $\pi$-tree: every at most countable power of the Sorgenfrey line and every at…
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…
The ellipsoidal superpotential of the complex projective plane can be interpreted as a count of rigid rational plane curves of a given degree with one prescribed cusp singularity. In this note we present a closed formula for these counts as…
Starting from the existence of a weakly compact cardinal, we build a generic extension of the universe in which $GCH$ holds and all $\aleph_2$-Aronszajn trees are special and hence there are no $\aleph_2$-Souslin trees. This result answers…
Let R be a complete discrete valuation ring of mixed characteristics (0,p). Given an order p-automorphism of a formal disc (or annulus) over R, we describe the minimal semi-stable model for which the specialisations of fixed points are…
The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa$ is…
Tree data are ubiquitous because they model a large variety of situations, e.g., the architecture of plants, the secondary structure of RNA, or the hierarchy of XML files. Nevertheless, the analysis of these non-Euclidean data is difficult…
By an omega_1 --tree we mean a tree of power omega_1 and height omega_1. We call an omega_1 --tree a Jech--Kunen tree if it has kappa --many branches for some kappa strictly between omega_1 and 2^{omega_1}. In this paper we construct the…
We discuss Suslin's singular homology and cohomology. In the first half we examine the p-part in characteristic p, and the situation over non-algebraically closed fields. In the second half we focus on finite base fields. We study finite…
We present several results that rely on arguments involving the combinatorics of "bushy trees". These include the fact that there are arbitrarily slow-growing diagonally noncomputable (DNC) functions that compute no Kurtz random real, as…
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…
We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…
We show that under certain circumstances wide Aronszajn trees can be specialized iteratively without adding reals. We then use this fact to study forcing axioms compatible with CH and list some open problems.
The recursion tree resulting from Karatsuba's formula is built here by using an interleaved splitting scheme rather than the traditional left/right one. This allows an easier access to the nodes of the tree and $2n-1$ of them are initially…
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
We provide a sufficient condition under which a closed subgroup of a restricted free pro-p product is itself a free pro-p product.
We extend the concept of genuine rigidity of submanifolds by allowing mild singularities, mainly to obtain new global rigidity results and unify the known ones. As one of the consequences, we simultaneously extend and unify Sacksteder and…
The ability to adequately model risks is crucial for insurance companies. The method of "Copula-based hierarchical risk aggregation" by Arbenz et al. offers a flexible way in doing so and has attracted much attention recently. We briefly…
We study the compressed representation of a ranked tree by a (string) straight-line program (SLP) for its preorder traversal, and compare it with the well-studied representation by straight-line context free tree grammars (which are also…