English
Related papers

Related papers: There are only countably many sets

200 papers

A finite set S of words over the alphabet A is called non-complete if Fact(S*) is different from A*. A word w in A* - Fact(S*) is said to be uncompletable. We present a series of non-complete sets S_k whose minimal uncompletable words have…

Formal Languages and Automata Theory · Computer Science 2011-04-05 Vladimir V. Gusev , Elena V. Pribavkina

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

Number Theory · Mathematics 2015-06-08 Koichi Kawada , Trevor D. Wooley

We prove that for a countable, commutative ring $R$, the class of countable $R$-modules either has only countably many isomorphism types, or else it is Borel complete. The machinery gives a succinct proof of the Borel completeness of TFAB,…

Logic · Mathematics 2022-09-16 Michael C. Laskowski , Danielle S. Ulrich

We prove the result stated in the title, which answers the equicharacteristic case of a question of Vasconcelos.

Commutative Algebra · Mathematics 2011-11-09 Lars Winther Christensen , Sean Sather-Wagstaff

We show that for any positive integer $N$, there are only finitely many holomorphic eta quotients of level $N$, none of which is a product of two holomorphic eta quotients other than 1 and itself. This result is an analog of Zagier's…

Number Theory · Mathematics 2017-09-19 Soumya Bhattacharya

We show that for any set of reals X there is a subset Y such X and Y have same Lebesgue outer measure and the distance between any two distinct points in Y is irrational.

Logic · Mathematics 2012-07-23 Ashutosh Kumar

Complements of union-closed families of sets, over a finite ground set, are known as simply rooted families of sets. Cubical sets are widely studied topological objects having applications in computational homology. In this paper, we look…

Combinatorics · Mathematics 2024-09-26 Dhruv Bhasin

In this paper we answer Larman's question on Borsuk's conjecture for two-distance sets. We find a two-distance set consisting of 416 points on the unit sphere in the dimension 65 which cannot be partitioned into 83 parts of smaller…

Metric Geometry · Mathematics 2013-08-30 Andriy V. Bondarenko

We show that a statement concerning the existence of winning strategies of limited memory in an infinite two-person topological game is equivalent to a weak version of the Singular Cardinals Hypothesis.

Logic · Mathematics 2018-08-23 Liljana Babinkostova , Marion Scheepers

For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of…

Metric Geometry · Mathematics 2019-05-15 Fernando Mário de Oliveira Filho , Frank Vallentin

We study metric measure spaces that have quantitative topological control, as well as a weak form of differentiable structure. In particular, let $X$ be a pointwise doubling metric measure space. Let $U$ be a Borel subset on which the…

Metric Geometry · Mathematics 2016-11-17 Guy C. David , Bruce Kleiner

We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…

Computational Complexity · Computer Science 2014-06-24 Samuel C. Hsieh

We prove that for k an uncountable cardinal, there exist 2^k many non homeomorphic weakly compact convex subsets of weight k in the Hilbert space of density k.

General Topology · Mathematics 2009-03-03 Antonio Avilés

In this paper, we determine the bifurcation set of a real polynomial function of two variables for non-degenerate case in the sense of Newton polygons by using a toric compactification. We also count the number of singular phenomena at…

Geometric Topology · Mathematics 2016-08-10 Masaharu Ishikawa , Tat Thang Nguyen , Tien Son Pham

The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…

Logic · Mathematics 2022-08-30 Domenico Cantone , Pietro Ursino

We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered permutation classes have algebraic generating functions, and in…

Combinatorics · Mathematics 2026-04-23 Robert Brignall , Vincent Vatter

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…

Logic · Mathematics 2020-04-17 Ziemowit Kostana

In \cite{J}, Theorem 4.2, Jockusch proves that for any computable k-coloring of pairs of integers, there is an infinite $\Pi^0_2$ homogeneous set. The proof uses a countable collection of $\Pi^0_2$ sets as potential infinite homogeneous…

Logic · Mathematics 2015-07-14 Gregory Igusa , Henry Towsner

We apply an inductive argument to three theorems of Cantor on (1) the uncountability of infinite binary sequences, (2) the uncountability of real numbers, and (3) the non-equinumerosity of sets with their powersets. This technique proves…

Logic · Mathematics 2025-10-20 Saeed Salehi

Let $K\subset\mathbb{R}$ be a self-similar set defined on $\mathbb{R}$. It is easy to prove that if the Lebesgue measure of $K$ is zero, then for Lebesgue almost every $t$, $$K+t=\{x+t:x\in K\}$$ only consists of irrational or…

Number Theory · Mathematics 2022-03-29 Qi Jia , Yuanyuan Li , Kan Jiang