Please use this identifier to cite or link to this item:
Title: Subsets close to invariant subsets for group actions
Authors: Brailovsky, Leonid.
Pasechnik, Dmitrii V.
Praeger, Cheryl E.
Keywords: DRNTU::Science::Mathematics::Applied mathematics
Issue Date: 1995
Source: Brailovsky, L., Pasechnik, D. V., & Praeger, C. E. (1995). Subsets close to invariant subsets for group actions. Proceedings of the American Mathematical Society, 123(8), 2283-2295.
Series/Report no.: Proceedings of the American Mathematical Society
Abstract: Let G be a group acting on a set Ω and k a non-negative integer. A subset (finite or infinite) A ⊆ Ω is called k-quasi-invariant if |Ag \ A| ≤k for every g ∈ G. It is shown that if A is k-quasi-invariant for k ≥1 , then there exists an invariant subset Γ⊆Ω such that |A Δ Γ | < 2ek [(In 2k)]. Information about G-orbit intersections with A is obtained. In particular, the number m of G-orbits which have non-empty intersection with A , but are not contained in A , is at most 2k — 1 . Certain other bounds on |A Δ Γ |, in terms of both m and k , are also obtained.
DOI: 10.1090/S0002-9939-1995-1307498-3
Rights: © 1995 American Mathematical Society. This paper was published in Proceedings of the American Mathematical Society and is made available as an electronic reprint (preprint) with permission of American Mathematical Society. The paper can be found at :[DOI:].One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
36. Subsets close to invariant subsets for group actions.pdf1.14 MBAdobe PDFThumbnail

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.