Related papers: Complexity of Ramsey null sets
We show that under $\mathsf{ZF} + \mathsf{CC}_{\mathbb R}$, if the Ramsey property holds for all sets in a good pointclass $\Gamma$, then there is no MAD family in $\Gamma$, proving a long-standing conjecture made by A.R.D.\ Mathias in…
We show that every countable set of partial bijections from an infinite set to itself can be obtained as a composition of just two such partial bijections. This strengthens a result by Higgins, Howie, Mitchell and Ru\v{s}kuc stating that…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We build on the results of [6] to show that the homology groups $\mathrm{H}_{r_1+r_2}(Y_0(\mathcal{N}_\Sigma),\mathcal{O})_{\mathfrak{m}_\Sigma}$ of arithmetic manifolds are free over certain deformation rings $R_\Sigma$, when there are…
Answering a question raised by V. V. Tkachuk, we present several examples of $\sigma$-compact spaces, some only consistent and some in ZFC, that are not countably tight but in which the closure of any discrete subset is countably tight. In…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
In the classical Hardy space theory of square-summable Taylor series in the complex unit disk there is a circle of ideas connecting Szeg\"o's theorem, factorization of positive semi-definite Toeplitz operators, non-extreme points of the…
Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…
We study the consistency strength of Lebesgue measurability for $\Sigma^1_3$ sets over Zermelo set theory ($Z$) in a completely choiceless context. We establish a result analogous to the Solovay-Shelah theorem.
We show that certain type of tree forcings, including Sacks forcing, increases the covering of the strong measure zero ideal $\mathcal{SN}$. As a consequence, in Sacks model, such covering number is equal to the size of the continuum, which…
We present an algorithm to compute the exact value of the packing measure of self-similar sets satisfying the so called SSC and prove its convergence to the value of the packing measure. We also test the algorithm with examples that show…
A $\Sigma^*$-algebra is a concrete $C^*$-algebra that is sequentially closed in the weak operator topology. We study an appropriate class of $C^*$-modules over $\Sigma^*$-algebras analogous to the class of $W^*$-modules (selfdual…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
We give characterizations for the (in ZFC unprovable) sentences ``Every $\Sb{1}{2}$--set is measurable" and ``Every $\Db{1}{2}$--set is measurable" for various notions of measurability derived from well--known forcing partial orderings.
We study two form of selective selective separability, $SS$ and $SS^+$, on countable spaces with an analytic topology. We show several Ramsey type properties which imply $SS$. For analytic spaces $X$, $SS^+$ is equivalent to have that the…
We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some formulas. The extended framework is known to have…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…
We show that the Ramsey theory of block sequences in infinite-dimensional discrete vector spaces can be parametrized by perfect sets. As special cases, we prove combinatorial dichotomies for definable families of partitions and linear…
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…