English
Related papers

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

200 papers

Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…

Classical Analysis and ODEs · Mathematics 2011-11-08 Lech Pasicki

Goal. We analyze when the Partition Principle ($\mathsf{PP}$) holds without $\mathsf{AC}$ in models arising from a free finite $H$-action on Cantor space, and reconcile two standard routes to such models. Approach. Route I proceeds via a…

Logic · Mathematics 2026-01-26 Frank Gilson

Let $\ee>0$ and $\fff$ be a family of finite subsets of the Cantor set $\ccc$. Following D. H. Fremlin, we say that $\fff$ is $\ee$-filling over $\ccc$ if $\fff$ is hereditary and for every $F\subseteq\ccc$ finite there exists $G\subseteq…

Logic · Mathematics 2019-05-01 Pandelis Dodos , Vassilis Kanellopoulos

A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…

Combinatorics · Mathematics 2013-12-20 Ben Barber , Neil Hindman , Imre Leader

Let $A$ be a unital simple separable exact C$^*$-algebra which is approximately divisible and of real rank zero. We prove that the set of positive elements in $A$ with a fixed non-compact Cuntz class has vanishing homotopy groups. Combined…

Operator Algebras · Mathematics 2022-10-27 Andrew S. Toms

Let $X$ be a surface, possibly with boundary. Suppose it has infinite genus or infinitely many punctures, or a closed subset which is a disk with a Cantor set removed from its interior. For example, $X$ could be any surface of infinite type…

Group Theory · Mathematics 2022-01-05 Daniel Allcock

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

A particular case of the Hindman--Galvin--Glazer theorem states that, for every partition of an infinite abelian group $G$ into two cells, there will be an infinite $X\subseteq G$ such that the set of its finite sums…

Logic · Mathematics 2020-06-02 David Fernández-Bretón , Sung Hyup Lee

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

Combinatorics · Mathematics 2007-05-23 V. Farmaki , S. Negrepontis

We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…

Logic · Mathematics 2014-02-20 Asaf Karagila

In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…

Combinatorics · Mathematics 2012-05-22 Amela Muratović-Ribić , Qiang Wang

If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its row-words. The permanent Perm(T) is the set of words…

Combinatorics · Mathematics 2007-05-23 Srečko Brlek , Michel Mendès France , John Michael Robson , Martin Rubey

Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…

General Topology · Mathematics 2023-06-13 Evgenii Reznichenko

Given an infinite group $G$ and a subset $A$ of $G$ we let $\Delta(A) = \{g \in G \,:\, |gA \cap A| =\infty\}$ (this is sometimes called the \emph{combinatorial derivation} of $A$). A subset $A$ of $G$ is called: \emph{large} if there…

Combinatorics · Mathematics 2014-09-30 Joshua Erde

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

Group Theory · Mathematics 2012-11-28 Paul Apisa , Benjamin Klopsch

For a cardinal $\mathfrak{a}$, let $\mathrm{fin}(\mathfrak{a})$ be the cardinality of the set of all finite subsets of a set which is of cardinality $\mathfrak{a}$. It is proved without the aid of the axiom of choice that for all infinite…

Logic · Mathematics 2021-11-02 Guozhen Shen

A derived version of Maschke's theorem for finite groups is proved: the derived categories, bounded or unbounded, of all blocks of the group algebra of a finite group are simple, in the sense that they admit no nontrivial recollements. This…

Representation Theory · Mathematics 2011-04-05 Qunhua Liu , Dong Yang

A well-known theorem of Wedderburn asserts that a finite division ring is commutative. In a division ring the group of invertible elements is as large as possible. Here we will be particularly interested in the case where this group is as…

Rings and Algebras · Mathematics 2013-02-14 Rodney Coleman

In this paper we prove that the nonzero elements of a finite field with odd characteristic can be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each pair. The algebraic and topological approaches to…

Combinatorics · Mathematics 2011-03-14 R. N. Karasev , F. V. Petrov