English
Related papers

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

200 papers

Let $\FF$ be a finite field of characteristics different from two. We show that no bijective map transforms permanent into determinant when the cardinality of $\FF$ is sufficiently large. We also give an example of non-bijective map when…

Combinatorics · Mathematics 2010-03-11 Gregor Dolinar , Alexander E. Guterman , Bojan Kuzma , Marko Orel

A Cantor surface $\mathcal C_d$ is a non-compact surface obtained by gluing copies of a fixed compact surface $Y^d$ (a block), with $d+1$ boundary components, in a tree-like fashion. For a fixed subgroup $H<Map(Y^d)$ , we consider the…

Geometric Topology · Mathematics 2023-04-11 Javier Aramayona , Julio Aroca , María Cumplido , Rachel Skipper , Xiaolei Wu

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…

Combinatorics · Mathematics 2012-12-27 Arseniy Akopyan , Roman Karasev

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

Combinatorics · Mathematics 2007-05-23 S. Corteel , C. D. Savage

We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…

Combinatorics · Mathematics 2021-03-05 Hartosh Singh Bal , Gaurav Bhatnagar

We calculate the partition function for "composite particles". For any finite number of states d, and in the following two cases: 1)all states have the same energy, 2)the energy is linearly distributed over the states, we transform the…

Condensed Matter · Physics 2007-05-23 M. Bergère

Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…

Data Structures and Algorithms · Computer Science 2025-02-11 Nicolas Faroß , Sebastian Volz

A sequence $s(n)$ of integers is MC-finite if for every $m \in \mathbb{N}^+$ the sequence $s^m(n) = s(n) \bmod{m}$ is ultimately periodic. We discuss various ways of proving and disproving MC-finiteness. Our examples are mostly taken from…

Combinatorics · Mathematics 2023-07-04 Yuval Filmus , Eldar Fischer , Johann A. Makowsky , Vsevolod Rakita

Let $f$ be a transcendental entire function and let $A(f)$ denote the set of points that escape to infinity `as fast as possible' under iteration. By writing $A(f)$ as a countable union of closed sets, called `levels' of $A(f)$, we obtain a…

Complex Variables · Mathematics 2014-02-26 P. J. Rippon , G. M. Stallard

Let $\mathcal{F}$ be a set of finite groups. A finite group $G$ is called an \emph{$\mathcal{F}$-cover} if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. An $\mathcal{F}$-cover is called \emph{minimal} if no proper…

Group Theory · Mathematics 2024-02-20 Peter J. Cameron , David Craven , Hamid Reza Dorbidi , Scott Harper , Benjamin Sambale

Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…

Logic · Mathematics 2016-01-20 David Hobby

A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof…

General Mathematics · Mathematics 2019-01-01 Acquaah Peter

The Doob convergence theorem implies that the set of divergence of any martingale has measure zero. We prove that, conversely, any $G\_{\delta\sigma}$ subset of the Cantor space with Lebesgue-measure zero can be represented as the set of…

Logic · Mathematics 2015-12-21 Dominique Lecomte , Miroslav Zeleny

The paper contains two results pointing to the lack of symmetry between measure and category. Assume CH. There exists a strongly meager subset of the Cantor set that can be mapped onto the Cantor set by a uniformly continuous function. (It…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Andrzej Nowik , Tomasz Weiss

A semibrick is a set of modules satisfying Schur's Lemma, and it is said to be maximal if it is not properly contained in another semibrick. For any finite dimensional algebra $\varLambda$ over an algebracally closed field $K$, we prove…

Representation Theory · Mathematics 2025-09-16 Sota Asai

Let $G$ be a group and $H_1$,...,$H_s$ be subgroups of $G$ of indices $d_1$,...,$d_s$ respectively. In 1974, M. Herzog and J. Sch\"onheim conjectured that if $\{H_i\alpha_i\}_{i=1}^{i=s}$, $\alpha_i\in G$, is a coset partition of $G$, then…

Group Theory · Mathematics 2024-11-20 Fabienne Chouraqui

For a finite-dimensional algebra {\Lambda}, we establish an explicit bijection between widely generated torsion(-free) classes and semibricks in mod {\Lambda}. Using the kappa order on the lattice of torsion classes with canonical join…

Representation Theory · Mathematics 2026-02-17 Alireza Nasr-Isfahani

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

Combinatorics · Mathematics 2017-05-16 Shishuo Fu , Dazhao Tang

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

Combinatorics · Mathematics 2017-03-22 F. V. Weinstein

We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of…

Logic · Mathematics 2015-03-17 Andrzej Roslanowski , Saharon Shelah