# Alternative for conjugate of partition for restricted partitions (eg fixed num. parts)

I am working on a combinatorics library of mine, where Partitions and Compositions are also included. For unrestricted partitions, the definition of conjugate partition is fine. Conjugates are used in some transformations that swap between LEX and COLEX orderings.

Now I would like to use same principles for restricted partitions (eg with fixed number of parts). But in this case, the definition of conjugate/transpose partition produces partitions which are outside the class of partitions required (i.e no more with fixed num of parts, but with fixed greater part).

Ideally, I would expect "restricted conjugate" of $$(5311)$$ (LEX) to be $$(3331)$$ (COLEX), or alternatively the "restricted conjugate" of $$(4222)$$ (REVLEX) would be $$(3331)$$ (COLEX). Both are fine for what is needed, I can use any of the two (both cannot hold at the same time).

Is there an extension or alternative to the usual conjugate/transpose of a partition that maintains the restrictions applied (i.e maintains number of parts, maximum part, minimum part)?

• For a given positive integer $p$, the Mullineux map is an involution on the set of all $p$-regular partitions (i.e., partitions that contain no number more than $p-1$ times). It has a rather complicated definition, but in some sense is a $p$-analogue of conjugation. See, e.g., C. Bessenrodt, J. B. Olsson, On Residue Symbols and the Mullineux Conjecture, Journal of Algebraic Combinatorics 7 (1998), pp. 227--251. Jul 1, 2021 at 16:24
• Thanks I will look into it. Jul 1, 2021 at 16:29
• Read the reference you suggested, plus Ana Bernal. On self-Mullineux and self-conjugate partitions. The Electronic Journal of Combinatorics,Open Journal Systems, 2021, 10.37236/9283. hal-02363011v2 which contains many definitions not contained in former. However I dont see how it applies to this case, unless it is too much for me to digest at this point. If you have an idea how it applies here, feel free to add an answer. Jul 5, 2021 at 11:19
• Oh, you're right; you're talking about different classes of partitions. Maybe this gives a chance of something simpler working for them. Jul 5, 2021 at 11:25
• A thing of interest is that for such an alternative conjugate algorithm, the conjugate of the conjugate is not the same as the original partition. In other words the function is not its own inverse, unlike the usual conjugate function via ferres diagram See (3331) (LEX) (6211) (COLEX) (6211) (LEX) (4222) (COLEX) Jul 5, 2021 at 11:30

Here's a modified conjugation that fixes the number of parts. I'll describe it in terms of Ferrers diagrams.

Conjugate the partition. If the result has $$k$$ too few rows (parts), turn the first $$k$$ columns into rows. For instance, with $$k=4$$, 3322 has conjugate 442 and then the mapping gives 3331---removing the leftmost column from 442 leaves 331 and that removed column became another 3. (This column-to-row operation is known as Bulgarian Solitaire.)

If the conjugate has too many rows, remove the partition from the $$(k+1)$$st row down, conjugate it, and append it to the remaining four rows. E.g., still with $$k = 4$$, 6411 has conjugate 422211 with 11 below the intended 4 rows; the conjugate of the small partition (guaranteed to have at most 4 parts) is 2 so the mapping gives 6222.

If the result of conjugation has the desired number of rows, you're done!

The map definitions may need tweaking and there are certainly details to check (for at least the two examples and a few small $$n$$ for which I worked everything out, this is an involution).

By the way, this made me think of Wilf partitions, where the (nonzero) multiplicities of its parts are all different. This class is closed by the involution that swaps parts and multiplicities, e.g., 422111 or $$4^1 2^2 1^3$$ becomes $$3221111$$ or $$3^1 2^2 1^4$$.

• Nice, I have thought of some extensions of conjugation that preserve number of parts. However the conjugation needed in this case is not an involution as seen in the LEX/COLEX examples (assuming they are related by a kind of conjugation). Fixed num parts is only one of the restrictions supported for partitions, others are fixed min part anf fixed max part (and all combinations of those). Any idea how applying conjugate can accomodate these restrictions? Jul 9, 2021 at 13:03
• @NikosM. Let me just say that if you require too many restrictions, then only the identity map will work. In your example of 4-part partitions of 10, fixing both largest and smallest part means that most of the partitions can only be mapped to themselves, with switching only possible in the pairs 4411 & 4321 and 5311 & 5221. Jul 10, 2021 at 0:53
• See for example this restricted partition that is in lex order. A "conjugation" that maps this to colex order is somewhat involved, but it is not the identity map. Jul 10, 2021 at 9:13
• @NikosM. It's nice to see Abacus. Of course, "only" in my previous comment was too strong, as my own example showed. For the 248 partitions of 25 with 7 parts (the setting of your linked example), at least 20 have to fixed under any involution preserving number of parts, min, and max: 9 of the min/max combinations have size 1 (so these are fixed points under any map preserving these stats) and another 11 of those have odd size (so at least one fixed point each under an involution). In contract, 3 of these are self-conjugate under "normal" conjugation (7752222, 7643221 , and 7553311). Jul 10, 2021 at 13:44
• Yes exactly, it seems the "conjugation" I am after (one that relates LEX and COLEX), is quite involved. The idea is an extrapolation of the usual/ferres conjugation which relates LEX and COLEX orders (the conjugate of an item in LEX order gives the associated item in COLEX order). One can define many proposals for restricted conjugation, but the one asked is the one which relates these two combinatorial orderings Jul 10, 2021 at 14:47