• NEWS
  • CURRENT ISSUE
  • CONTACT
GET_pdf

Volume 24 (3) 2018, 187–209

On Half Iterates of Functions Defined on Finite Sets

Kozyra Paweł M.

Institute of Mathematics University of Silesia
Katowice Bankowa 14, 40-007 Katowice, Poland
E-mail: pawel_m_kozyra@wp.pl

Received:

Received: 30 April 2018; revised: 28 August 2018; accepted: 30 August 2018; published online: 30 September 2018

DOI:   10.12921/cmst.2018.0000027

Abstract:

Four algorithms determining all functional square roots (half iterates) and seven algorithms finding one functional square root of any function f : X → X defined on a finite set X, if these square roots exist, are presented herein. Time efficiency of these algorithms depending on the complexity of examined functions is compared and justification of correctness is given. Moreover, theorems which make finding half iterates possible in some cases or facilitate this task are formulated.

Key words:

functional square root, half iterate, iterated function

References:

[1] J. Gross, J. Yellen, Handbook of Graph Theory, CRC Press, 2003.
[2] M.N.S. Swamy, K. Thulasiraman, Graphs: Theory and Algo- rithms. Wiley,1992.
[3] Kneser, H. Reelle analytische Lösungen der Gleichung Φ(Φ(x)) = ex und verwandter Funktionalgleichungen. Jour- nal fur die reine und angewandte Mathematik. 187, 56–67 (1950).
[4] Gray J., Parshall, K. Episodes in the History of Modern Al- gebra (1800–1950), American Mathematical Society, ISBN 978-0-8218-4343-7, 2007.
[5] E. Schröder, Über iterirte Functionen. Mathematische Annalen, 3 (2), 296–322 (1870).
[6] G. Szekeres, Regular iteration of real and complex functions Acta Mathematica 100, (3–4) 361–376 (1958).
[7] T. Curtright, C. Zachos, X. Jin, Approximate solutions of func- tionalequations, JournalofPhysicsA44(40):405205(2011). [8] M.C. Zdun, On iterative roots of homeomorphisms of the circle, Bull. Pol. Acad. Sci. Math 48 (2), 203-213.

  • JOURNAL MENU

    • AIMS AND SCOPE
    • EDITORS
    • EDITORIAL BOARD
    • NOTES FOR AUTHORS
    • CONTACT
    • IAN SNOOK PRIZES 2015
    • IAN SNOOK PRIZES 2016
    • IAN SNOOK PRIZES 2017
  • GALLERY

    vol_19_04_2013
    vol_19_03_2013
    volume_19_2_2013
    volume_19_1_2013
    vol_sp_2_2010
    vol_sp_2006
    vol_sp_1_2010
    vol_16_01_2010
    vol_18_2_2012
    vol_18_01_2012
    vol_17_01_02_2011
    vol_16_02_2010
    vol_15_02_2009
    vol_15_01_2009
    vol_14_02_2008
    vol_14_01_2008
    vol_13_02_2007
    vol_13_01_2007
    vol_12_02_2006
    vol_12_01_2006
    vol_11_02_2005
    vol_11_01_2005
  • CURRENT ISSUE

  • MANUSCRIPT SUBMISSION

    • SUBMIT A MANUSCRIPT
  • FUTURE ISSUES

    • ACCEPTED PAPERS
  • ALL ISSUES

    • 2018
      • Volume 24 (4)
      • Volume 24 (3)
      • Volume 24 (2)
      • Volume 24 (1)
    • 2017
      • Volume 23 (4)
      • Volume 23 (3)
      • Volume 23 (2)
      • Volume 23 (1)
    • 2016
      • Volume 22 (4)
      • Volume 22 (3)
      • Volume 22 (2)
      • Volume 22 (1)
    • 2015
      • Volume 21 (4)
      • Volume 21 (3)
      • Volume 21 (2)
      • Volume 21 (1)
    • 2014
      • Volume 20 (4)
      • Volume 20 (3)
      • Volume 20 (2)
      • Volume 20 (1)
    • 2013
      • Volume 19 (4)
      • Volume 19 (3)
      • Volume 19 (2)
      • Volume 19 (1)
    • 2012
      • Volume 18 (2)
      • Volume 18 (1)
    • 2011
      • Volume 17 (1-2)
    • 2010
      • Volume SI (2)
      • Volume SI (1)
      • Volume 16 (2)
      • Volume 16 (1)
    • 2009
      • Volume 15 (2)
      • Volume 15 (1)
    • 2008
      • Volume 14 (2)
      • Volume 14 (1)
    • 2007
      • Volume 13 (2)
      • Volume 13 (1)
    • 2006
      • Volume SI (1)
      • Volume 12 (2)
      • Volume 12 (1)
    • 2005
      • Volume 11 (2)
      • Volume 11 (1)
    • 2004
      • Volume 10 (2)
      • Volume 10 (1)
    • 2003
      • Volume 9 (1)
    • 2002
      • Volume 8 (2)
      • Volume 8 (1)
    • 2001
      • Volume 7 (2)
      • Volume 7 (1)
    • 2000
      • Volume 6 (1)
    • 1999
      • Volume 5 (1)
    • 1998
      • Volume 4 (1)
    • 1997
      • Volume 3 (1)
    • 1996
      • Volume 2 (1)
      • Volume 1 (1)
    • OLDER ISSUES
  • DATABASES

    • ARTICLES BASE
    • AUTHORS BASE
  • NEWS
  • CURRENT ISSUE
  • CONTACT

Institute of Bioorganic Chemistry Polish Academy of Sciences
Poznań Supercomputing and Networking Center

61-704 Poznań, Z. Noskowskiego 12/14
phone: (+48 61) 858-20-03
fax: (+48 61) 858-21-51