Approximation of integration over finite groups, difference sets and association schemes
Hiroki Kajiura, Makoto Matsumoto, Takayuki Okuda

TL;DR
This paper develops a framework for approximating integrals over finite groups using subset averages, introduces the concept of pre-difference sets, and classifies such sets in certain non-abelian groups, extending to association schemes.
Contribution
It introduces the notion of pre-difference sets, provides bounds for approximation errors, and classifies these sets in non-abelian groups of order 16, extending the theory to association schemes.
Findings
Established bounds for approximation errors in finite group integrals.
Identified conditions characterizing pre-difference sets.
Classified pre-difference sets in non-abelian groups of order 16.
Abstract
Let be a finite group and be a function. For a non-empty finite subset , let denote the average of over . Then, is the average of over . Using the decomposition of into irreducible components of as a representation of , we define non-negative real numbers and , each depending only on , , respectively, such that an inequality of the form holds. We give a lower bound of depending only on and . We show that the lower bound is achieved if and only if is independent of the choice of the conjugacy class for . We call such a as a pre-difference set in , since the condition is satisfied if is a difference set. If is abelian,…
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
TopicsMathematical Approximation and Integration · graph theory and CDMA systems · Finite Group Theory Research
