Related papers: Adding a lot of random reals by adding a few
The number of ``carries'' when $n$ random integers are added forms a Markov chain [23]. We show that this Markov chain has the same transition matrix as the descent process when a deck of $n$ cards is repeatedly riffle shuffled. This gives…
Working in combinatorial model $\mathrm{W_{co}}(d)$, $d=1,2,\dots$, of P\'olya's random walker in $\mathbb{Z}^d$, we prove two theorems on recurrence to a vertex. We obtain an effective version of the first theorem if $d=2$. Using a…
If kappa is strongly compact, lambda > kappa is regular, then (2^{< lambda})^+ --> (lambda+eta)^2_theta holds for eta,theta<kappa.
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
This thesis consists of two parts: the construction of a jointly universal family of graphs, and then an exploration of set-theoretic geology. Firstly we shall construct a model in which…
We build, for real quadratic fields, infinitely many periodic continuous fractions uniformly bounded, with a seemingly better bound than the known ones. We do that using continuous fraction expansions with the same shape as those of real…
The paper is the second of our series of notes aimed to bring back in circulation some bright ideas of early modern set theory, mainly due to Harrington and Sami, which have never been adequately presented in set theoretic publications. We…
Assume ZFC. Let $\kappa$ be a cardinal. Recall that a ${<\kappa}$-ground is a transitive proper class $W$ modelling ZFC such that $V$ is a generic extension of $W$ via a forcing $\mathbb{P}\in W$ of cardinality ${<\kappa}$, and the…
Random features (RFs) are a popular technique to scale up kernel methods in machine learning, replacing exact kernel evaluations with stochastic Monte Carlo estimates. They underpin models as diverse as efficient transformers (by…
We prove that if cf(lambda) > aleph_0 and 2^{cf(lambda)}<lambda, then lambda->(lambda,omega+1)^2.
Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…
Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…
Given an inner model $W \subset V$ and a regular cardinal $\kappa$, we consider two alternatives for adding a subset to $\kappa$ by forcing: the Cohen poset $Add(\kappa,1)$, and the Cohen poset of the inner model $Add(\kappa,1)^W$. The…
Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters…
For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…
Given two infinite cardinals $\kappa$ and $\lambda$, we introduce and study the notion of a $\kappa$-barely independent family over $\lambda.$ We provide some conditions under which these types of families exist. In particular, we relate…
We consider the two-cardinal Kurepa Hypothesis $\mathsf{KH}(\kappa,\lambda)$. We observe that if $\kappa\leq\lambda<\mu$ are infinite cardinals then…
Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…
In this paper we use infinitary Turing machines with tapes of length $\kappa$ and which run for time $\kappa$ as presented, e.g., by Koepke \& Seyfferth, to generalise the notion of type two computability to $2^{\kappa}$, where $\kappa$ is…