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$$m. We also find asymptotics for the number of corners as n tends to infinity.
Original language | English |
---|---|
Pages (from-to) | 201-224 |
Number of pages | 24 |
Journal | Ramanujan Journal |
Volume | 39 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2016 |
Bibliographical note
Publisher Copyright:© 2015, Springer Science+Business Media New York.
Keywords
- Asymptotics
- Corners
- Generating functions
- Partitions
ASJC Scopus subject areas
- Algebra and Number Theory