DyckPath from OrderedTree

An ordered tree as the Dyck path of its depth-first contour: an up step into each child, a down step out.

OrderedTree → DyckPathinverse

FindStat's Mp00051. The inverse of OrderedTree(DyckPath).

Called as CombinatorialMap(x, "DyckPath"). The head's page has its examples.

Live

Explore

Each element of OrderedTree at a size, and its image, applied in your browser; sizes past 6 are not offered.

Size

Properties

Sizes 1 to

Transport a statistic

Pick a statistic on DyckPath. Its distribution over the images of OrderedTree at each size is computed, and compared with the 21 statistics on OrderedTree: those that share it are the ones the map sends it to, as far as the sizes computed show.

Statistic HeightPeaksValleysDoubleRisesReturnsTouchPointCountInteriorReturnsHillsInitialRiseMajorIndexAreaCoareaLongestAscentLongestDescentDinvBounceBounceCountDinvDeficitBounceDeficitFirstComponentSemilengthDownStepHeightProductValleysAboveAxisOccurrencesOfDDUOccurrencesOfUUUOccurrencesOfUDUPeakHeightSumPeakHeightExcessPeakHeightSquareSumPeakHeightProductLastUpStepPositionFirstDownStepPositionLastDoubleRisePositionRisesOfLengthOneMinimalRiseRisesOfLengthAtLeastTwoUpStepsAtOddPositionsUpStepsAfterLastDoubleRiseDoubleRisePositionSumDoubleFallPositionSumMacMahonEqualIndexLogarithmicHeightFirstMaximalPeakPositionGlobalMaximaLargestAreaSequenceEntryUpStepsAtEvenPositionsUpperInteractionsPyramidWeightCenteredTunnelsLeftTunnelsNestedCenteredTunnelPairsNestedLeftTunnelPairsValleyTunnelSemilengthSumCenteredMultitunnelsRisesOfLengthTwoRisesOfLengthThreeRisesOfLengthAtLeastThreeRunsOfLengthOneRisesOfLengthOneAtOddHeightPeakRectangleAreaSumSkewHookPositionSumDownStepMajorIndexUpStepMajorIndexLongestZigzagBicoloredMotzkinHeightBicoloredMotzkinLevelStepsMinimalValleyHeightHillsOfSizeTwoHillsOfSizeThreeMinimalPeakHeightPeakLeftToRightMaximaWeakPeakLeftToRightMaximaBoxWeightMiddleNonRunHeightSymmetryDegreeParkingFunctionCountValleyPositionSumInteractionDifferenceNonFinalConstantRunsOfLengthAtLeastTwoLongTunnelsHalfMacMahonEqualIndexBoxesBelowOnePeakBoxesBelowAtLeastTwoPeaksDoubleStepVisiblePointsAreaAboveBouncePathWeaklyBelowDyckPathCountProperlyBelowDyckPathCountWeaklyAboveDyckPathCountProperlyAboveDyckPathCountWeaklyAboveLatticePathCountNorthStepOrderingCountThreeCatalanPathCountParallelogramPolyominoAreaParallelogramPolyominoNormalizedAreaParallelogramPolyominoMinimalColumnHeightParallelogramPolyominoMaximalColumnHeightParallelogramPolyominoInnerCornersParallelogramPolyominoUpperInnerCornersSetValuedTableauNaturalDescentsSetValuedTableauComajorIndexAdjointInvariantDescentsDiagonalStandardMonomialDegreeNoncrossingMergeableSingletonPairsNakayamaGlobalDimensionFirstSimpleProjectiveDimensionSimpleProjectiveDimensionSumSimpleProjectiveDimensionProductSimplesOfMaximalProjectiveDimensionSimplesOfProjectiveDimensionTwoSimplesOfProjectiveDimensionThreeSimplesOfProjectiveDimensionFourSimplesOfProjectiveDimensionAtMostTwoSimplesOfProjectiveDimensionAtMostThreeSimplesOfProjectiveDimensionAtMostFourSimplesOfEvenProjectiveDimensionSimplesOfMaximalEvenProjectiveDimensionHalfEvenSimpleProjectiveDimensionSumFirstSimpleOfMaximalProjectiveDimensionLastSimpleOfMaximalProjectiveDimensionPeaksMinusNakayamaGlobalDimensionInjectiveProjectiveDimensionSumInjectivesOfProjectiveDimensionOneInjectivesOfProjectiveDimensionAtMostOneInjectivesOfProjectiveDimensionAtMostTwoInjectivesOfMaximalProjectiveDimensionInjectivesOfProjectiveDimensionOneBelowMaximalInjectivesOfEvenProjectiveDimensionModulesOfMaximalProjectiveDimensionModulesOfProjectiveDimensionAtMostOneInjectivesOfProjectiveDimensionTwoModulesOfProjectiveDimensionTwoTwoDimensionalModulesOfProjectiveDimensionOneThreeDimensionalModulesOfProjectiveDimensionOneSecondToLastInjectiveProjectiveDimensionSimpleSummandsOfSecondRadicalLayerNakayamaDominantDimensionNakayamaGlobalMinusDominantDimensionPeaksMinusNakayamaDominantDimensionInjectivesOfCodominantDimensionEqualToGlobalDimensionInjectivesOfCodominantDimensionAtLeastTwoNonProjectiveInjectiveCodominantDimensionSumProjectiveMinusCodominantDimensionSumSimplesOfNonMaximalProjectiveDimensionNonProjectiveInjectiveProjectiveDimensionSpreadProjectivesOfMaximalInjectiveDimensionSimplesOfEqualProjectiveAndInjectiveDimensionModulesOfMaximalProjectiveAndInjectiveDimensionModulesOfProjectiveAndInjectiveDimensionAtMostOneModulesOfProjectiveOrInjectiveDimensionAtMostOneModulesOfProjectiveAndInjectiveDimensionAtLeastTwoMaximalSimpleProjectiveAndInjectiveDimensionSumMaximalModuleProjectiveAndInjectiveDimensionSumSimplesOfSmallInjectiveDimensionOrPositiveDominantDimensionSimplesOfDominantDimensionEqualToGlobalDimensionSimplesOfDominantDimensionAtLeastThreeMaximalSimpleDominantDimensionUnitIntervalGraphTwinVerticesNonProjectiveInjectiveToNonInjectiveProjectiveHomDimensionDualRegularModuleFirstExtensionDimensionRadicalEndomorphismDimensionRadicalSelfExtensionDimensionRadicalToSquaredRadicalExtensionDimensionSocleToRadicalExtensionDimensionRegularModuloSocleToRadicalExtensionDimensionMaximalFirstExtensionWithRegularModuleModulesOfVanishingFirstExtensionWithRegularModuleSimplesOfVanishingSecondExtensionWithRegularModuleMaximalSecondExtensionOfSimplesWithRegularModuleSimplesOfTwoDimensionalSecondExtensionWithRegularModuleInjectivesOfNonVanishingSecondExtensionWithRegularModuleInjectivesOfNonMaximalSocleProjectiveDimensionMinusProjectiveInjectivesSocleSimplesOfVanishingFirstExtensionWithRegularModule Sizes 1 to

Also from

The same name out of other carriers, each its own implementation: BinaryTree.

FindStat Mp00051

to Dyck path

Matched by value: our map agrees with FindStat's image on each of the 197 rows of size at most 6 we can read (0 unread; its table has 1200 rows).

BijectionGraded mapas FindStat records them, checked by FindStat's contributors.

Return the Dyck path of the corresponding ordered tree induced by the recurrence of the Catalan numbers, see [[wikipedia:Catalan_number]].

Object	Image
[]	[]
[[]]	[1,0]
[[[]]]	[1,1,0,0]
[[],[]]	[1,0,1,0]

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/Mp00051 has the rest.