Related papers: There are only countably many sets
We answer a question of Darji and Keleti by proving in $ZFC$ that there exists a compact nullset $C_0\subset\RR$ such that for every perfect set $P\subset\RR$ there exists $x\in\RR$ such that $(C_0+x)\cap P$ is uncountable. Using this $C_0$…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
The goal of this paper is to give a conjectural census of complex hyperbolic sporadic groups. We prove that only finitely many of these sporadic groups are lattices. We also give a conjectural list of all lattices among sporadic groups, and…
Harvey Friedman gives a comparatively short description of an ``unimaginably large'' number $n(3)$ , beyond, e.g. the values $$ A(7,184)< A({7198},158386) < n(3)$$ of Ackermann's function - but finite. We implement Friedman's combinatorial…
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…
We show that, consistently, there is a Borel set which has uncountably many pairwise very non-disjoint translations, but does not allow a perfect set of such translations.
Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-completeness of PATS and Seki showed that the PATS problem is…
The Sylvester-Gallai theorem says that for any finite set of non-collinear points in $\R^2$, there is some line passing through exactly two points of the set. Over the complex numbers, this theorem fails: there are finite configurations…
In this paper, we consider Problem 14.44 in the Kourovka notebook, which is a conjecture about the number of conjugacy classes of a finite group. While elementary, this conjecture is still open and appears to elude any straightforward…
Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…
(some errors corrected, slightly extended)
Bell's theorem for systems more complicated than two qubits faces a hidden, as yet undiscussed, problem. One of the methods to derive Bell's inequalities is to assume existence of joint probability distribution for measurement results for…
We prove the following generalization of Severi's Theorem: Let $X$ be a fixed complex variety. Then there exist, up to birational equivalence, only finitely many complex varieties $Y$ of general type of dimension at most three which admit a…
In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…
We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges…
We exhibit explicit infinite families of finitely presented, Kazhdan, simple groups that are pairwise not measure equivalent. These groups are lattices acting on products of buildings. We obtain the result by studying vanishing and…
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…
In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…
Applying the enumeration of sparse set partitions, we show that the number of set systems H such that the emptyset is not in H, the total cardinality of edges in H is n, and the vertex set of H is {1, 2, ..., m}, equals (1/log(2)+o(1))^nb_n…