Skip to main content
Log in

Improving the Existence Bounds for Grid-Block Difference Families

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, by employing Weil’s Theorem on multiplicative character sums, an intermediate algebraic consequence on the existence bound of an element satisfying certain cyclotomic conditions in a finite field is proposed. In many cases, this approach improves the bound due to Buratti and Pasotti (Finite Fields Appl 15(3), 332–344, 2009), which can be widely used for showing the asymptotic existence of combinatorial designs with point-regular automorphisms. Moreover, this approach is applied to improving the existence bound for grid-block difference families, which can be regarded as generalizations of difference families.

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.

Similar content being viewed by others

References

  1. Abel, R.J.R., Buratti, M.: Difference families. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, vol. Chap. VI. 16, 2nd edn, pp. 392–410. CRC Press, Boca Raton (2006)

    Google Scholar 

  2. Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (1976)

    MATH  Google Scholar 

  3. Buratti, M., Pasotti, A.: Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Appl. 15(3), 332–344 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, K., Wei, R., Zhu, L.: Existence of \((q, 7, 1)\) difference families with \(q\) a prime power. J. Comb. Des. 10(2), 126–138 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen, K., Zhu, L.: Existence of \((q, 6, 1)\) difference families with \(q\) a prime power. Des. Codes Cryptogr. 15(2), 167–173 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen, K., Zhu, L.: Improving Wilson’s bound on difference families. Util. Math. 55, 189–200 (1999)

    MathSciNet  MATH  Google Scholar 

  7. Du, D.Z., Hwang, F.: Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing. World Scientific, Singapore (2006)

    Book  MATH  Google Scholar 

  8. Fu, H.L., Hwang, F., Jimbo, M., Mutoh, Y., Shiue, C.: Decomposing complete graphs into \(K_r \times K_c\)’s. J. Stat. Plan. Inference 119(2), 225–236 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lamken, E.R., Wilson, R.M.: Decompositions of edge-colored complete graphs. J. Comb. Theory Ser. A 89(2), 149–200 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  11. Lu, X.N., Satoh, J., Jimbo, M.: Grid-block difference families and related combinatorial structures. Manuscript submitted for publication (2016)

  12. Wang, C., Colbourn, C.J.: The existence of \((K_2 \times K_6)\)-designs. Graphs Comb. 29(5), 1557–1567 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  13. Wilson, R.M.: Cyclotomy and difference families in elementary abelian groups. J. Number Theory 4(1), 17–47 (1972)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported in part by JSPS under Grant-in-Aid for JSPS Fellows No. 26011700.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiao-Nan Lu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lu, XN. Improving the Existence Bounds for Grid-Block Difference Families. Graphs and Combinatorics 33, 549–559 (2017). https://doi.org/10.1007/s00373-017-1776-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-017-1776-5

Keywords

Mathematics Subject Classification

Navigation