Related papers: Unifom chains of small transfinite rank

We prove that for infinite rank-one transformations satisfying a property called "partial boundedness," the only commuting transformations are powers of the original transformation. This shows that a large class of infinite…

Let X be a smooth variety over a field of positive characteristic, and let E be an overconvergent isocrystal on X. We establish a criterion for the existence of a "canonical logarithmic extension" of E to a good compactification of X. In…

The rank of a point-line geometry G is usually defined as the generating rank of G, namely the minimal cardinality of a generating set. However, when the subspace lattice of G satisfies the Exchange Property we can also try a different…

A classic and fundamental result about the decomposition of random sequences into a mixture of simpler ones is de Finetti's Theorem. In its original form it applies to infinite 0-1 valued exchangeable sequences. Later it was extended and…

The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…

Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C_Q in Q with the property that f restricted to C_Q is…

Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…

We associate at each link a connectivity space which describes its splittability properties. Then, the notion of order for finite connectivity spaces results in the definition of a new numerical invariant for links, their connectivity…

We investigate the similarities between adic finiteness and homological finiteness for chain complexes over a commutative noetherian ring. In particular, we extend the isomorphism properties of certain natural morphisms from homologically…

Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a…

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

For a class of expanding maps with neutral singularities we prove the validity of a finite rank approximation scheme for the analysis of Sinai-Ruelle-Bowen measures. Earlier results of this sort were known only in the case of hyperbolic…

We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…

In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…

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…

We introduce the category of finite strings and study its basic properties. The category is closely related to the augmented simplex category, and it models categories of linear representations. Each lattice of non-crossing partitions…

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 establish the Minimal Model Program for arithmetic threefolds whose residue characteristics are greater than five. In doing this, we generalize the theory of global $F$-regularity to mixed characteristic and identify certain stable…