Related papers: Saturation for product systems of polynomials
We propose and develop an approach to study nilsystems and their proximal extensions using cube structures associated with the universal minimal system. We provide alternative proofs for results regarding saturation properties of factor…
If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…
We study dynamical systems with the property that all the nontrivial factors have infinite topological entropy (or, positive mean dimension). We establish an ``if and only if'' condition for this property among a typical class of dynamical…
Nilsystems are a natural generalization of rotations and arise in various contexts, including in the study of multiple ergodic averages in ergodic theory, in the structural analysis of topological dynamical systems, and in asymptotics for…
The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output…
We present a homological characterisation of those chain complexes of modules over a Laurent polynomial ring in several indeterminates which are finitely dominated over the ground ring (that is, are a retract up to homotopy of a bounded…
The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…
We show that, under suitably general formulations, covering properties, accumulation properties and filter convergence are all equivalent notions. This general correspondence is exemplified in the study of products. Let $X$ be a product of…
In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y,f) is a finitely presented system, then there exists a Smale space (X,F) and a u-resolving factor map…
We show that for every topological dynamical system with the approximate product property, zero topological entropy is equivalent to unique ergodicity. Equivalence of minimality is also proved under a slightly stronger condition. Moreover,…
We begin a generalized study of sum-product type phenomenon in different fields by considering pairs $P(x,y)$ and $Q(x,y)$ of two variable polynomials that simultaneously exhibit small symmetric expansion. Our first result is that such…
A Cantor minimal system is of finite topological rank if it has a Bratteli-Vershik representation whose number of vertices per level is uniformly bounded. We prove that if the topological rank of a minimal dynamical system on a Cantor set…
We classify the pairs of polynomials $f,g$ over a field $K$, such that $f(X)-g(Y)$ has a factor of total degree at most 2. This was done by Y. Bilu for characteristic 0 fields $K$. As his method does not work in positive characteristic, we…
In this paper, it is shown that for $d\in\mathbb{N}$, a minimal system $(X,T)$ is a $d$-step pro-nilsystem if its enveloping semigroup is a $d$-step top-nilpotent group, answering an open question by Donoso. Thus, combining the previous…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
This study focuses on the topological pressure of nonautonomous iterated function systems defined on a compact metric space. We establish an inequality relating two topological pressures associated with a factor map of nonautonomous…
We construct examples of minimal and uniquely ergodic systems realizing all possible behaviors in the interplay of measurable and topological nilfactors. To build such examples, we adapt an idea that stems from Furstenberg's construction of…
In this paper we introduce the notions of topological entropy and topological pressure for non-autonomous iterated function systems (or NAIFSs for short) on countably infinite alphabets. NAIFSs differ from the usual (autonomous) iterated…
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is established that the two…
We provide an upper bound on the topological complexity of twisted products. We use it to give an estimate $$TC(X)\le TC(\pi_1(X))+\dim X$$ of the topological complexity of a space in terms of its dimension and the complexity of its…