Related papers: Superhighness
An infinite binary sequence is deemed to be random if it has all definable properties that hold almost surely for the usual probability measure on the set of infinite binary sequences. There are only countably many such properties, so it…
In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…
We examine dynamical systems with the property that pseudo-orbits can be traced by small diameter sets with bounded cardinality. In particular, we show that mixing sofic subshifts and surjective dynamical systems with the specification…
Let $k$ be an $F$-finite and infinite field of characteristic $p>2$. We show, there exist infinitely many $F$-finite local domains $(R,\mathfrak{m})$ which are not $\mathbb{Q}$-Gorenstein and $\tau_{\mathrm{b}}(R;\mathfrak{m}^t)$ has all…
We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…
Under Jensen's diamond principle $\diamondsuit$, we construct a simple Efimov space $K$ whose space of nonatomic probability measures $P_{na}(K)$ is first-countable and sequentially compact. These two properties of $P_{na}(K)$ imply that…
Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…
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…
We prove that if $\pi$ is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are $\pi$-groups. In particular, when $\pi$ is the empty set, we obtain Henckell's decidability of…
We study, in three parts, degree sequences of k-families (or k-uniform hypergraphs) and shifted k-families. The first part collects for the first time in one place, various implications such as: Threshold implies Uniquely Realizable implies…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…
We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the…
We provide a necessary and sufficient condition for a simple object in a pivotal k-category to be ambidextrous. In turn, these objects imply the existence of nontrivial trace functions in the category. These functions play an important role…
The class of all countable differentially closed differential fields $K$ of characteristic $0$ was shown by Marker and the author to be "one jump away" from universal for spectra of structures: for every nontrivial countable structure…
If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
We show that there is a compact topological space carrying a measure which is not a weak* limit of finitely supported measures but is in the sequential closure of the set of such measures. We construct compact spaces with measures of…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We give the construction of an infinite topological space with unusual properties. The space is regular, separable, and connected, but removing any nonempty open set leaves the remainder of the space totally disconnected (in fact, totally…