English

On partitions of G-spaces and G-lattices

Combinatorics 2021-11-01 v2

Abstract

Given a GG-space XX and a non-trivial GG-invariant ideal II of subsets of XX, we prove that for every partition X=A1AnX=A_1\cup\dots\cup A_n of XX into n2n\ge 2 pieces there is a piece AiA_i of the partition and a finite set FGF\subset G of cardinality Fϕ(n+1):=max1<x<n+1xn+1x1x1|F|\le \phi(n+1):=\max_{1<x<n+1}\frac{x^{n+1-x}-1}{x-1} such that G=FΔ(Ai)G=F\cdot \Delta(A_i) where Δ(Ai)={gG:gAiAiI}\Delta(A_i)=\{g\in G:gA_i\cap A_i\notin I\} is the difference set of the set AiA_i. Also we investigate the growth of the sequence ϕ(n)=max1<x<nxnx1x1\phi(n)=\max_{1<x<n}\frac{x^{n-x}-1}{x-1} and show that lnϕ(n)=nW(ne)2n+nW(ne)+W(ne)n+O(lnnn)\ln \phi(n)=nW(ne)-2n+\frac{n}{W(ne)}+\frac{W(ne)}{n}+O\big(\frac{\ln n}n\big) where W(x)W(x) is the Lambert W-function, defined implicitly as W(x)eW(x)=xW(x)e^{W(x)}=x. This shows that ϕ(n)\phi(n) grows faster that any exponent ana^n but slower than the sequence of factorials n!n!.

Keywords

Cite

@article{arxiv.1303.1427,
  title  = {On partitions of G-spaces and G-lattices},
  author = {Taras Banakh and Oleksandr Ravsky and Sergiy Slobodianiuk},
  journal= {arXiv preprint arXiv:1303.1427},
  year   = {2021}
}

Comments

21 pages + 12 pages in Appendix