AlternatingComplement from BinaryWord

Every second letter swapped for the other, starting with the second.

BinaryWord → BinaryWordinvolution

FindStat's Mp00158, "alternating inverse", an involution.

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

Live

Explore

Each element of BinaryWord 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 BinaryWord. Its distribution over the images of BinaryWord at each size is computed, and compared with the 59 statistics on BinaryWord: those that share it are the ones the map sends it to, as far as the sizes computed show.

Statistic HammingWeightLeadingOnesCountOnePositionSumOneRunCountOddOneRunCountLongestRunOfOnesChangeCountPathDepthOnesMinusZerosBalancedPrefixCountSymmetryDegreeAscentsInversionsMajorIndexLongestConstantRunLongestAlternatingFactorFirstOnePositionAfterAppendedOneDecimalRepresentationDecimalRepresentationWithLeadingOneDistinctFactorCountBorderLengthSymmetricBorderLengthInversionSumNonInversionSumStrictlyIncreasingRunsMinimalPeriodBorderCountWeakMajorIndexDistinctSubsequenceCountRepetitionExponentBalanceShortestPalindromicDecompositionLengthPalindromicDecompositionCountLongestCatalanFactorSemilengthCatalanFactorCountCriticalStepCountInternalInversionsUniqueFactorLengthLyndonFactorizationLengthLongestYamanouchiPrefixLongestPalindromicPrefixLongestPalindromicFactorLongestPalindromicSubsequenceDistinctCubeCountDistinctSquareCountCyclicShiftIndexDescentWordPreimageCountLatticePathsAboveWordCountSameEndpointPathsAboveWordCountEvenPalindromicPrefixHalfLengthOddPalindromicPrefixHalfLengthLongestPalindromicFactorStartingWithOneReverseComplementFactorHalfLengthReverseComplementFactorHalfLengthStartingWithOneFlexModularMajorIndexValleyFillingDegreeBaselineCrossingsPrimitiveFactorCount Sizes 1 to

FindStat Mp00158

alternating inverse

Matched by value: our map agrees with FindStat's image on each of the 126 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.

Sends a binary word $w_1\cdots w_m$ to the binary word $v_1 \cdots v_m$ with $v_i = w_i$ if $i$ is odd and $v_i = 1 - w_i$ if $i$ is even.

Object	Image
0	0
1	1
00	01
01	00

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