• Home
  • Search
  • Diophantine equations and ergodic theorems
  • Cite Icon42
  • https://doi.org/10.1353/ajm.2002.0029Copy DOI Icon

Diophantine equations and ergodic theorems

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Let ( X , μ) be a probability measure space and T 1 , . . . , T n be a family of commuting, measure preserving invertible transformations on X . Let Q ( m 1 , . . . , m n ) be a homogeneous, positive polynomial with integer coefficients, and let S λ = { m ∈ Z n : Q ( m ) = λ} denote the set of integer solutions m = ( m 1 , . . . m n ) of the diophantine equation Q ( m ) = λ. We prove that under a certain nondegeneracy condition on the polynomial Q ( m ) and an ergodic condition on the family of transformations T = ( T 1 , . . . , T n ) the images of the solution sets: Ω x ,λ = {( T m1 1 T m2 2 … T mn n x ): m ∈ S λ} become uniformly distributed on X w.r.t. μ for a.e. x ∈ X as λ → ∞. That is the pointwise ergodic theorem holds when the standard averages are replaced by the ones, where the exponents satisfy a diophantine equation. The proof uses a variant of the Hardy-Littlewood method of exponential sums developed by Birch and Davenport and techniques from harmonic analysis. A key point is the corresponding maximal theorem, which is a discrete analogue of a maximal theorem on R n corresponding to the level surfaces of the polynomial Q ( x ).

Similar Papers
  • Research Article
  • Citations9

On ergodic measure-preserving transformations defined on an infinite measure space

  • Jan 01, 1965
  • Proceedings of the American Mathematical Society
  • Arshag B Hajian
  • Research Article
  • Citations29

Monoids determined by a homogenous linear diophantine equation and the half-factorial property

  • Jul 01, 2000
  • Journal of Pure and Applied Algebra
  • Scott T Chapman +2
  • Supplementary Content

A hypothetical algorithm which computes an upper bound for the heights of solutions of a Diophantine equation whose solution set is finite

  • Nov 19, 2015
  • Zenodo (CERN European Organization for Nuclear Research)
  • Apoloniusz Tyszka
  • Book Chapter
  • Citations2

Linear Equations and Inequalities

  • Jan 01, 1993
  • Utpal Banerjee
  • Research Article
  • Citations26

Early Integer Programming

  • Feb 01, 2002
  • Operations Research
  • Ralph E Gomory
  • Single Book
  • Citations32

Ergodic Theory and Dynamical Systems

  • Dec 12, 2013
  • Idris Assani +3
  • Research Article
  • Citations5

Chaotic and ergodic properties of cylindric billiards

  • Oct 01, 1999
  • Ergodic Theory and Dynamical Systems
  • Péter Bálint
  • Research Article
  • Citations2

A diophantine problem in harmonic analysis

  • Nov 01, 1990
  • Mathematical Proceedings of the Cambridge Philosophical Society
  • A J Van Der Poorten +1
  • Research Article
  • Citations41

Fluctuations of ergodic sums for horocycle flows on $\Z^d$--covers of finite volume surfaces

  • Jun 01, 2008
  • Discrete and Continuous Dynamical Systems
  • Omri Sarig +1
  • Research Article
  • Citations2

Polynomial parametrization of the solutions of diophantine equations of genus 0

  • Dec 01, 2008
  • Functiones et Approximatio Commentarii Mathematici
  • Sophie Frisch +1
  • Research Article
  • Citations2

Quasi-ergodicity for non-homogeneous continuous-time Markov chains

  • Sep 01, 1989
  • Journal of Applied Probability
  • A I Zeifman
  • Book Chapter
  • Citations3

Siegel’s Lemma Is Sharp

  • Jan 01, 2017
  • József Beck
  • Research Article

Nondegenerate Hyperplane Covers of the Hypercube

  • Apr 14, 2026
  • The Electronic Journal of Combinatorics
  • Lisa Sauermann +1
  • Research Article
  • Citations2

Ergodicity Conditions in Quantum Mechanics and Van Hove's Hamiltonians

  • Mar 01, 1962
  • Journal of Mathematical Physics
  • G M Prosperi
  • Research Article
  • Citations9

A retrospective on 60 years of approximation theory and associated fields

  • May 27, 2009
  • Journal of Approximation Theory
  • Paul L Butzer
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.