LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Linear equations over multiplicative groups, recurrences, and mixing III

Photo from academic.microsoft.com

Given an algebraic $\mathbf{Z}^{d}$ -action corresponding to a prime ideal of a Laurent ring of polynomials in several variables, we show how to find the smallest order $n+1$ of non-mixing.… Click to show full abstract

Given an algebraic $\mathbf{Z}^{d}$ -action corresponding to a prime ideal of a Laurent ring of polynomials in several variables, we show how to find the smallest order $n+1$ of non-mixing. It is known that this is determined by the non-mixing sets of size $n+1$ , and we show how to find these in an effective way. When the underlying characteristic is positive and $n\geq 2$ , we prove that there are at most finitely many classes under a natural equivalence relation. We work out two examples, the first with five classes and the second with 134 classes.

Keywords: groups recurrences; mixing iii; recurrences mixing; linear equations; multiplicative groups; equations multiplicative

Journal Title: Ergodic Theory and Dynamical Systems
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.