Loading...
Please wait, while we are loading the content...
Similar Documents
The Complexity of Maximal Cofinitary Groups
| Content Provider | Semantic Scholar |
|---|---|
| Author | Kastermans, Bart |
| Copyright Year | 2008 |
| Abstract | A cofinitary group is a subgroup of the infinite symmetric group in which each element of the subgroup has at most finitely many fixed points. A maximal cofinitary group is a cofinitary group that is maximal with respect to inclusion. We investigate the possible complexities of maximal cofinitary groups. In particular we show that (1) under the axiom of constructibility there exists a coanalytic maximal cofinitary group and (2) there does not exist an eventually bounded maximal cofinitary group. We also suggest some further directions for investigation. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ams.org/journals/proc/2009-137-01/S0002-9939-08-09526-9/S0002-9939-08-09526-9.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Fixed point (mathematics) Maximal set Subgroup A Nepoviruses |
| Content Type | Text |
| Resource Type | Article |
