Skip to main content
Log in

Polynomial Criterion for Abelian Difference Sets

  • Published:
Indian Journal of Pure and Applied Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Beth, D. Jungnickel, and H. Lenz, Design theory, Vol. 1 Cambridge University Press, Cambridge (1999).

    Book  Google Scholar 

  2. R. C. Bose On the construction of balanced incomplete block designs, Ann. Eugenic., 9 (1939), 358–399.

    Article  MathSciNet  Google Scholar 

  3. X. Cao and D. Sun, Some nonexistence results on generalized difference sets, Appl. Math. Lett., 21(8) (2008), 797–802.

    Article  MathSciNet  Google Scholar 

  4. D. Cox, J. Little, and D. O’Shea D. Ideals, varieties and algorithms, Springer Verlag, New York Inc (1992).

    Book  Google Scholar 

  5. B. Felszeghy, B. Ráth, and L. Rónyai, The lex game and some applications, J. Symb. Comput., 41 (2006), 663–681.

    Article  MathSciNet  Google Scholar 

  6. B. Felszeghy and L. Rónyai, 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), Springer-Verlag, Berlin Heidelberg (2009), 207–227.

  7. M. Kreuzner and L. Robbiano, Computational commutative algebra 2, Springer, (2005).

    Google Scholar 

  8. S. Ma, A survey of partial difference sets, Design Code Cryptogr, 4 (1994), 221–261.

    Article  MathSciNet  Google Scholar 

  9. L. Rónyai and T. Mészáros, Some combinatorial applications of Gröbner bases, Algebraic informatics (Franz Winkler Ed.), 4th International Conference, CAI 2011, Linz, Proceedings; Springer LNCS 6742, Springer-Verlag, Berlin Heidelberg (2011), 65–83.

    Chapter  Google Scholar 

  10. J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc., 43 (1938), 377–385.

    Article  MathSciNet  Google Scholar 

  11. D. R. Stinson, Combinatorial designs: Construction and analysis, Springer Verlag, New York Inc (2004).

    MATH  Google Scholar 

Download references

Acknowledgement

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pradipkumar H. Keskar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Keskar, P.H., Kumari, P. Polynomial Criterion for Abelian Difference Sets. Indian J Pure Appl Math 51, 233–249 (2020). https://doi.org/10.1007/s13226-020-0397-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13226-020-0397-5

Key words

2010 Mathematics Subject Classification

Navigation