Related papers: Limits to joining with generics and randoms

Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…

We consider membership problems for rational subsets of the semigroup of $2\times 2$ matrices over $\mathbb{Q}$. For a semigroup $M$, the rational subsets $\mathrm{Rat}(M)$ are defined as the sets accepted by NFAs whose transitions are…

The $g$-theorem is a momentous result in combinatorics that gives a complete numerical characterization of the face numbers of simplicial convex polytopes. The $g$-conjecture asserts that the same numerical conditions given in the…

The symmetric algebra g (denoted S(\g)) over a Lie algebra \g (frak g) has the structure of a Poisson algebra. Assume \g is complex semi-simple. Then results of Fomenko- Mischenko (translation of invariants) and A.Tarasev construct a…

Let $(\Omega,\mathcal{F},P)$ be a probability space and $\mathcal{N}$ the class of those $F\in\mathcal{F}$ satisfying $P(F)\in\{0,1\}$. For each $\mathcal{G}\subset\mathcal{F}$, define $\overline{\mathcal{G}}=\sigma(\mathcal{G}\cup\mathcal…

We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…

Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p > 0$. We consider connected reductive subgroups $X$ of $G$ that contain a given distinguished unipotent element $u$ of $G$. A result of…

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

BosonSampling and Random Circuit Sampling are important both as a theoretical tool for separating quantum and classical computation, and as an experimental means of demonstrating quantum speedups. Prior works have shown that average-case…

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive…

We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…

A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions play a central role in algorithmic randomness and reverse mathematics. Flood and Towsner asked for which…

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

For a finite group $G$, let $d(G)$ denote the probability that a randomly chosen pair of elements of $G$ commute. We prove that if $d(G)>1/s$ for some integer $s>1$ and $G$ splits over an abelian normal nontrivial subgroup $N$, then $G$ has…

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing.…

In 1987, the second author of this paper reported his conjecture, all finite simple groups $S$ can be characterized uniformly using the order of $S$ and the set of element orders in $S$, to Prof. J. G. Thompson. In their communications,…

We prove a variation of Easton's lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle $\textsf{IGMP}$, $\textsf{GMP}$ together with $2^\omega \le \omega_2$ is consistent with the existence of an…