English
Related papers

Related papers: Cantor-Bendixson ranks of countable SFTs

200 papers

Cantor primes are primes p such that 1/p belongs to the middle-third Cantor set. One way to look at them is as containing the base-3 analogues of the famous Mersenne primes, which encompass all base-2 repunit primes, i.e., primes consisting…

Number Theory · Mathematics 2012-05-04 Christian Salas

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…

Logic in Computer Science · Computer Science 2023-06-05 Gilles Dowek

We introduce and develop a class of \textit{Cantor-winning} sets that share the same amenable properties as the classical winning sets associated to Schmidt's $(\alpha,\beta)$-game: these include maximal Hausdorff dimension, invariance…

Number Theory · Mathematics 2015-09-09 Dzmitry Badziahin , Stephen Harrap

In this paper we consider the long-term behavior of points in ${\mathbb R}$ under iterations of continuous functions. We show that, given any Cantor set $\Lambda^*$ embedded in ${\mathbb R}$, there exists a continuous function $F^*:{\mathbb…

Dynamical Systems · Mathematics 2013-11-05 Benjamin Hoffman

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

Number Theory · Mathematics 2015-06-26 Attila Berczes , Jan-Hendrik Evertse , Kalman Gyory

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Logic · Mathematics 2019-03-08 Philip Welch

We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…

Group Theory · Mathematics 2022-03-09 Arman Darbinyan , Markus Steenbock

We consider a generalisation of the self-affine iterated function systems of Lalley and Gatzouras by allowing for a countable infinity of non-conformal contractions. It is shown that the Hausdorff dimension of the limit set is equal to the…

Dynamical Systems · Mathematics 2011-06-08 Henry WJ Reeve

We derive two types of representation results for increasing convex functionals in terms of countably additive measures. The first is a max-representation of functionals defined on spaces of real-valued continuous functions and the second a…

Functional Analysis · Mathematics 2021-03-30 Patrick Cheridito , Michael Kupper , Ludovic Tangpi

From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…

General Mathematics · Mathematics 2021-03-12 Emmanuel Rochette

Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…

Number Theory · Mathematics 2025-08-22 Trey Smith , Aksel Ozer

Let $C$ be a smooth irreducible projective algebraic curve defined over the complex numbers. The notion of the Clifford index of $C$ was extended a few years ago to semistable bundles of any rank. Recent work has been focussed mainly on the…

Algebraic Geometry · Mathematics 2015-01-14 H. Lange , P. E. Newstead

Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…

General Mathematics · Mathematics 2009-09-29 W. Mueckenheim

The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, $\mathcal{E}$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries:…

Logic · Mathematics 2007-11-21 Peter Cholak , Rod Downey , Leo Harrington

We classify the irreducible modules of a rational Lorentzian lattice vertex operator algebra (LLVOA) based on an even, self-dual Lorentzian lattice $\Lambda\subset\mathbb{R}^{m,n}$ of signature $(m,n)$. We show that the set of isomorphism…

High Energy Physics - Theory · Physics 2024-10-30 Ranveer Kumar Singh , Madhav Sinha , Runkai Tao

We characterize pairs of orthogonal countable ordinals. Two ordinals $\alpha$ and $\beta$ are orthogonal if there are two linear orders $A$ and $B$ on the same set $V$ with order types $\alpha$ and $\beta$ respectively such that the only…

Combinatorics · Mathematics 2014-07-04 Claude Laflamme , Maurice Pouzet , Nobert Sauer , Imed Zaguia

We present a number of results concerning infinite-exponent partition relations on linear orders of the form $\langle {}^\alpha 2,<_{\text{lex}}\rangle$ for $\alpha$ an ordinal, generalising the setting of the real line, working throughout…

Logic · Mathematics 2026-05-04 Lyra A. Gardiner , Jonathan Schilhan , Thilo Weinert

In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new…

Commutative Algebra · Mathematics 2015-06-12 E. Carlini , M. V. Catalisano , L. Chiantini , A. V. Geramita , Y. Woo

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

Number Theory · Mathematics 2014-10-21 Apoloniusz Tyszka
‹ Prev 1 8 9 10 Next ›