DecompositionReverse from DyckPath

Split a path as U A D B at its first return, and swap the pieces, recursively: U B' D A'.

DyckPath → DyckPathinvolution

FindStat's Mp00101, an involution. It is the binary tree's left-right symmetry carried across the Dyck-path bijection.

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

Live

Explore

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

Size

Properties

Sizes 1 to

Transport a statistic

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

Statistic HeightPeaksValleysDoubleRisesReturnsTouchPointCountInteriorReturnsHillsInitialRiseMajorIndexAreaCoareaLongestAscentLongestDescentDinvBounceBounceCountDinvDeficitBounceDeficitFirstComponentSemilengthDownStepHeightProductValleysAboveAxisOccurrencesOfDDUOccurrencesOfUUUOccurrencesOfUDUPeakHeightSumPeakHeightExcessPeakHeightSquareSumPeakHeightProductLastUpStepPositionFirstDownStepPositionLastDoubleRisePositionRisesOfLengthOneMinimalRiseRisesOfLengthAtLeastTwoUpStepsAtOddPositionsUpStepsAfterLastDoubleRiseDoubleRisePositionSumDoubleFallPositionSumMacMahonEqualIndexLogarithmicHeightFirstMaximalPeakPositionGlobalMaximaLargestAreaSequenceEntryUpStepsAtEvenPositionsUpperInteractionsPyramidWeightCenteredTunnelsLeftTunnelsNestedCenteredTunnelPairsNestedLeftTunnelPairsValleyTunnelSemilengthSumCenteredMultitunnelsRisesOfLengthTwoRisesOfLengthThreeRisesOfLengthAtLeastThreeRunsOfLengthOneRisesOfLengthOneAtOddHeightPeakRectangleAreaSumSkewHookPositionSumDownStepMajorIndexUpStepMajorIndexLongestZigzagBicoloredMotzkinHeightBicoloredMotzkinLevelStepsMinimalValleyHeightHillsOfSizeTwoHillsOfSizeThreeMinimalPeakHeightPeakLeftToRightMaximaWeakPeakLeftToRightMaximaBoxWeightMiddleNonRunHeightSymmetryDegreeParkingFunctionCountValleyPositionSumInteractionDifferenceNonFinalConstantRunsOfLengthAtLeastTwoLongTunnelsHalfMacMahonEqualIndexBoxesBelowOnePeakBoxesBelowAtLeastTwoPeaksDoubleStepVisiblePointsAreaAboveBouncePathWeaklyBelowDyckPathCountProperlyBelowDyckPathCountWeaklyAboveDyckPathCountProperlyAboveDyckPathCountWeaklyAboveLatticePathCountNorthStepOrderingCountThreeCatalanPathCountParallelogramPolyominoAreaParallelogramPolyominoNormalizedAreaParallelogramPolyominoMinimalColumnHeightParallelogramPolyominoMaximalColumnHeightParallelogramPolyominoInnerCornersParallelogramPolyominoUpperInnerCornersSetValuedTableauNaturalDescentsSetValuedTableauComajorIndexAdjointInvariantDescentsDiagonalStandardMonomialDegreeNoncrossingMergeableSingletonPairsNakayamaGlobalDimensionFirstSimpleProjectiveDimensionSimpleProjectiveDimensionSumSimpleProjectiveDimensionProductSimplesOfMaximalProjectiveDimensionSimplesOfProjectiveDimensionTwoSimplesOfProjectiveDimensionThreeSimplesOfProjectiveDimensionFourSimplesOfProjectiveDimensionAtMostTwoSimplesOfProjectiveDimensionAtMostThreeSimplesOfProjectiveDimensionAtMostFourSimplesOfEvenProjectiveDimensionSimplesOfMaximalEvenProjectiveDimensionHalfEvenSimpleProjectiveDimensionSumFirstSimpleOfMaximalProjectiveDimensionLastSimpleOfMaximalProjectiveDimensionPeaksMinusNakayamaGlobalDimensionInjectiveProjectiveDimensionSumInjectivesOfProjectiveDimensionOneInjectivesOfProjectiveDimensionAtMostOneInjectivesOfProjectiveDimensionAtMostTwoInjectivesOfMaximalProjectiveDimensionInjectivesOfProjectiveDimensionOneBelowMaximalInjectivesOfEvenProjectiveDimensionModulesOfMaximalProjectiveDimensionModulesOfProjectiveDimensionAtMostOneInjectivesOfProjectiveDimensionTwoModulesOfProjectiveDimensionTwoTwoDimensionalModulesOfProjectiveDimensionOneThreeDimensionalModulesOfProjectiveDimensionOneSecondToLastInjectiveProjectiveDimensionSimpleSummandsOfSecondRadicalLayerNakayamaDominantDimensionNakayamaGlobalMinusDominantDimensionPeaksMinusNakayamaDominantDimensionInjectivesOfCodominantDimensionEqualToGlobalDimensionInjectivesOfCodominantDimensionAtLeastTwoNonProjectiveInjectiveCodominantDimensionSumProjectiveMinusCodominantDimensionSumSimplesOfNonMaximalProjectiveDimensionNonProjectiveInjectiveProjectiveDimensionSpreadProjectivesOfMaximalInjectiveDimensionSimplesOfEqualProjectiveAndInjectiveDimensionModulesOfMaximalProjectiveAndInjectiveDimensionModulesOfProjectiveAndInjectiveDimensionAtMostOneModulesOfProjectiveOrInjectiveDimensionAtMostOneModulesOfProjectiveAndInjectiveDimensionAtLeastTwoMaximalSimpleProjectiveAndInjectiveDimensionSumMaximalModuleProjectiveAndInjectiveDimensionSumSimplesOfSmallInjectiveDimensionOrPositiveDominantDimensionSimplesOfDominantDimensionEqualToGlobalDimensionSimplesOfDominantDimensionAtLeastThreeMaximalSimpleDominantDimensionUnitIntervalGraphTwinVerticesNonProjectiveInjectiveToNonInjectiveProjectiveHomDimensionDualRegularModuleFirstExtensionDimensionRadicalEndomorphismDimensionRadicalSelfExtensionDimensionRadicalToSquaredRadicalExtensionDimensionSocleToRadicalExtensionDimensionRegularModuloSocleToRadicalExtensionDimensionMaximalFirstExtensionWithRegularModuleModulesOfVanishingFirstExtensionWithRegularModuleSimplesOfVanishingSecondExtensionWithRegularModuleMaximalSecondExtensionOfSimplesWithRegularModuleSimplesOfTwoDimensionalSecondExtensionWithRegularModuleInjectivesOfNonVanishingSecondExtensionWithRegularModuleInjectivesOfNonMaximalSocleProjectiveDimensionMinusProjectiveInjectivesSocleSimplesOfVanishingFirstExtensionWithRegularModule Sizes 1 to

FindStat Mp00101

decomposition reverse

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

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

This map is recursively defined as follows.

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

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