Skip to main content
Log in

Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Given a t-uniform hypergraph H on k vertices and an assignment of integers f(T) to the t -subsets T of a v-set X, vk + t, we give necessary and sufficient conditions for the existence of an assignment of integer multiplicities h(G) to those subhypergraphs G of the complete t-uniform hypergraph on v vertices that are isomorphic to H so that the sum of the integers h(G) over those G that contain T is f(T). Our main theorem is stated in terms of integral matrices. As a consequence of our main theorem, e also determine a diagonal form, and hence the p-rank for all primes p, for the incidence matrix of t-subsets versus subhypergraphs isomorphic to H.

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. A. E. Brouwer and C. A. van Eijl, On the p-rank of the adjacency matrices of strongly regular graphs, J. Alg. Combinatorics, Vol. 1 (1992) pp. 329-346.

    Google Scholar 

  2. R. L. Graham, S.-Y. R. Li, and W.-C. W. Li, On the structure of t-designs, SIAM J. Alg. Disc. Meth., Vol. 1 (1980) pp. 8-14.

    Google Scholar 

  3. P. Frankl, Intersection theorems and mod p rank of inclusion matrices, J. Combinatorial Theory, Ser. A, Vol. 54 (1990) pp. 85-94.

    Google Scholar 

  4. J. E. Graver and W. B. Jurkat, The module structure of integral designs. J. Combinatorial Theory, Vol. 15 (1973) pp. 75-90.

    Google Scholar 

  5. G. D. James, A characteristic-free approach to the representation theory of Sn, J. Algebra, Vol. 46 (1977) pp. 430-450.

    Google Scholar 

  6. A. Schrijver, Theory of Linear and Integer Programming, Wiley (1986).

  7. R. M. Wilson, The necessary conditions for t-designs are sufficient for something, Utilitas Mathematics, Vol. 4 (1973) pp. 207-217.

    Google Scholar 

  8. R. M. Wilson, Decompositions of complete graphs into subgraphs isomorphic to a given graph, Proc. Fifth British Combinatorial Conference (C. St. J. A. Nash-Williams and J. Sheehan, eds.), Congressus Numerantium, XV, Utilitas Mathematica Publ. (1975) pp. 647-659.

  9. R. M. Wilson, A diagonal form for the incidence matrices of t-subsets vs. k-subsets, Europ. J. Combinatorics, Vol. 11 (1990) pp. 609-615.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wilson, R.M. Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices. Designs, Codes and Cryptography 17, 289–297 (1999). https://doi.org/10.1023/A:1026443629848

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026443629848

Keywords

Navigation