Skip to main content
Springer Nature Link
Log in

Three generalizations of Mahler's expansion for continuous functions on â„Īp

  • Chapter
  • First Online:
Save chapter
View saved research
p-adic Analysis

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1454))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. J. RIORDAN: Combinatorial Identities. Robert Krieger Publishing Company, Huntington, New York 1979.

    MATH  Google Scholar 

  2. W. SCHIKHOF: Ultrametric Calculus. Cambridge University Press, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Applied Sciences, Vrije Universiteit Brussel, Pleinlaan 2, B-1050, Brussels, Belgium

    Lucien van Hamme

Authors
  1. Lucien van Hamme
    View author publications

    Search author on:PubMed Google Scholar

Editor information

Francesco BaldassarriSiegfried BoschBernard Dwork

Rights and permissions

Reprints and permissions

Copyright information

ÂĐ 1990 Springer-Verlag

About this chapter

Cite this chapter

van Hamme, L. (1990). Three generalizations of Mahler's expansion for continuous functions on â„Īp . In: Baldassarri, F., Bosch, S., Dwork, B. (eds) p-adic Analysis. Lecture Notes in Mathematics, vol 1454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091150

Download citation

  • DOI: https://doi.org/10.1007/BFb0091150

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53477-8

  • Online ISBN: 978-3-540-46906-3

  • eBook Packages: Springer Book Archive

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics