July  2006, 14(3): 399-408. doi: 10.3934/dcds.2006.14.399

Vertex maps for trees: Algebra and periods of periodic orbits

1. 

Department of Mathematics and Computer Science, Fairfield University, Fairfield, CT 06824, United States

Received  December 2004 Revised  July 2005 Published  December 2005

Let $T$ be a tree with $n$ vertices. Let $f: T \rightarrow T$ be continuous and suppose that the $n$ vertices form a periodic orbit under $f$. The combinatorial information that comes from possible permutations of the vertices gives rise to an irreducible representation of $S_n$. Using the algebraic information it is shown that $f$ must have periodic orbits of certain periods. Finally, a family of maps is defined which shows that the result about periods is best possible if $n=2^k+2^l$ for $k, l \geq 0$.
Citation: Chris Bernhardt. Vertex maps for trees: Algebra and periods of periodic orbits. Discrete & Continuous Dynamical Systems - A, 2006, 14 (3) : 399-408. doi: 10.3934/dcds.2006.14.399
[1]

Peng Luo. Comparison theorem for diagonally quadratic BSDEs. Discrete & Continuous Dynamical Systems - A, 2020  doi: 10.3934/dcds.2020374

[2]

Mark F. Demers. Uniqueness and exponential mixing for the measure of maximal entropy for piecewise hyperbolic maps. Discrete & Continuous Dynamical Systems - A, 2021, 41 (1) : 217-256. doi: 10.3934/dcds.2020217

[3]

Alberto Bressan, Sondre Tesdal Galtung. A 2-dimensional shape optimization problem for tree branches. Networks & Heterogeneous Media, 2020  doi: 10.3934/nhm.2020031

[4]

Marion Darbas, Jérémy Heleine, Stephanie Lohrengel. Numerical resolution by the quasi-reversibility method of a data completion problem for Maxwell's equations. Inverse Problems & Imaging, 2020, 14 (6) : 1107-1133. doi: 10.3934/ipi.2020056

2019 Impact Factor: 1.338

Metrics

  • PDF downloads (33)
  • HTML views (0)
  • Cited by (6)

Other articles
by authors

[Back to Top]