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

preprint2020arXivOpen access

Abstract

Let GG be a finite group and f:G→Cf:G \to {\mathbb C} be a function. For a non-empty finite subset Y⊂GY\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)∈Y2∣x−1y∈[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 a≠1a \neq 1. We call such a Y⊂GY\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.