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

Abstract

Let G be a finite group and f:G C be a function. For a non-empty finite subset Y⊂ G, let IY(f) denote the average of f over Y. Then, IG(f) is the average of f over G. Using the decomposition of f into irreducible components of CG as a representation of G× G, we define non-negative real numbers V(f) and D(Y), each depending only on f, Y, respectively, such that an inequality of the form |IG(f)-IY(f)|≤ V(f)· D(Y) holds. We give a lower bound of D(Y) depending only on \#Y and \#G. We show that the lower bound is achieved if and only if \#\(x,y)∈ Y2 x-1y ∈ [a]\/\#[a] is independent of the choice of the conjugacy class [a]⊂ G for a ≠ 1. We call such a Y⊂ G as a pre-difference set in G, since the condition is satisfied if Y is a difference set. If G is abelian, the condition is equivalent to that Y 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…