This paper introduces a polynomial criterion for identifying abelian difference sets by linking them to solutions of polynomial equations, and explores implications for testing Boolean bent functions.
Contribution
It establishes a novel correspondence between abelian difference sets and solutions to polynomial systems, providing new tools for their analysis and for Boolean function testing.
Findings
01
Characterizes difference sets via polynomial solutions
02
Provides tests for Boolean bent functions
03
Links algebraic structures with combinatorial properties
Abstract
Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the special structure of the group ring of an abelian group to establish a one-to one correspondence of the class of difference sets with specific parameters in that group with the set of all complex solutions of a specified system of polynomial equations. The correspondence also develops some tests for a Boolean function to be a bent function.
D is a (v,k,λ) difference set in G⇔DD(−1)−λG−(k−λ)=0⇔ϕG(κD+I)=0⇔κD+I=0⇔κD∈I.
D is a (v,k,λ) difference set in G⇔DD(−1)−λG−(k−λ)=0⇔ϕG(κD+I)=0⇔κD+I=0⇔κD∈I.
κD=
κD=
−λ(i1,⋯,it)∈S∑X1i1⋯Xtit−(k−λ).
f(X1,…,Xt)=g(X1,…,Xt)+r(X1,…,Xt)
f(X1,…,Xt)=g(X1,…,Xt)+r(X1,…,Xt)
r(X1,…,Xt)=j=0∑nt−1rj(X1,…,Xt−1)Xtj
r(X1,…,Xt)=j=0∑nt−1rj(X1,…,Xt−1)Xtj
Ψ=
Ψ=
−λ(i1,…,it)∈S∑X1i1⋯Xtit−(k−λ)
Pi1⋯it(α)=0 for all (i1,…,it)∈S⇔αi1⋯it∈{0,1} for all (i1,…,it)∈S⇔α is a point representation of D⊂G where D={(i1+n1Z,…,it+ntZ):(i1,…,it)∈S and αi1⋯it=1}.
Pi1⋯it(α)=0 for all (i1,…,it)∈S⇔αi1⋯it∈{0,1} for all (i1,…,it)∈S⇔α is a point representation of D⊂G where D={(i1+n1Z,…,it+ntZ):(i1,…,it)∈S and αi1⋯it=1}.
α is a point representation of a (v,k,λ) difference set D in G
α is a point representation of a (v,k,λ) difference set D in G
⟺Theorem 2.2α is a point representation of D⊂G and
κD(X1,…,Xt)∈I
⟺α is a point representation of D⊂G and
Ψ(X,α)∈I
⟺by Theorem 3.2 (1)Pi1⋯it(α)=0 for all (i1,…,it)∈S and
Ψ(X,α)∈I
⟺Theorem 3.1, Lemma 3.1Pi1⋯it(α)=0 for all (i1,…,it)∈S and
Ψ(X,α)∈I(V(I))
⟺since U=V(I)Pi1⋯it(α)=0 for all (i1,…,it)∈S and
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.
Full text
Polynomial Criterion for Abelian Difference Sets
Pradipkumar H. Keskar and Priyanka Kumari
Department of Mathematics, Birla Intitute of Technology and Science Pilani (Pilani Campus), Pilani 333031, India
Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the special structure of the group ring of an abelian group to establish a one-to one correspondence of the class of difference sets with specific parameters in that group with the set of all complex solutions of a specified system of polynomial equations. The correspondence also develops some tests for a Boolean function to be a bent function.
Key Words : Difference Set; Group Ring; Point Representation; Ideal Membership; Bent Function.
MSC 2010 : 05B10, 11T71, 13P99.
1. Introduction
For a finite group G of order v and nonnegative integers k,λ, a subset D of G is called a (v,k,λ)difference set in G if for every g∈G∖{e},
[TABLE]
where e is the identity of G. Moreover, if G is abelian then D is called an abelian difference set.
The notion of a difference set was introduced independently by J. Singer [10] and R. C. Bose [2] while investigating finite geometries and (statistical) design of experiments respectively. Later the ideas were found fruitful having several relations to areas such as coding theory and cryptography. Bent functions, which are cryptographically significant, are characterized on page 95 of [11] in terms of difference sets as follows . For an even positive integer t>2, a Boolean function of t variables (that is, a function from (Z/2Z)t to (Z/2Z)) is a bent function if and only if its support is a (2t,2(t−1)±2(t−2)/2,2(t−2)±2(t−2)/2) difference set in (Z/2Z)t(where signs are chosen consistently). Hence the construction, characterization, equivalence of difference sets is a useful exercise having applications for the analysis of bent functions.
Among the different tools used to study difference sets are symmetric designs and group rings. In this paper, we will be concerned with the characterization of a difference set using an equality in a group ring, which we now describe.
Let G be a finite group and R be a commutative ring with unit element 1 different from its additive identity [math]. The group ring RG of G over R is the ring
[TABLE]
where ∑g∈Grgg=∑g∈Grg∗g⟺rg=rg∗ for all g∈G, with the addition defined by ∑g∈Grgg+∑g∈Grg∗g=∑g∈G(rg+rg∗)g and the multiplication defined by (∑g∈Grgg)(∑g∈Grg∗g)=∑g∈G(∑xy=grxry∗)g.
For any D⊂G, we denote ∑g∈Dg∈RG by D again and ∑g∈Dg−1∈RG by D(−1). The following is a characterization of a difference set in a finite group G.
Group Ring Criterion : Let G be a finite group of order v and k,λ be nonnegative integers with k≤v. Then D⊂G is a (v,k,λ) difference set in G if and only if as elements of CG, we have DD(−1)=λG+(k−λ)e, where e is the identity element of G.
(In most of the literature, for instance [1], the characterization is proved under extra assumption that ∣D∣=k. This assumption can be seen to be superfluous, as it is implied by either of the above two conditions. It is enough to note that if DD(−1)=λG+(k−λ)e, then by comparing the coefficient of e on both sides, we get ∣D∣=k.)
In this paper, we exploit the structure of the group ring of an abelian finite group G as an affine C-algebra to obtain two algebraic criteria for a subset of G to be a (v,k,λ) difference set. The first criterion, Theorem 2.2 of Section 2, is in terms of an ideal membership problem. The second, Theorem 3.2 of Section 3, is via verification of some polynomial equations. These processes can also be crystalised to give tests for a subset of an abelian group to be a (v,k,λ) difference set. The first test is verifiable using ideal theory or algebra softwares like Macaulay 2, while the second test is verifiable by explicit computations with complex numbers, especially the roots of unity. Section 4 deals with generalization of these criteria to generalized difference sets. We illustrate the use of the criteria for difference sets through some examples in Section 5. The first two illustrate these tests for difference sets. The third illustrates how the polynomial criterion can be used to prove that a quadratic Boolean function is a bent function. In a future work we plan to explore the more of potential applications of these methods to the theory of bent functions.
Ideal theoretic methods, in particular Gröbner basis methods, are being widely applied to several problems in Science and Engineering, see [4]. More specifically, we can find their applications to Combinatorics in [5], [6], [7], [9]. In this paper, we introduce these methods to study difference sets.
2. Ideal membership problem for abelian difference sets
Let G be a finite abelian group. Then G≅Cn1×Cn2×⋯×Cnt where Cnl=⟨gl⟩ is a cyclic group of order nl. Let R=C[X1,…,Xt], I be ideal (X1n1−1,…,Xtnt−1) of R and S={(i1,…,it)∈Zt:0≤il≤nl−1 for all 1≤l≤t}. Regarding the structure of CG, we have the following
Theorem 2.1**.**
Let G≅Cn1×Cn2×⋯×Cnt where Cnl=⟨gl⟩ is a cyclic group of order nl. Then the map ϕG:IR→CG defined by
[TABLE]
is an isomorphism of IR onto CG, where
[TABLE]
Proof : First we show that ϕG is well defined. Assume f1(X1,…,Xt)+I=f2(X1,…,Xt)+I for f1=f1(X1,…,Xt) and f2=f2(X1,…,Xt)∈R.
Then f1−f2∈I and hence
[TABLE]
for u1(X1,…,Xt),…,ut(X1,…,Xt)∈R. This, in turn, implies that
[TABLE]
as glnl−1=0 for all 1≤l≤t.
Hence ϕG(f1+I)=ϕG(f2+I), therefore ϕG is well defined.
Next, ϕG is clearly C−algebra homomorphism onto CG.
Now CG has dimension n1⋯nt as C−vector space, as {g1i1⋯gtit:0≤il≤nl−1 for all 1≤l≤t} is a basis for CG. Also IR has dimension n1⋯nt as {X1i1⋯Xtit:0≤il≤nl−1 for all 1≤l≤t} is a basis for IR. This shows that ϕG is an isomorphism. ∎
As a consequence of Theorem 2.1, we can make several identifications. First, the group ring CG can be identified with the affine space Cn1⋯nt by identifying ∑(i1,…,it)∈Sαi1⋯itg1i1⋯gtit with (αi1⋯it:(i1,…,it)∈S) in a fixed order on S, say lexicographic order. Second, any subset T of G can be identified with the point in Cn1⋯nt corresponding to ∑g∈Tg∈CG; it will be called *the point representation (or characteristic point) of * T and it is a vertex of the unit hypercube of Cn1⋯nt. Third, T can also be represented by the unique polynomial f=f(X1,…,Xt)∈R such that ϕG(f+I)=(∑g∈Tg) and either f=0 or degXl(f)<nl for all 1≤l≤t. We call f the polynomial representation of T and denote it by ρG(T) or ρG(T)(X1,…,Xt).
Here onwards, by using the isomorphism of G with Cn1×⋯×Cnt and fixed isomorphisms of Cnl with (nlZZ) for all 1≤l≤t, we will identify G with ∏l=1t(nlZZ). Moreover for any T⊂G, we let T∗={(i1,…it)∈S:(i1+n1Z,…,it+ntZ)∈T}.
The above relationships can be captured by the following equalities :
[TABLE]
where (αi1⋯it:(i1,…,it)∈S) is a point representation of T.
Using these representations, Group Ring Criterion of Section 1 can be rephrased as an ideal membership problem (refer p. 94 of [4]) in C[X1,…,Xt] as follows.
Theorem 2.2**.**
Let κD=κD(X1,…,Xt)∈C[X1,…,Xt] be defined by
[TABLE]
Then a subset D⊂G is a (v,k,λ) difference set in G if and only if κD∈I.
Proof :
[TABLE]
Now
[TABLE]
∎
Note : Alternatively we can write
[TABLE]
where α=(αi1…it:(i1,…,it)∈S) is the point representation of D.
3. System of Polynomial equations for difference sets in an Abelian group
The results of Section 2 can be rephrased to provide a criterion for (v,k,λ) difference sets in an abelian group of order v in terms of some polynomial equations. More specifically, we will find a set of polynomials in C[{Ai1⋯it:(i1,…,it)∈S}] whose zero set in Cn1⋯nt is exactly the set of all the point representations of all (v,k,λ) difference sets in G.
First some terminology and preparation. For any J⊂C[X1,…,Xt], let V(J)={(x1,…,xt)∈Ct:f(x1,…,xt)=0 for all f(X1,…,Xt)∈J}. For any W⊂Ct, let I(W)={f(X1,…,Xt)∈C[X1,…,Xt]:f(x1,…,xt)=0 for all (x1,…,xt)∈W}. Then it can easily be seen that I(W) is an ideal in C[X1,…,Xt]. For any ideal J of C[X1,…,Xt], the radical of J is given by J={f=f(X1,…,Xt)∈C[X1,…,Xt]:fn∈J for some positive integer n}. It can be seen that for any ideal J of C[X1,…,Xt], J is an ideal of C[X1,…,Xt]. An ideal J of C[X1,…,Xt] is called a radical ideal if J=J. For the following famous theorem, see [4], p. 175.
Theorem 3.1**.**
(Hilbert Nullstellensatz)* If J is any ideal of C[X1,…,Xt] then I(V(J))=J.*
We will use the following corollary of Hilbert Nullstellensatz.
Corollary 3.1**.**
Let f=f(X1,…,Xt)∈C[X1,…,Xt] and J be a radical ideal of C[X1,…,Xt]. Then f∈J if and only if f(x1,…,xt)=0 for all (x1,…,xt)∈V(J).
In order to use Corollary 3.1, we prove the following
Lemma 3.1**.**
The ideal I=(X1n1−1,…,Xtnt−1) of C[X1,…,Xt] is a radical ideal.
Proof : Clearly I⊂I. Now let f(X1,…,Xt)∈I be any element. We want to show that f=f(X1,…,Xt)∈I. We can write
[TABLE]
such that g(X1,…,Xt)∈I and r(X1,…,Xt)∈C[X1,…,Xt] satisfies r(X1,…,Xt)=0 or degXir(X1,…,Xt)<ni for all i=1,2,…,t.
It is enough to show that r(X1,…,Xt)=0. We can write
[TABLE]
with rj(X1,…,Xt−1)∈C[X1,…,Xt−1]
such that for any 0≤j<nt, we have rj(X1,…,Xt−1)=0 or degXirj(X1,…,Xt−1)<ni for all 1≤i≤t−1. Consider any (ξ1,…,ξt−1)∈Ct−1 with ξini=1 for all 1≤i≤t−1. Since f∈I=I(V(I)) and for all 0≤l≤nt−1, (ξ1,…,ξt−1,ent2πil)∈V(I), we have f(ξ1,…,ξt−1,ent2πil)=0. Moreover, since g∈I, g(ξ1,…,ξt−1,ent2πil)=0 for all 0≤l≤nt−1. Thus r(ξ1,…,ξt−1,ent2πil)=0 for all l=0,1,…,nt−1. Assume r(ξ1,…,ξt−1,Xt)=0. Since degXtr(ξ1,…,ξt−1,Xt)<nt and it has nt distinct roots, we get a contradiction. Hence r(ξ1,…,ξt−1,Xt)=0 and therefore for any 0≤j<nt, we have rj(ξ1,…,ξt−1)=0 for any (ξ1,…,ξt−1)∈Ct−1 with ξini=1 for all i=1,2,…,t−1. Iterating the argument with r replaced by rj etc, we get that r=0. ∎
Now we are prepared to discuss the main result of this paper. Let Δ denote the polynomial ring C[X1,…,Xt][{Ai1⋯it:(i1,…,it)∈S}] in n1⋯nt independent variables Ai1⋯it:(i1,…,it)∈S over C[X1,…,Xt]
and let U={(ξ1,…,ξt)∈Ct:ξini=1 for all 1≤i≤t}. To simplify the notation, let A=(Ai1⋯it:(i1,…,it)∈S), X=(X1,…,Xt). Also if αi1⋯it∈C for all (i1,…,it)∈S, we let α=(αi1⋯it:(i1,…,it)∈S)∈Cn1⋯nt.
Then we have the following
Theorem 3.2**.**
Let Ψ=Ψ(X,A)∈Δ be defined by
[TABLE]
Then we have the following :
(1)
For α=(αi1⋯it:(i1,…,it)∈S)∈Cn1⋯nt, α is a point representation of a subset of G if and only if α satisfies the system Pi1⋯it(A)=0,(i1,…,it)∈S of polynomial equations where for (i1,…,it)∈S,Pi1⋯it(A)=Ai1⋯it2−Ai1⋯it.
2. (2)
For α=(αi1⋯it:(i1,…,it)∈S)∈Cn1⋯nt, α is a point representation of a (v,k,λ) difference set in G if and only if α satisfies the equations Pi1⋯it(A)=0 for all (i1,…,it)∈S, and Ψ(ξ,A)=0 for all ξ=(ξ1,…,ξt)∈U.
**Proof :**Note that (1) follows, as for any α=(αi1⋯it:(i1,…,it)∈S)∈Cn1⋯nt,
[TABLE]
To prove (2), first note that κD(X1,…,Xt)=Ψ(X,α) where α is the point representation of D⊂G. Thus, for any α∈Cn1⋯nt,
[TABLE]
∎
Note : The ideas of this section are analogous to interpolation of polynomials, in the sense that every postulation of a zero of a polynomial puts a condition on the parameters occurring in its coefficients.
Remark on C-algebra homomorphisms : For any ξ=(ξ1,…,ξt)∈U, let θ(ξ1,…,ξt):C[X1,…,Xt]→C be a C-algebra homomorphism defined by θ(ξ1,…,ξt)(f(X1,…,Xt))=f(ξ1,…,ξt) and let θ(ξ1,…,ξt)Δ:Δ→Δ be the unique extension of θ(ξ1,…,ξt) to a C-algebra homomorphism such that θ(ξ1,…,ξt)Δ(Ai1⋯it)=Ai1⋯it for all (i1,…,it)∈S. That is, for any Ω(X,A)∈Δ,
[TABLE]
Moreover, for any α∈Cn1…nt, let τα:Δ→C[X1,…,Xt] be a ring homomorphism defined by τα(Ω(X,A))=Ω(X,α) for all Ω(X,A)∈Δ. Note that if α is the point representation of D⊂G and ξ=(ξ1,…,ξt)∈U,
[TABLE]
Hence, in view of (2.1∗), it follows that if α is the point representation of D⊂G and ξ=(ξ1,…,ξt)∈U, then
[TABLE]
Alternatively, as a consequence of the conclusions of Theorem 3.2, for a subset D of G, D is a (v,k,λ) difference set if and only if
[TABLE]
Sharpening of Ryser Condition : A necessary condition for the existence of (v,k,λ) difference set is λ(v−1)=k(k−1), as discovered by Ryser. Note that this condition is nothing but θ(ξ1,…,ξt)Δ(Ψ)(α)=0 for (ξ1,…,ξt)=(1,…,1), where α is the point representation of some set D⊂G of size k. The condition is clearly not sufficient. However, when an abelian group G of order v is given as a direct sum of cyclic groups, the necessary as well as sufficient condition for existence of a (v,k,λ) difference set in G is the consistency of the system of equations Pi1⋯it(A)=0 for all (i1,…,it)∈S and θ(ξ1,…,ξt)Δ(Ψ)(A)=0 for all (ξ1,…,ξt)∈U in the variables A=(Ai1⋯it:(i1,…,it)∈S). In the parlance of Gröbner bases (see page 171 of [4]), the condition be reformulated as
Gröbner Basis Version of Existence Problem : There exists a (v,k,λ) difference set in G if and only if the reduced Gröbner basis (in any monomial order) of the ideal generated by Pi1⋯it(A) for all (i1,…,it)∈S and θ(ξ1,…,ξt)Δ(Ψ)(A) for all (ξ1,…,ξt)∈U in C[{Ai1⋯it:(i1,…,it)∈S}] is not equal to {1}.
4. Generalization of the criteria
The criteria developed in Sections 2 and 3 can be generalized to generalized difference sets in finite abelian groups. Following [3], we proceed to define a generalized difference set thus. For a finite group G0 of order v, let D0,M0⊂G0 be such that ∣D0∣=k>1,∣M0∣>0. For any g∈G0, let λg=∣{(d1,d2)∈D0×D0:g=d1d2−1}∣. If λ1,λ2 are nonnegative integers, D0 is called a (v,∣M0∣,k,λ1,λ2)-generalized difference set of G0 related to M0 if for any nonidentity element g∈G0
[TABLE]
This is a generalization of a difference set in the following sense. If M0={e} for the identity element e of G0 and λ1=0 then any (v,∣M0∣,k,λ1,λ2)-generalized difference set of G0 related to M0 is exactly a (v,k,λ2) difference set of G0. Other special cases of generalized difference set give several important variations of a difference set in G0. For instance, if M0 is a subgroup of G0 and λ1=0, then D0 is called a (v,∣M0∣,k,λ2)relative difference set of G0 with relative to M0. We say D0 is a (v,k,λ1,λ2) partial difference set in G0 if M0=D0. Generalized difference sets are helpful in computation of autocorrelation of certain arrays, see [3]. Partial difference sets have connections with strongly regular graphs, see [8]. With this in mind, we state the polynomial criterion for the generalized difference sets as a consequence of the group ring criterion ([3], Theorem 2), the proof is analogous to Theorem 3.2.
Theorem 4.1**.**
Let M⊂G and let Ψ∗=Ψ∗(X,A)∈Δ be defined by
[TABLE]
*Then we have the following : *
For α=(αi1…it:(i1,…,it)∈S)∈Cn1⋯nt, α is a point representation of a (v,∣M∣,k,λ1,λ2) generalized difference set in G related to M if and only if Pi1⋯it(α)=0 for all (i1,…,it)∈S and Ψ∗(ξ,α)=0 for all ξ=(ξ1,…,ξt)∈U.
5. Illustrations of the criteria
In this section, we illustrate the use of the criteria developed in sections 2 and 3. The purpose of the illustrations is just to show how the ideas developed in previous sections can potentially be used. As the outcomes of these illustrations are well known or can be proved by other means, some of the arguments, which are repetitive in nature, are left to the reader.
Illustration 1 : Let G=(4ZZ)×(4ZZ). We verify that the subset D={(0,1),(0,2),(0,3),(1,0),(2,0),(3,0)} of G is a (16,6,2) difference set in G.
Method 1 : Ideal Membership Problem
By Theorem 2.2, we need to see that κD(X1,X2)∈I=(X14−1,X24−1). This can be done by verifying that the remainder of κD(X1,X2) mod I is [math]. The following Macaulay 2 code does this.
The point representation α=(αij:(i,j)∈S) of D is given by
[TABLE]
As αij∈{0,1}, Pij(α)=0,(i,j)∈S.
Next, we verify that θ(ξ1,ξ2)Δ(Ψ)(α)=0 for all (ξ1,ξ2)∈U, where
U={±1,±i}2.
For sake of brevity, we verify one of the equations of Theorem 3.2 when (ξ1,ξ2)=(i,−i)∈U. The equations corresponding to the remaining 15 elements of U can be verified to establish that D is a (16,6,2) difference set in G.
Note that θ(ξ1,ξ2)Δ(Ψ)(α)=Ψ(i,−i,α). Also
[TABLE]
In particular, when (u,v)=(i,−i), since
[TABLE]
we get
[TABLE]
The reader may also verify directly by definition that D is a (16,6,2) difference set in G.
Illustration 2 : Let D={(0,1),(0,2),(0,3),(1,0),(2,0),(1,1)}⊂G=(4ZZ)×(4ZZ). We can show that D is not a (16,6,2) difference set in G just by verifying that Ψ(1,−1,α)=−4=0 for the point representation α of D.
Illustration 3 (An application to bent functions) This illustration provides the glimpse of the use of Theorem 3.2 to prove some results about bent functions. Let t=2m for a positive integer m and β:(Z/2Z)t→(Z/2Z) be a Boolean function defined by β(x1,…,xm,y1,…,ym)=∑i=1mxiyi where xi,yi∈(Z/2Z) are any elements for any i=1,…,m. We illustrate the proof, using Theorem 3.2, that β is a bent function with ∣D∣=2(t−1)−2(t−2)/2 where D=support of β.
The proof can be given by induction on m. The cases m=1,2,3 can be verified easily. For the inductive step, let m≥4. Then we can write m=m1+m2 with min(m1,m2)≥2. For any i∈{1,2}, let ti=2mi, Gi=(Z/2Z)ti and let βi:Gi→(Z/2Z) be defined by
β1(g1)=∑i=1m1xiyi for any g1∈G1, where g1=(x1,…,xm1,y1,…,ym1); xi,yj∈(Z/2Z) for all 1≤i,j≤m1 and β2(g2)=∑i=1m2xm1+iym1+i for any g2=(xm1+1,…,xm,ym1+1,…,ym);xi,yj∈(Z/2Z) for all m1+1≤i,j≤m. By induction hypothesis, β1,β2 are bent functions with ∣Di∣=2(ti−1)−2(ti−2)/2 where Di=support of βi.
Let G=G1×G2. Identifying g=(g1,g2)∈G with (x1,…,xm,y1,…,ym)∈(Z/2Z)t, G gets identified with (Z/2Z)t. Then β(g1,g2)=β1(g1)+β2(g2) for any g1∈G1,g2∈G2 .
We need to show that β is a bent function with domain G and ∣D∣=2(t−1)−2(t−2)/2 for D=support of β.
We start the proof with
Observations :
(1)
Let Hi⊂Gi=(Z/2Z)ri for i∈{1,2} and let H=H1×H2⊂G1×G2. Then
Let ξ∈C be a primitive nth root of unity. Then ∑i=0n−1ξi=0.
3. (3)
By Observations (1) and (2), if (ξ1,…,ξt)∈{−1,1}t∖{(1,…,1)}, then θ(ξ1,…,ξt)(ρG(G))=∑(i1,⋯,it)∈Sξ1i1⋯ξtit=0.
Now Di is a (2ti,2(ti−1)−2(ti−2)/2,2(ti−2)−2(ti−2)/2) difference set for i∈{1,2}. In order to show that β is a bent function, it is enough to show that D satisfies the conditions in Theorem 3.2 (b). Let α be the point representation of D. Then by Theorem 3.2 (a), Pi1…it(α)=0 for all (i1,…,it)∈S. Using (3.1∗), we will show that Ψ(ξ,α)=0 for all ξ=(ξ1,…,ξt)∈U. Now D=(D1×D2)∪(D1×D2), where Di is the complement of Di in (Z/2Z)ti for all i∈{1,2}, and the union is disjoint. Hence by Observation (1)
[TABLE]
Therefore
[TABLE]
We make three cases.
Case (i) :
[TABLE]
In view of Observation (3), θ(ξ1,…,ξt1)(ρG1(D1))=−θ(ξ1,…,ξt1)(ρG1(D1)) and θ(ξ(t1+1),…,ξ(t1+t2))(ρG2(D2))=−θ(ξ(t1+1),…,ξ(t1+t2))(ρG2(D2)). Since ni=2 for all i=1,…,t1 in the equalities of Theorem 3.2, it follows that θ(ξ1,…,ξt1)(ρG1(D1(−1)))=θ(ξ1,…,ξt1)(ρG1(D1)).
Similarly θ(ξ(t1+1),…,ξ(t1+t2))(ρG2(D2(−1)))=θ(ξ(t1+1),…,ξ(t1+t2))(ρG2(D2)) and θ(ξ1,…,ξt)(ρG(D(−1)))=θ(ξ1,…,ξt)(ρG(D)). Since each Di is a (2ti,2(ti−1)−2(ti−2)/2,2(ti−2)−2(ti−2)/2) difference set for i∈{1,2}, as a consequence of (3.1∗) and Observation (3)
[TABLE]
Hence by (5.1),
[TABLE]
where k=2t−1−2(t−2)/2,λ=2t−2−2(t−2)/2. Since (ξ1,…,ξt)∈{−1,1}t∖{(1,…,1)}, θ(ξ1,…,ξt)(ρG(G))=0, and hence, by (3.1∗), Ψ(ξ,α)=0 for the point representation α of D.
Case (ii) :
[TABLE]
Then
[TABLE]
Hence by (5.1),
[TABLE]
By (3.1*) and Observation (3), θ(ξ(t1+1),…,ξ(t1+t2))(ρG2(D2))2=2t2−1−2t2−2. Also θ(ξ1,…,ξt1)(ρG1(D1))=∣D1∣=2t1−1−2(t1−2)/2. By substituting these in the above expression and then expanding, we get
[TABLE]
where k=2t−1−2(t−2)/2 and λ=2t−2−2(t−2)/2. Since (ξ1,…,ξt)=(1,…,1), we see that θ(ξ1,…,ξt)(ρG(G))=0 and hence by (3.1∗), Ψ(ξ,α)=0 for the point representation α of D.
Similar argument works when (ξ1,…,ξt1)∈{−1,1}t2∖{(1,…,1)} and (ξ(t1+1),…,ξ(t1+t2))=(1,…,1)∈Ct2.
Case (iii):
[TABLE]
Then we have
[TABLE]
Substituting in (5.1), in view of (3.1∗), showing D is a (2t1+t2,2t1+t2−1−2(t1+t2−2)/2,2t1+t2−2−2(t1+t2−2)/2) difference set reduces to proving the following equality :
If t1,t2≥4 are even integers then
[TABLE]
Now to prove this equality,
[TABLE]
Simplifying further,
[TABLE]
More simplification gives
[TABLE]
This proves that β is a bent function. ∎
Conclusion : In this paper, we have proved two algebraic criteria for a (v,k,λ) difference set in a given abelian group of order v. Illustrations are provided indicating how they can be applied. Further applications are being planned.
Acknowledgements : Both the authors thank the support from FIST Programme vide SR/FST/MSI-090/2013 of DST, Govt. of India. The second author thanks UGC, Govt of India for the support under JRF Programme (SR. No. 2061540979, Ref. No. 21/06/2015(1)EU-V R. No. 426800). Both the authors thank S. Gangopadhyay and B. Mandal of IIT, Roorkee for stimulating discussions.
Bibliography11
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Beth, T., Jungnickel, D., Lenz, H. Design Theory, Volume 1 Cambridge University Press, 1999.
2[2] Bose, R. C. On the construction of balanced incomplete block designs, Annals of Eugenics, vol. 9, p. 358-399, 1939 .
3[3] Cao, X., Sun, D. Some nonexistence results on generalized difference sets, Applied Mathematics Letters, vol. 21 no. 8, p. 797-802, 2008 .
4[4] Cox, D., Little, J. and O’Shea, D. Ideals,Varieties and Algorithms, Springer Verlag, New York Inc, 1992 .
5[5] Felszeghy, B., Ráth, B. and Rónyai, L. The lex game and some applications, Journal of Symbolic Computation, vol. 41, p. 663–681, 2006.
6[6] Felszeghy, B. and Rónyai, L. Some meeting points of Gröbner bases and combinatorics, Algorithmic Algebraic Combinatorics and Gröbner bases (M. Klin, G. A. Jones, A. Jurisic, M. Muzychuk, I. Ponomarenko editors) , p. 207–227, Springer, 2009.
7[7] Kreuzner, M. and Robbiano, L. Computational Commutative Algebra 2 , Springer, 2005.
8[8] Ma, S. A survey of partial difference sets, Designs, Codes and Cryptography, vol. 4, p. 221-261, 1994.