Related papers: On intermediate extensions of generic extensions b…
In this paper, we study the summability properties of double sequences of real constants which map sequences of random variables to sequences of random variables that are defined on the same probability sample space. We show that a regular…
We prove that if $\bI$ is a p.\ o. set in a countable transitive model $\gM$ of $\ZFC$ then $\gM$ can be extended by a generic sequence of reals $\a_\i,$ $\i\in\bI,$ such that $\aleph_1^\gM$ is preserved and every $\a_\i$ is Sacks generic…
We give a criterion when an expansion of the ordered set of real numbers defines the image of the expansion of the real field by the set of natural numbers under a semialgebraic injection. In particular, we show that for a non-quadratic…
We show that an inner model of a class-generic extension of L need not itself be such an extension. Our example is of the form L[R], where R is a real belonging to a class-generic extension of L and constructible from 0#.
Random matrix theory (RMT) is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Most of the proposed generalizations keep the first assumption and violate the second. Recently, several authors presented…
We show that a pseudorepresentation $\textbf{D}\colon A[G] \to A$ of a (finite) group $G$ need not arise from a genuine representation, even if one is allowed to extend the ring $A$. This shows that a theorem of the "embedding problem" for…
The notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of ZF between the ground model and the generic extension, and often the axiom of choice…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
Given a function $f : A \to \mathbb{R}^n$ of a certain regularity defined on some open subset $A \subseteq \mathbb{R}^m$, it is a classical problem of analysis to investigate whether the function can be extended to all of $\mathbb{R}^m$ in…
We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…
It is sometimes desirable in choiceless constructions of set theory that one iteratively extends some ground model without adding new sets of ordinals after the first extension. Pushing this further, one may wish to have models $V \subseteq…
A predictive distribution over a sequence of $N+1$ events is said to be "frequency mimicking" whenever the probability for the final event conditioned on the outcome of the first $N$ events equals the relative frequency of successes among…
An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…
We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…
We show that if $M$ is a countable transitive model of ZF and if $a,b$ are reals not in $M$, then there is a $G$ generic over $M$ such that $b \in L[a,G]$. We then present several applications such as the following: if $J$ is any countable…
The notion of trivial extension of a ring by a module has been extensively studied and used in ring theory as well as in various other areas of research like cohomology theory, representation theory, category theory and homological algebra.…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…