A combinatorial generalization of the Durfee square
<p>The Durfee square of a partition <em>λ, D(λ)</em>, is defined as the largest square contained in the shape of <em>λ</em>.</p><p>It was proved in [2] (cf. also [3]) that the size of <em>D(λ), d(λ)</em>, was related to the perfection of a certai...
Main Author: | Maria Artale |
---|---|
Format: | Article |
Language: | English |
Published: |
Università degli Studi di Catania
2007-12-01
|
Series: | Le Matematiche |
Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/19 |
Similar Items
-
Partitions and Durfee dissection
by: Wei-Yueh Chen, et al.
Published: (2003) -
A follow-up study of the commercial graduates of the classes of 1943-47 of the BMC Durfee High School Fall River, Massachusetts
by: Hogan, Katherine Lydia
Published: (2016) -
The construction and combinatorial properties of Latin squares and balanced sequences
by: Narayan, L.
Published: (1958) -
Geometrical and combinatorial generalizations of the associahedron
by: Manneville, Thibault
Published: (2017) -
Combinatorial Aspects of the Generalized Euler's Totient
by: Nittiya Pabhapote, et al.
Published: (2010-01-01)