Related papers: Central sets and substitutive dynamical systems
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
Three topics in dynamical systems are discussed. In the first two sections we solve some open problems concerning, respectively, Furstenberg entropy of stationary dynamical systems, and uniformly rigid actions admitting a weakly mixing…
A substitution $\vp$ is strong Pisot if its abelianization matrix is non-singular and all eigenvalues except the Perron-Frobenius eigenvalue have modulus less than one. For strong Pisot $\vp$ that satisfies a no cycle condition and for…
We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…
We develop a new toolbox for the analysis of the global behavior of stochastic discrete particle systems. We introduce and study the notion of the Schur generating function of a random discrete configuration. Our main result provides a…
The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…
We study dynamical systems arising as time-dependent compositions of Pomeau-Manneville-type intermittent maps. We establish central limit theorems for appropriately scaled and centered Birkhoff-like partial sums, with estimates on the rate…
We give a short and uniform proof of a special case of Tits' Centre Conjecture using a theorem of J-P. Serre and a result from our earlier work. We consider fixed point subcomplexes $X^H$ of the building $X = X(G)$ of a connected reductive…
Any infinite sequence of substitutions with the same matrix of the Pisot type defines a symbolic dynamical system which is minimal. We prove that, to any such sequence, we can associate a compact set (Rauzy fractal) by projection of the…
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of two dimensional zonotopes, using dynamical systems and order theory. We show that the sets of partitions ordered with a simple…
A log generic hypersurface in $\mathbb{P}^n$ with respect to a birational modification of $\mathbb{P}^n$ is by definition the image of a generic element of a high power of an ample linear series on the modification. A log very-generic…
Standard statistical mechanical or condensed matter arguments tell us that bulk properties of a physical system do not depend too much on boundary conditions. Random tilings of large regions provide counterexamples to such intuition, as…
Let $(X, f)$ be a topological dynamical system and $\mathcal {F}$ be a Furstenberg family (a collection of subsets of $\mathbb{N}$ with hereditary upward property). A point $x\in X$ is called an $\mathcal {F}$-transitive point if for every…
The vector field of a mixed-monotone system is decomposable via a decomposition function into increasing (cooperative) and decreasing (competitive) components, and this decomposition allows for, e.g., efficient computation of reachable sets…
We define the notion of central orderings for a general commutative ring $A$ which generalizes the notion of central points of irreducible real algebraic varieties. We study a central and a precentral loci which both live in the real…
We establish and fully characterize the multidimensional extension of the Stronger Central Sets Theorem. Additionally, we develop a polynomial generalization of this result. Our approach utilizes tools from the Algebra of the Stone-\v{C}ech…
This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…
Within Bishop Set Theory, a reconstruction of Bishop's theory of sets, we study the so-called completely separated sets, that is sets equipped with a positive notion of an inequality, induced by a given set of real-valued functions. We…
We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…
Causal sets are locally finite, partially ordered sets (posets), which are considered as discrete models of spacetimes. On the one hand, causal sets corresponding to a spacetime manifold are commonly generated with a random process called…