Related papers: Cantor-Bendixson ranks of countable SFTs
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
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…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
In the paper "Finite-rank Bratteli-Vershik diagrams are expansive" [DM], Downarowicz and Maass proved that the Cantor minimal system associated to a properly ordered Bratteli diagram of finite rank is either an odometer system or an…
In translation surfaces of finite area (corresponding to holomorphic differentials), directions of saddle connections are dense in the unit circle. On the contrary, saddle connections are fewer in translation surfaces with poles…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.
The shuffle of a non-empty countable set $ S $ of linear orders is the (unique up to isomorphism) linear order $ \Xi(S) $ obtained by fixing a coloring function $ \chi: \mathbb{Q} \to S $ having fibers dense in $ \mathbb{Q} $ and replacing…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
We review results concerning homogeneous compacta and discuss some open questions. It is established that indecomposable continua are Alexandroff (resp., Mazurkiewicz, or strong Cantor) manifolds with respect to the class of all continua.…
A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that…
Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…
For every natural number $n$, there exist finitely presented groups with residual finiteness depths $\omega\cdot n$ and $\omega\cdot n + 1$. The ordinals that arise as the residual finiteness depth of a finitely generated group…
We prove that these Cantor sets are made up of transcendental numbers, apart from their endpoints $0$ and $1$, under some arithmetical assumptions on the data. To that purpose, we establish a criterion of linear independence over the field…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…
The definition of subshifts of finite symbolic rank is motivated by the finite rank measure-preserving transformations which have been extensively studied in ergodic theory. In this paper we study subshifts of finite symbolic rank as…
We study the exact Hausdorff and packing dimensions of the $prime$ $Cantor$ $set$, $\Lambda_P$, which comprises the irrationals whose continued fraction entries are prime numbers. We prove that the Hausdorff measure of the prime Cantor set…
The theory of ordinal ranks on Baire class 1 functions developed by Kechris and Loveau was recently extended by Elekes, Kiss and Vidny\'{a}nszky to Baire class $\xi$ functions for any countable ordinal $\xi\geq1$. In this paper, we answer…