On the number of representations of an element in a polygonal Cayley graph

Gabriella Kuhn; Paolo M. Soardi

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni (1987)

  • Volume: 81, Issue: 4, page 331-336
  • ISSN: 1120-6330

Abstract

top
We compute explicitly the number of paths of given length joining two vertices of the Cayley graph of the free product of cyclic groups of order k.

How to cite

top

Kuhn, Gabriella, and Soardi, Paolo M.. "On the number of representations of an element in a polygonal Cayley graph." Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni 81.4 (1987): 331-336. <http://eudml.org/doc/287445>.

@article{Kuhn1987,
abstract = {We compute explicitly the number of paths of given length joining two vertices of the Cayley graph of the free product of cyclic groups of order k.},
author = {Kuhn, Gabriella, Soardi, Paolo M.},
journal = {Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni},
keywords = {Number of paths; Random walks; Cayley graphs; Free products; Fibonacci numbers; Cayley graph; free product; number of paths},
language = {eng},
month = {12},
number = {4},
pages = {331-336},
publisher = {Accademia Nazionale dei Lincei},
title = {On the number of representations of an element in a polygonal Cayley graph},
url = {http://eudml.org/doc/287445},
volume = {81},
year = {1987},
}

TY - JOUR
AU - Kuhn, Gabriella
AU - Soardi, Paolo M.
TI - On the number of representations of an element in a polygonal Cayley graph
JO - Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni
DA - 1987/12//
PB - Accademia Nazionale dei Lincei
VL - 81
IS - 4
SP - 331
EP - 336
AB - We compute explicitly the number of paths of given length joining two vertices of the Cayley graph of the free product of cyclic groups of order k.
LA - eng
KW - Number of paths; Random walks; Cayley graphs; Free products; Fibonacci numbers; Cayley graph; free product; number of paths
UR - http://eudml.org/doc/287445
ER -

References

top
  1. CARTWRIGHT, D. (1986) - Some remarks about random walks on free products of discrete groups, preprint, Sydney1986. MR964500DOI10.1007/BF01762785
  2. CARTWRIGHT, D. and SOARDI, P.M. (1986) - Random walks on free products, quotients and amalgams, «Nagoja Math. J.», 102, 163-180. Zbl0592.60052MR846137
  3. GERL, P. (1971) - Ueber die Anzahl der Darstellungen von Worten, «Monat. Math.», 75, 205-214. Zbl0225.05008MR295923
  4. JORDAN, C., The Calculus of finite differences. New York. Zbl0154.33901
  5. KUHN, G. (1986) - Some more examples of Plancherel measures, preprint, Milano. 
  6. KALMAN, D. (1982) - Generalized Fibonacci numbers by matrix methods, «The Fibonacci Quart.», 20, 73-76. Zbl0472.10016MR660765
  7. MILES, E.P. (1960) - Generalized Fibonacci numbers and associated matrices, «Amer. Math. Monthly», 67, 745-752. Zbl0103.27203MR123521
  8. WOESS, W. - Nearest neighbour random walks on free products of discrete groups, to appear in «Boll. Un. Mat. Soc.». Zbl0627.60012MR871708

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.