Skip to main content
SpringerLink
Log in

An Announce of Results Linking Kolmogorov Complexity to Entropy for Amenable Group Actions

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We announce a generalization of Brudno’s results on the relation between the Kolmogorov complexity and the entropy of a subshift for actions of computable amenable groups.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Alpeev, “Kolmogorov complexity and the garden of Eden theorem,” arXiv:1212.1901 (2012).

  2. A. Alpeev, “Entropy and Kolmogorov complexity for subshifts over amenable groups,” Master’s thesis, unpublished (2013).

  3. A. Bernshteyn, “Measurable versions of the Lovász Local Lemma and measurable graph colorings,” arXiv:1604.07349 (2016).

  4. A. A. Brudno, “Topological entropy, and complexity in the sense of A. N. Kolmogorov,” Uspekhi Mat. Nauk, 29, No. 6(180), 157–158 (1974).

  5. A. A. Brudno, “The complexity of the trajectories of a dynamical system,” Uspekhi Mat. Nauk, 33, No. 1(199), 207–208 (1978).

  6. A. A. Brudno, “Entropy and the complexity of the trajectories of a dynamical system,” Tr. Mosk. Mat. Obs., 44, 124–149 (1982).

    MATH  Google Scholar 

  7. M. Einsiedler and T. Ward, Ergodic Theory With a View Towards Number Theory, Springer, London (2011).

    MATH  Google Scholar 

  8. E. Glasner. Ergodic Theory via Joinings, Amer. Math. Soc., Providence, Rhode Island (2003).

  9. A. N. Kolmogorov, “Three approaches to the definition of information,” Probl. Peredachi Inform., 1, 3–11 (1965).

    MathSciNet  MATH  Google Scholar 

  10. N. Moriakov, “Computable Følner monotilings and a theorem of Brudno I,” arXiv:1509.07858 (2015).

  11. N. Moriakov, “Computable Følner monotilings and a theorem of Brudno II,” arXiv:1510.03833 (2015).

  12. S. G. Simpson, “Symbolic dynamics: entropy = dimension = complexity,” Theory Comput. Syst. 56, No. 3, 527–543 (2015).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chebyshev Laboratory of St. Petersburg State University, St. Petersburg, Russia

    A. V. Alpeev

Authors
  1. A. V. Alpeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Alpeev.

Additional information

Published in Zapiski Nauchnykh Seminarov POMI, Vol. 468, 2018, pp. 7–12.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alpeev, A.V. An Announce of Results Linking Kolmogorov Complexity to Entropy for Amenable Group Actions. J Math Sci 240, 503–506 (2019). https://doi.org/10.1007/s10958-019-04367-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-019-04367-x

Search

Navigation