Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Iterating Sine, Equivalence Classes of Variable Changes, and Groups with Few Conjugacy Classes

Iterating Sine, Equivalence Classes of Variable Changes, and Groups with Few Conjugacy Classes

Thumbnail Image
Download
Name

283_2025_Article_10415.pdf

Size

1.17 MB

Format

Adobe PDF

Checksum (MD5)

c50ce98dbb625fea2e58d57c3b451dd5

Download all files submitted through automated deposit
art_9153937232392741106.zip (831.37 KB)
Author(s)
Etingof, Pavel
Date Issued
July 23, 2025
Journal
The Mathematical Intelligencer
Publisher
Springer US
Citation
Etingof, P. Iterating Sine, Equivalence Classes of Variable Changes, and Groups with Few Conjugacy Classes. Math Intelligencer (2025).
Version
Final published version
Abstract
This is an expository paper about iterations of a
smooth real function f on [0, ) such that f(0) = 0, f E (0) = 1, and f(x) < x for x > 0, i.e., the sequence defined by xn+1 = f(xn). This sequence has interesting asymptotics, whose study leads to the question of classifying conjugacy classes in the group of formal changes of variable y = f(x), i.e., formal series f(x) = x + a2x2 + a3x2 + ⋯ with real coefficients (under composition). The same classification applies over a finite field p for suitably truncated series f, defining a family of p-groups that have the smallest number of conjugacy classes for a given order, i.e., are the “most noncommutative” finite groups currently known. The paper should be accessible to undergraduates and at least partially to advanced high school students.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/163770
DOI of Published Version
https://doi.org/10.1007/s00283-025-10415-z
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.