Skip to main content
Log in

Counting corners in partitions

  • Published:
The Ramanujan Journal Aims and scope Submit manuscript

Abstract

A partition of a positive integer \(n\) is a non-increasing sequence of positive integers whose sum is \(n\). It may be represented by a Ferrers diagram. These diagrams contain corners which are points of degree two. We define corners of types \((a,b)\), \((a+,b)\) and \((a+,b+)\), and also define the size of a corner. Via a generating function, we count corners of each type and corners of size \(m\). We also find asymptotics for the number of corners as \(n\) tends to infinity.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Ahlgren, S., Lovejoy, J.: The arithmetic of partitions into distinct parts. Mathematika 48(1–2), 191–202 (2001)

    MathSciNet  Google Scholar 

  2. Alon, N.: Restricted integer partition functions. Integers 13, A16 (2013)

    Google Scholar 

  3. Andrews, G.E.: The Theory of Partitions, Addison-Wesley, Reading 1976; reprinted. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  4. Andrews, G.E.: Two theorems of Euler and a general partition theorem. Proc. Am. Math. Soc. 20, 499–502 (1969)

    Article  MATH  Google Scholar 

  5. Glaisher, J.W.L.: A theorem in partitions. Messenger Math. 12, 158–170 (1883)

    Google Scholar 

  6. Grabner, P., Knopfmacher, A., Wagner, S.: A general asymptotic scheme for moments of partition statistics, accepted to special issue of Combinatorics, Probability and Computing dedicated to Philippe Flajolet.

  7. Hirschorn, M.: The number of different parts in the partitions of \(n\), Fibonacci Quarterly, to appear.

  8. Remmel, J.B.: Bijective proofs of some classical partition identities. J. Combin. Theory Ser. A 33(3), 273–286 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  9. Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences, published electronically at http://oeis.org (2010)

  10. Wilf, H.S.: Three problems in combinatorial asymptotics. J. Combin. Theory Ser. A 35, 199–207 (1983)

  11. Wilf, H.S.: Identically Distributed Pairs of Partition Statistics. Seminaire Lotharingien, The European digital Mathematics Library, 44, B44c, p. 3 (2000)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Charlotte Brennan.

Additional information

Charlotte Brennan and Arnold Knopfmacher were supported by the National Research Foundation under Grant Numbers 86329 and 81021, respectively.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Blecher, A., Brennan, C., Knopfmacher, A. et al. Counting corners in partitions. Ramanujan J 39, 201–224 (2016). https://doi.org/10.1007/s11139-014-9666-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11139-014-9666-4

Keywords

Mathematics Subject Classification

Navigation