Polynomial entropy on the $n$-fold symmetric product and its suspension
Ma\v{s}a {\DJ}ori\'c

TL;DR
This paper investigates how polynomial entropy behaves under symmetric product and suspension operations for homeomorphisms with finite chain recurrent sets, establishing exact values and bounds.
Contribution
It proves that polynomial entropy scales linearly with the number of symmetric products and provides bounds for the suspension case under specific conditions.
Findings
Polynomial entropy of the induced map on the n-fold symmetric product equals n times the original.
Polynomial entropy of the suspension map equals n times the original polynomial entropy.
Provides a lower bound for polynomial entropy on the suspension when the homeomorphism has wandering points.
Abstract
We prove that the polynomial entropy of the induced map on the -fold symmetric product of a compact space and its suspension are both equal to , when is a homeomorphism with a finite chain recurrent set . We also give a lower bound for the polynomial entropy on the suspension, for a homeomorphism with at least one wandering point, under certain assumptions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Differential Equations and Dynamical Systems · Advanced Mathematical Theories and Applications
