English
Related papers

Related papers: Cantor's theorem may fail for finitary partitions

200 papers

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

Combinatorics · Mathematics 2023-01-11 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

We show that any finite group $G$ there exists a bijction $f$ from $G$ onto $C_{n}$ such that $o(x)$ divides $o(f(x))$ for all $x\in G$. This confirm Problem 18.1 in [7].

Group Theory · Mathematics 2023-08-22 Mohsen Amiri

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Dynamical Systems · Mathematics 2022-12-02 Kan Jiang

We study the topos $\mathcal{E}=\mathsf{Sh}(H\ltimes 2^{\mathbb{N}})$ arising from a nontrivial finite group $H$ acting freely on Cantor space. Using a local embedding property for the relevant epimorphisms together with effective descent…

Logic · Mathematics 2026-01-26 Frank Gilson

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

Logic · Mathematics 2016-05-04 Philipp Hieronymi

In this note, we give a new necessary condition for the existence of non-trivial partitions of a finite vector space. Precisely, we prove that, if V is a finite vector space over a field of order q, then the number of the subspaces of…

Combinatorics · Mathematics 2009-02-19 Antonino Giorgio Spera

Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…

Optimization and Control · Mathematics 2025-10-14 Santanu S. Dey , Frédéric Meunier , Diego Moran Ramirez

Zermelo's Axiom of Separation is: Exist x: Forall y: (y in x <==> y in a & E(y)) with definite(E) and parameter a. Thoralf Skolem suggested to characterize the terminus "definite" by "the property E should be representable by a FOL…

Logic · Mathematics 2008-08-01 Werner DePauli-Schimanovich

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. It is proved consistent with $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of…

Logic · Mathematics 2025-09-23 Ruihuan Mao , Guozhen Shen

Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…

Dynamical Systems · Mathematics 2026-02-03 Chatchai Noytaptim , Xiao Zhong

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…

General Mathematics · Mathematics 2012-01-26 Antonio Leon

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

Quantum Algebra · Mathematics 2014-10-20 Simon Lentner , Daniel Nett

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

Discrete Mathematics · Computer Science 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

Number Theory · Mathematics 2022-04-18 Bing Li , Ruofan Li , Yufeng Wu

A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…

General Topology · Mathematics 2021-01-11 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

Group Theory · Mathematics 2021-03-24 Igor Protasov

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

If F is a surface with boundary, then a finitely generated subgroup without peripheral elements of G = {\pi}_1(F) can be separated from finitely many other elements of G by a finite index subgroup of G corresponding to a finite cover F'…

Geometric Topology · Mathematics 2014-10-01 Mark D. Baker , Daryl Cooper

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Group Theory · Mathematics 2010-12-09 A. Myasnikov , D. Osin