Related papers: Transcendental pairs of generic extensions

Bond percolation on Cayley graphs provides examples of random graphs. Other examples arise from the dynamical study of proper repetitive subgraphs of Cayley graphs. In this paper we demonstrate that these two families have mutually singular…

We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…

This paper studies structural consequences of supercompactness of $\omega_1$ under $\sf{ZF}$. We show that the Axiom of Dependent Choice $(\sf{DC})$ follows from "$\omega_1$ is supercompact". "$\omega_1$ is supercompact" also implies that…

We show, in Zermelo-Fraenkel set theory without the Axiom of Choice, that the existence of a discontinuous homomorphism of the additive group of real numbers induces a selector for the Vitali equivalence relation $\mathbb{R}/\mathbb{Q}$.…

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described.…

We prove a full measurable version of Vizing's theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal{G}$ of degree uniformly bounded by $\Delta\in \mathbb{N}$ defined on a standard probability space…

An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical prediction that the count of zeros of holomorphic self-mappings of the complex linear space should be controlled by the maximum modulus function.…

We introduce the notion of effective Axiom A and use it to show that some popular tree forcings are Suslin+. We introduce transitive nep and present a simplified version of Shelah's "preserving a little implies preserving much": If I is a…

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

We show that there is a Borel way of choosing a representative of a $k$-uniform hypergraphon. This extends the result of Orbanz and Szegedy where this was shown for graphons.

It is proved that in Godel's constructible universe, for every infinite successor cardinal k, there exist graphs G and H of size and chromatic number k, for which the tensor product graph (G x H) is countably chromatic.

We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel…

We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over $L$, every analytic hypergraph on a Polish space admits a $\mathbf{\Delta}^1_2$ maximal independent set. As a main…

Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

We study the extension of the Kechris-Solecki-Todorcevic dichotomy on analytic graphs to dimensions higher than 2. We prove that the extension is possible in any dimension, finite or infinite. The original proof works in the case of the…

A large class of first order partial nonlinear differential equations in two independent variables which possess an infinite set of polynomial conservation laws derived from an explicit generating function is constructed. The conserved…

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

In this paper, we investigate shared value problems for shifts and higher-order difference operators of meromorphic and entire functions in several complex variables. Using Nevanlinna theory in $\mathbb{C}^n$, we obtain new uniqueness…