On the size of sets avoiding a general structure
Runze Wang

TL;DR
This paper determines bounds on the size of subsets in finite abelian groups that necessarily contain a shifted version of a given subset, using probabilistic methods to establish these bounds.
Contribution
It introduces new bounds on the minimal size of subsets avoiding a specific structure in finite abelian groups, employing probabilistic techniques.
Findings
Derived upper and lower bounds for N_{G,S}
Bounds depend on the stabilizer of S and group size
Probabilistic method effectively estimates subset sizes
Abstract
Given a finite abelian group and a subset , we let be the smallest integer such that for any subset with elements, we have for some . Using the probabilistic method, we prove that \begin{align*} \frac{|H_G(S)|-1}{|H_G(S)|}|G|+\Biggl\lceil\biggl(\frac{|G|}{|H_G(S)|}\biggr)^{1-|H_G(S)|/|S|}\Biggr\rceil\le N_{G,\ S}\le \biggl\lfloor\frac{|S|-1}{|S|}|G|\biggr\rfloor+1, \end{align*} where is the stabilizer of .
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
TopicsAdvanced Topology and Set Theory · Mathematical Dynamics and Fractals · Limits and Structures in Graph Theory
