English

Approximation of integration over finite groups, difference sets and association schemes

Combinatorics 2020-07-23 v2

Abstract

Let GG be a finite group and f:GCf:G \to {\mathbb C} be a function. For a non-empty finite subset YGY\subset G, let IY(f)I_Y(f) denote the average of ff over YY. Then, IG(f)I_G(f) is the average of ff over GG. Using the decomposition of ff into irreducible components of CG{\mathbb C}^G as a representation of G×GG\times G, we define non-negative real numbers V(f)V(f) and D(Y)D(Y), each depending only on ff, YY, respectively, such that an inequality of the form IG(f)IY(f)V(f)D(Y)|I_G(f)-I_Y(f)|\leq V(f)\cdot D(Y) holds. We give a lower bound of D(Y)D(Y) depending only on #Y\#Y and #G\#G. We show that the lower bound is achieved if and only if #{(x,y)Y2x1y[a]}/#[a]\#\{(x,y)\in Y^2 \mid x^{-1}y \in [a]\}/\#[a] is independent of the choice of the conjugacy class [a]G[a]\subset G for a1a \neq 1. We call such a YGY\subset G as a pre-difference set in GG, since the condition is satisfied if YY is a difference set. If GG is abelian, the condition is equivalent to that YY is a difference set. We found a non-trivial pre-difference set in the dihedral group of order 16, where no non-trivial difference set exists. The pre-difference sets in non-abelian groups of order 16 are classified. A generalization to commutative association schemes is also given.

Keywords

Cite

@article{arxiv.1903.00697,
  title  = {Approximation of integration over finite groups, difference sets and association schemes},
  author = {Hiroki Kajiura and Makoto Matsumoto and Takayuki Okuda},
  journal= {arXiv preprint arXiv:1903.00697},
  year   = {2020}
}

Comments

20 pages

R2 v1 2026-06-23T07:56:15.767Z