English
Related papers

Related papers: Cantor-Schr\"oder-Bernstein theorem for a class of…

200 papers

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…

Data Structures and Algorithms · Computer Science 2018-05-23 Samuele Giraudo , Stéphane Vialette

We say that a countable discrete group $G$ is {\em almost Ornstein} if for every pair of standard non-two-atom probability spaces $(K,\kappa), (L,\lambda)$ with the same Shannon entropy, the Bernoulli shifts $G \cc (K^G,\kappa^G)$ and $G…

Dynamical Systems · Mathematics 2011-06-10 Lewis Bowen

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

We show that the space of left-orderings of a countable virtually solvable group is either finite or homeomorphic to a Cantor set. We also provide an explicit description of the space of left-orderings of $SOL=\Z^2\rtimes_T\Z$.

Group Theory · Mathematics 2013-03-25 Cristóbal Rivas , Romain Tessera

For each countable ordinal $\alpha$ let $\mathcal{S}_{\alpha}$ be the Schreier set of order $\alpha$ and $X_{\mathcal{S}_\alpha}$ be the corresponding Schreier space of order $\alpha$. In this paper we prove several new properties of these…

Functional Analysis · Mathematics 2019-03-11 Leandro Antunes , Kevin Beanland , Hung Viet Chu

In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…

Dynamical Systems · Mathematics 2016-02-16 Terry Soo

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is…

Formal Languages and Automata Theory · Computer Science 2019-07-29 Kitti Gelle , Szabolcs Ivan

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

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

Logic · Mathematics 2019-07-29 M. Malliaris , S. Shelah

Motivated by Dohmen-P\"onitz-Tittmann's bivariate chromatic polynomial $\chi_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of…

Combinatorics · Mathematics 2021-12-21 Matthias Beck , Maryam Farahmand , Gina Karunaratne , Sandra Zuniga Ruiz

A topological space $L$ is called a linear ordered topological space (LOTS) whenever there is a linear order $\leq$ on $L$ such that the topology on $L$ is generated by the open sets of the form $(a, b)$ with $a < b$ and $a, b \in L \cup \{…

General Topology · Mathematics 2017-01-03 Robert Bonnet , Arkady Leiderman

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

The Bernoulli sieve is an infinite occupancy scheme obtained by allocating the points of a uniform $[0,1]$ sample over an infinite collection of intervals made up by successive positions of a multiplicative random walk independent of the…

Probability · Mathematics 2016-09-30 Alexander Iksanov , Wissem Jedidi , Fethi Bouzeffour

We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…

Combinatorics · Mathematics 2017-05-11 Eric Hoffbeck , Ieke Moerdijk

In this paper, we prove the following version of the famous Bernstein's theorem: Let $X\subset \mathbb R^{n+k}$ be a closed and connected set with Hausdorff dimension $n$. Assume that $X$ satisfies the monotonicity formula at $p\in X$.…

Differential Geometry · Mathematics 2024-04-10 José Edson Sampaio , Euripedes Carvalho da Silva

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

Combinatorics · Mathematics 2012-12-03 Henry Towsner

Each (equigenerated) squarefree monomial ideal in the polynomial ring $S=\mathbb{K}[x_1, \ldots, x_n]$ represents a family of subsets of $[n]$, called a (uniform) clutter. In this paper, we introduce a class of uniform clutters, called…

Commutative Algebra · Mathematics 2018-07-31 Mina Bigdeli , Ali Akbar Yazdan Pour , Rashid Zaare-Nahandi

We study semantic and syntactic properties of spherical orders and their elementary theories, including finite and dense orders and their theories. It is shown that theories of dense $n$-spherical orders are countably categorical and…

Logic · Mathematics 2022-08-11 Beibut Sh. Kulpeshov , Sergey V. Sudoplatov

We show that for any smooth Hausdorff manifolds M and N, which are not necessarily second countable, paracompact or connected, any isomorphism from the algebra of smooth (real or complex) functions on N to the algebra of smooth functions on…

Differential Geometry · Mathematics 2007-05-23 Janez Mrcun

Let $\mathscr{A}$ be a nonempty set of infinite matrices of linear operators between two topological vector spaces. We show that a sequence is uniformly $\mathscr{A}$-summable if and only if it is $B$-summable for all matrices $B$ of linear…

Functional Analysis · Mathematics 2025-09-09 Paolo Leonetti