DurfeeSquare
The side of the Durfee square: the largest d with at least d parts of size at least d.
✓ checked against that system · ! checked, with disagreements (hover a chip)Wikipedia
Durfee squareMathWorldDurfeeSquareWikidataQ5316364FindStatSt000183via IntegerPartition✓DurfeeSquare(partition)The side of the Durfee square: the largest d with at least d parts of size at least d.Combinatorica
DurfeeSquare[partition]SageMathenumeratio_stat("IntegerPartition", partition, "DurfeeSquare")Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer_partition) -> number | combinatorics | always |
Details
- Defined over
IntegerPartitionas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
IntegerPartitionand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer.
Definition
Epsil, as the implementation runs it.
on IntegerPartition, over _x
0 if Length(_x) < 1 else Count(Filter(
Range(1, Length(_x)),
Function(_x[i] >= i, i),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Checked against | Combinatorica 2 agreeSageMath 5 agree |
| Crosswalk | WikipediaMathWorldWikidataFindStatCombinatoricaSageMath |
Implementation
mapped
combinatoricapackages/oracle/src/mappings.tsmapped
sagepackages/oracle/src/mappings.ts