Skip to main content

A problem in the design of electrical circuits, a generalized subadditive inequality and the recurrence relation j(n,m)=j([n/2],m)+j([n+1/2],m)+j(n,m–1)

Part of the Lecture Notes in Mathematics book series (LNM,volume 622)

Abstract

The problem of designing an electrical circuit with the smallest number of make and break switches which will allow a current to flow when m (or more)out of n voters close their switches (vote yes) is discussed. An upper bound j(n,m) for this number is obtained as the maximal solution of a generalized subadditive inequality which is then shown to satisfy the recurrence relation of the title. It is shown how to find explicit solutions of this equation and asymptotic solutions are also found. A second, direct construction gives another upper bound and the two upper bounds are compared, j(n,m) being the better for m small in comparison with n. Problems involving other voting procedures are also considered.

Keywords

  • Recurrence Relation
  • Electrical Circuit
  • Asymptotic Solution
  • Maximal Solution
  • Vote Procedure

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hammersley, J.M. Generalization of the fundamental theorem on subadditive functions. Proc. Camb. Phil. Soc. 58(1962), 235–238.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Hammersley, J.M., and Grimmett, G.R. Maximal Solutions of the Generalized Subadditive Inequality. In Stochastic Geometry, ed. Kendall, D.G. and Harding, E.F., J. Wiley, London (1974).

    Google Scholar 

  3. Hart, S. A Note on the Edges of the n-cube. Discrete Maths. 14(1976) 157–163.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Mendelson, E. Introduction to Mathematical Logic. D. van Nostrand, Princeton (1964).

    Google Scholar 

  5. Morris, R. Some Theorems on Sorting. SIAM J. Appl. Math. 17(1969), 1–6.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1977 Springer-Verlag

About this paper

Cite this paper

Pelling, M.J., Rogers, D.G. (1977). A problem in the design of electrical circuits, a generalized subadditive inequality and the recurrence relation j(n,m)=j([n/2],m)+j([n+1/2],m)+j(n,m–1). In: Little, C.H.C. (eds) Combinatorial Mathematics V. Lecture Notes in Mathematics, vol 622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069190

Download citation

  • DOI: https://doi.org/10.1007/BFb0069190

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08524-9

  • Online ISBN: 978-3-540-37020-8

  • eBook Packages: Springer Book Archive