On the number of principal ideals in d-tonal partition monoids

For a positive integer d, a non-negative integer n and a non-negative integer h≤n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h\le n$$\end{document}, we study the number Cn(d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_{n}^{(d)}$$\end{document} of principal ideals; and the number Cn,h(d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_{n,h}^{(d)}$$\end{document} of principal ideals generated by an element of rank h, in the d-tonal partition monoid on n elements. We compute closed forms for the first family, as partial cumulative sums of known sequences. The second gives an infinite family of new integral sequences. We discuss their connections to certain integral lattices as well as to combinatorics of partitions.


Introduction and description of the results
Enumeration is often the starting point in understanding a given mathematical structure. Twisted monoid algebras [6,21] of d-tonal partition monoids appear in [22] as right Schur-Weyl duals for generalized symmetric groups. These algebras are subalgebras of the classical partition algebras from [12,13] and [8]. The monoids underlying the latter algebras have relatively simple principal ideal structure and well-studied representation theory, see [13,14]. The d-tonal subalgebras of partition algebras are more complicated. Some basics representation theory of these and related algebras was developed in [9][10][11] and [17]. However in the monoid case, for example, these studies cover only a trivial quotient.
The motivation for the present paper comes from our attempt to understand the structure of d-tonal partition algebras using combinatorics of Green's relations for the finite d-tonal partition monoid. The main question we answer in the present paper is what is the number of different principal 2-sided ideals in such a monoid. This already depends on two parameters: the difference parameter d and the parameter n which controls the size of our partitions. We denote the number of such ideals by C (d) n . Algebraically, there is a natural third parameter which enters the picture: the rank h ∈ {0, 1, . . . , n} of the generating partition. Using this parameter, we write n,h denotes the number of ideals generated by an element of rank h. We seek a closed formula for both C (d) n,h and for C (d) n . Cases d = 1 and d = 2 turn out to be easy.
In Section 2, we give an alternative, purely combinatorial, definition for the numbers C (d) n as enumerators of layers in certain graded posets. These are related to the original motivation in Section 6. The main part of the paper is devoted to the study of the case d = 3 which occupies Section 3.
Extra motivation for the case d = 3 comes from its intrinsic geometricphysical interest. We give an explicit formula for C (3) n,h in case h is relatively big (i.e. h ≥ n 2 ), see Proposition 4, and in case h is relatively small (i.e. h ≤ n 3 ), see Proposition 5. The former gives a connection of our sequence to partitions with at most three parts while the latter shows a connection to triangular numbers (in fact, to a special counting of triangular numbers modulo 3). Our first main result is that the sequence C (3) n is given by the "Cyvin sequence" (A028289 in [19]) which enumerates the number of isomorphism classes of hollow hexagons (representing polycyclic hydrocarbons), see [3,20]. In Theorem 18 of Section 4, we even give an explicit bijection between hollow hexagons and the graded poset underlying the definition of C (3) n given in Section 2.
In Section 5, we relate our graded posets to combinatorics of partitions, and in Section 6, we make precise the connection between the combinatorially defined data discussed in the paper and the algebraic structures which motivate our investigation. Combinatorics which underlines the algebraic structure allows us to determine C (d) n for all d and n in terms of partitions with at most d parts, see Theorem 28 in Section 7. As a corollary of this uniform description for all d, we obtain an alternative, simpler, description of A028289 using partitions with at most 3 parts.

Notation and general construction
We denote by R the set of all real numbers, by R ≥0 the set of all non-negative real numbers, by Z the set of all integers, by N the set of all positive integers and by Z ≥0 the set of all non-negative integers.
Consider the set Z d for some fixed d ∈ N. Elements of Z d are vectors v = (v 1 , v 2 , . . . , v d ) such that v i ∈ Z for all i = 1, 2, . . . , d. The number v 1 + v 2 + · · ·+ v d ∈ Z is called the height of v and denoted ht(v). The set Z d has the natural structure of an abelian group given by addition. The map ht : Z d → Z is a surjective group homomorphism. For i = 1, 2, . . . , d, we denote by e(i) the standard basis vector (0, 0, . . . , 0, 1, 0, 0, . . . , 0) in Z d , in which the only non-zero element 1 stands in position i. Note that each e(i) has height 1. Denote define on Λ d , the structure of a poset using the transitive closure < X of the following manifestly antisymmetric relation: v X w if and only if v − w ∈ X. (2.2) Note from the construction that X is a covering relation. Directly from the definitions, we have that v X w implies ht(v) = ht(w) − 1, for all v and w. In particular, the poset (Λ d , < X ) is a graded poset with rank function ht : Λ d → Z. Note that X = X implies X = X . Note that < X d is defined. Denote by P d the poset (Λ d , < X d ). Finite principal ideals of P d are the main objects of interest in this paper. For simplicity, we will denote the relation < X d by ≺. For the record, we note the following. For v ∈ P d , we denote by I(v) the principal ideal of P d generated by v, that is
We observe the following structural property of P d : for k = 1, 2, . . . , d,
(ii) Each P d,k is an indecomposable poset in the sense that it is not isomorphic to the disjoint sum of two non-empty posets.
Note that e(k) ∈ P d,k . Therefore, to prove claim (ii), it is enough to show that e(k) ≺ v, for any v ∈ P d,k of height at least 2. However, if v has height at least 2, then either v has a coordinate which is greater than or equal to 2, or v has at least two non-zero coordinates. Therefore, there is x ∈ X d such that v + x ∈ Λ d . We have v + x ≺ v and from the observation in the previous paragraph we see that v + x ∈ Λ d,k . Therefore e(k) ≺ v follows by induction on the height of v. This completes the proof.
From the above proof, it follows that for k = d, the element e(k) is the minimum element in P d,k and that the minimum element in P d,d is 0 := (0, 0, . . . , 0).

The case d = 1
In the case d = 1, the map is an isomorphism of posets. For n ∈ Z ≥0 , we have  are mutually inverse isomorphisms of posets. Consequently, we have C (2) n = C (2) n+1 , for all even n ∈ Z ≥0 . The lower part of the Hasse diagram for P 2,2 is shown in Figure 1.
It follows immediately that for k ∈ Z ≥0 , we have We also note that I(2ke(1)) ⊂ I(2(k + 1)e(1)), for all k ∈ Z ≥0 , and that k∈Z ≥0 It is also worth pointing out that for each k ∈ Z ≥0 , the poset I(2ke (1)) is isomorphic to the poset I(2ke(1)) op (the latter is obtained from I(2ke(1)) by reversing the partial order).

The case d = 3
As we will show below, the case d = 3 has several interesting connections to integral sequences. Our study of this case is the main part of the present paper.

Isomorphism of P 3,1 and P 3,2
The symmetric group S 2 acts on Λ 3 as follows: for v = (v 1 , v 2 , v 3 ) and π ∈ S 2 we have π · v = (v π (1) , v π (2) , v 3 ). Note that the set X 3 (which can be found in Subsection 2.2) is invariant with respect to the action of S 2 . Therefore, this action induces an action on P 3 by automorphisms. Using this action, we can swap e(1) and e(2) and hence P 3,1 and P 3,2 (cf. proof of Proposition 2). Therefore, the posets P 3,1 and P 3,2 are isomorphic.

An alternative description
In this subsection, we observe that P 3 can be defined by restriction from Z 3 . This is a useful property for computations using computers. We mimic the definition of P 3 starting from Z 3 instead of Λ 3 . Consider the set X 3 as defined in Subsection 2.2. Use (2.2) to define the covering relation on Z 3 and let ≺ denote the partial order on Z 3 induced by this covering relation. Our main observation here is the following: Proposition 3. The relation ≺ coincides with the restriction of the relation ≺ to Λ 3 .
Proof. Let ≺ denote the restriction of the relation ≺ to Λ 3 . Clearly, ≺⊂ ≺ , so we only need to show that ≺ ⊂≺.
Let v, w ∈ Λ 3 be such that v ≺ w. We have to show that v ≺ w. Assume that this is not the case and that the pair (v, w) satisfying v ≺ w and v ≺ w is chosen such that ht(w − v) = k ∈ N is minimal possible. As v ≺ w, there is a sequence of elements x 1 , x 2 , . . . , x k ∈ X 3 such that v = w + x 1 + x 2 + · · · + x k .
This would imply v i ≺ w which would contradict our minimal choice of k. In particular, none of the The next step is to show that none of the x i 's equals (−1, −1, 1). Otherwise, without loss of generality, we may assume that x k = (−1, −1, 1). Then, we have v k ∈ Λ 3 , and hence, v = ( * , * , 0) and v k = ( * , * , −1). Furthermore, we have Since w ∈ Λ 3 , the third coordinate in w is non-negative. This means that at least one of the x i 's must have negative third coordinate. The only element in X 3 with negative third coordinate is (0, 0, −1). However, in the previous paragraph, we already established that none of the x i 's equals (0, 0, −1), a contradiction.

Small values
The table of C (3) n,h for small values of n is given in Figure 2 (computed first by hands, up to n = 15, and then checked and extended using Proposition 3 and MAPLE). Please ignore the underlines and the overlines for the moment.

n,h for large h
The sequence A001399(n) in [19] lists the number of partitions of n into at most 3 parts. Here are the first 25 elements in this sequence: 1,1,2,3,4,5,7,8,10,12,14,16,19,21,24, . . . Figure 2 suggests that the upper part of each column in Figure 2 bounded by the underlined element is an initial segment of A001399. Indeed, we have the following claim:

Comparison with columns of
By Proposition 3, it is enough to show that v (a,b,c) ∈ Λ 3 . The latter however follows from 2a + b ≤ n (thanks to h ≥ n 2 ) and b ≥ c (thanks to the fact that (a, b, c) is a partition).
The vectors (−2, 1, 0), (−1, −1, 1) and (0, 0, −1) are linearly independent, which implies that for some a, b, c, d ∈ Z ≥0 . Since the second coordinate of v is non-negative, we have a ≥ d. Since and thus may assume that d = 0 in (3.1). We have a + b + c = n − h since v has height h, b ≥ c as the third coordinate of v is non-negative and a ≥ b as the second coordinate of v is non-negative. Therefore, v = v (a,b,c) , for the partition (a, b, c) of n − h. The claim of the proposition follows.
Proof. We prove both statements at the same time by induction on h. Let us arrange elements of Λ (h) 3 in a triangular array as shown in Figure 3.
Writing down the residue modulo 3 of the expression a + 2b for each element (a, b, c) in Figure 3, we get corresponds to the first h + 1 "bottom-left-to-topright" diagonals starting from the bottom right corner. The induction step h → h + 1 corresponds to adding the next diagonal.
By a direct inspection of the above tables, we have 3,3 |, which establishes the basis of our induction.
Note that the residues in each diagonal follow a cyclic order on 0, 1, 2 (as one step up along the diagonal decreases the first coordinate by 1 and increases the second coordinate by 1, thus changing a + 2b to (a − 1) + 2(b + 1)). In particular, if the number of elements on a new diagonal is divisible by 3, it contains the same number of 0's, 1's and 2's. This proves the induction step in the case when 3 divides h − 1.
If 3 divides h − 2, then the new diagonal contains an extra zero compared to the common number of 1's and 2's. If 3 divides h, then the new diagonal contains one zero less than the common number of 1's and 2's. Put together this implies the induction step and completes the proof of the proposition.
The latter sequence should be compared with the fourth sequence which will be constructed in Subsection 3.6 below.
Each column in Figure 2 contains a unique overlined element. This element corresponds to the upper bound n 3 for the value of h for which C is given by Corollary 7. In other words, this element and all elements below it in the same column are given by an initial segment of A007997(h + 2) or A001840(h), if 3 does or does not divide n, respectively.

Problem 8. Find a closed formula for
We do not know how hard this problem is, we do not see how to approach it in full generality.

Sequence A028289
The sequence A028289 in [19] lists coefficients in the expansion of This sequence appears in [3]. Comparison with the first row of Figure 2 suggests that C (3) n = A028289(n) for all n. We will prove this in the next subsection. In this subsection, we propose two constructions of A028289, alternative to its definition on [19]. The first construction consists of five combinatorial steps.
Our second construction of A028289 (which is relevant for Theorem 11 in the following subsection) uses the following observation: Proof. We have to check that This is a straightforward computation.
Lemma 10 implies that A028289 can be constructed in the following four combinatorial steps. •

Computation of C (3)
n Here, we prove our first main result.
To prove our theorem, we need to prove (3.4). Lemma 13 corresponds to the last two factors on the right-hand side of (3.4), formula (3.6) corresponds to the first factor and Lemma 14 corresponds to the second factor. The claim of the theorem now follows using the rule of sum. The intuitive picture behind this proof is given in Figure 4.

C (3)
n and hollow hexagons

Triangular tilings
Consider a regular triangular tiling of a Euclidean plane as shown in Figure 5. We assume that the side of the basic equilateral triangle (the fundamental region) of this tiling has length 1. Each intersection point if called a vertex of the tiling. Each straight line of the tiling is called a tiling line. A horizontal tiling line will be called a line of type 1. A tiling line of type 2 is a tiling line obtained from a tiling line of type 1 by a clockwise rotation by π 3 . A tiling line of type 3 is a tiling line obtained from a tiling line of type 1 by a clockwise rotation by 2π 3 .

T-hexagons and their h-envelopes
For i = 1, 2, 3, a tiling strip of type i is the region between two tiling lines of type i, including these lines (see Figure 5 for an example of a tiling strip of type 2). In particular, if these two lines coincide, then the corresponding tiling strip coincides with each of these tiling lines. A t-hexagon is, by definition, the • * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Figure 5. Triangular tiling, vertices, and tiling lines; triangles marked with * form a tiling strip of type 2 intersection of three tiling strips, one for each type. Note that a t-hexagon can be: • empty; • equal to a vertex of the tiling; • equal to a bounded line segment of a tiling line; • a polygon with three, four, five, or six vertices. By the perimeter of a t-hexagon we mean its perimeter as a polygon. Clearly, each t-hexagon has finite perimeter. The perimeter of a vertex is zero, while the perimeter of a bounded line segment is twice the length of this line segment.
The group of symmetries of the triangular tiling is the triangle group Δ(3, 3, 3) = a, b, c : a 2 = b 2 = c 2 = (ab) 3 = (bc) 3 = (ca) 3 = 1 generated by reflections with respect to the sides of the fundamental region of the tiling. Two t-hexagons which can be obtained from each other applying some element in Δ(3, 3, 3) will be called isomorphic. For n ∈ Z ≥0 , we denote by T n the number of isomorphism classes of t-hexagons with perimeter 2n. Centroids of tiling triangles form a dual hexagonal tiling of our plane. Given a t-hexagon H, its hexagonal envelope E(H) is the union of all hexagons in the hexagonal tiling which intersect H, see Figure 6 for an example of a t-hexagon (bold lines) and its hexagonal envelope (dotted lines).

Lemma 16.
Let H be a t-hexagon of perimeter i for some i ∈ Z ≥0 . Then, the hexagonal envelope of H has 6 + 2i vertices.
Proof. For i = 0, 1, 2, 3, 4, 5 the statement of the lemma follows by inspecting all t-hexagons of perimeter i. These t-hexagons are given in the following list: Figure 6. A t-hexagon and its hexagonal envelope We claim that the rest follows by induction on i. Indeed, assume that H is the intersection of three tiling strips (one for each type). We can, in turn, pull the lines defining these strips closer to each other, one step at a time. Eventually, by one such step, we will get a smaller t-hexagon H . There are four possible cases.

• • • • • • • • • →
In this case, we see that the perimeter of H decreases by 1 and the number of vertices of the hexagonal envelope by 2.
Case 3. The t-hexagon H is obtained from H by collapsing a trapezoid segment onto its basis as illustrated here (the length of the segment can be arbitrary):

• • • • • • • • →
In this case, we see that the perimeter of H decreases by 2 and the number of vertices of the hexagonal envelope by 4.
Case 4. The t-hexagon H is obtained from H by collapsing a trapezoid segment to its basis as illustrated here:

• • • • • • • →
In this case, we see that the perimeter of H decreases by 3 and the number of vertices of the hexagonal envelope by 6.
Since all the above changes agree, by linearity, with the desired formula, the claim of the lemma follows by induction.
Hexagonal envelopes of t-hexagons seem to be exactly the hollow hexagons considered in [3,4] (the latter papers do not really have any mathematically precise definition of hollow hexagons).

Characters of t-hexagons
We would like to encode t-hexagons using vectors with non-negative integral coordinates. For this, we will need some notation. Denote by v 1 , v 2 and v 3 , the vectors in the Euclidean plane as shown in Figure 7. Note that all these vectors have length one and that v 1 + v 2 + v 3 = 0. In Figure 7, we also see a *marked t-hexagon which is the intersection of the tiling strips formed by thick lines. The tiling lines which bound the tiling strips are marked by numbers 1, 2, 3, 4, 5, 6 which correspond to going along the perimeter of the hexagon starting from the bottom side and going into the clockwise direction.
Let now H be a nonempty t-hexagon given as the intersection of three tiling strips, one for each type. Without loss of generality, we may assume that each tiling line which bounds each of these tiling strips has a nonempty intersection with H. We number the tiling lines forming the boundaries of the tiling strips in the same way as in Figure 7. Note that, if two tiling lines coincide, we still count them as two different lines in our numbering. This corresponds to walking along the boundary of H, starting with the bottom side, first along v 1 , then along −v 3 , then along v 2 , then along −v 1 , then along v 3 and, finally, along −v 2 .
The intersection of a boundary tiling line of a tiling strip with H is then either a vertex or a side of H. We denote by χ (H) the vector (a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ) where for i = 1, 2, 3, 4, 5, 6 the number a i is the length of the intersection of the line i with H. For example, for the * -marked t-hexagon in Figure 7, we have χ (H) = (1, 1, 1, 1, 1, 1), while for the thick t-hexagon in Figure 6, we have χ(H) = (3, 0, 2, 2, 1, 1). The vector χ(H) will be called the character of H.
One could also give a description of χ(H) as follows: Start with the rightmost vertex on the bottom edge of H. Walk along v 1 until the next vertex  1 , a 2 , a 3 , a 4 , a 5 , a 6 ) → (a 6 , a 5 , a 4 , a 3 , a 2 , a 1 ).
Using this action, we can change H to an isomorphic t-hexagon H such that we have χ (H ) = (a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ) where the following conditions are satisfied: a 1 + a 3 + a 5 ≤ a 2 + a 4 + a 6 and a 1 ≥ a 3 ≥ a 5 . (4.1) Such H as well as its character will be called distinguished. It is easy to see that a distinguished representative in the isomorphism class of H is unique up to shift of tiling. As an example, the regular hexagon in Figure 7 is distinguished, while the t-hexagon in Figure 7 is not distinguished since the first inequality in (4.1) fails. Note that our walk along the perimeter of H always returns to the original point. From this, it follows that (a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ) ∈ Z 6 ≥0 is the character of some t-hexagon if and only if  (a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ). Then, we have a 1 ≤ a 4 , a 5 ≤ a 2 and a 3 ≤ a 6 .

Elementary operations on distinguished t-hexagons
Let H be a distinguished t-hexagon and χ (H) = (a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ). We consider four elementary operations on hexagons. Operation Φ. Assume a 1 − a 3 ≥ 2. Then, using Lemma 17, it is easy to check that the vector 1, a 2 , a 3 + 1, a 4 − 1, a 5 , a 6 + 1) satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished t-hexagon which we denote by Φ(H). Here is an example of this operation: Assume a 1 > a 3 > a 5 . Then, using Lemma 17, it is easy to check that the vector (a 1 − 1, a 2 + 1, a 3 , a 4 − 1, a 5 + 1, a 6 ) satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished t-hexagon which we denote by Ψ(H). Here is an example of this operation:

Signature and defect
Let H be a distinguished t-hexagon. Assume that χ(H) = (a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ). Then, the vector sign(H) := (a 1 −a 3 , a 3 −a 5 , a 5 ) ∈ Z 3 ≥0 will be called the signature of H. For example, the regular hexagon in Figure 7 has signature (0, 0, 1) while a distinguished t-hexagon isomorphic to the t-hexagon in Figure 6 has signature (1, 1, 0). Directly from the definitions, one computes that for any and note that the defect of a distinguished t-hexagon is always non-negative.

The number of t-hexagons
Our main result in this section is the following statement which gives a direct connection between the present paper and [3,4].

Theorem 18. For all n ∈ Z ≥0 , mapping H to sign(H) induces a bijection between the set of isomorphism classes of distinguished t-hexagons of perimeter
2n and the set I(ne (1)).
Proof. Consider a distinguished t-hexagon Q having the character (n, 0, 0, n, 0, 0). The signature of this t-hexagon is (n, 0, 0) = ne (1). Applying, whenever possible, a sequence of operations Φ, Ψ, Θ and Λ to Q, produces a set of t-hexagons of perimeter 2n. From (4.4), it follows that the set of signatures for all thexagons which can be obtained in this way is contained in I(ne (1)). Observe that the operation Φ is defined as soon as a 1 − a 3 ≥ 2 and that this condition is equivalent to the fact that adding (−2, 1, 0) to the signature of the input t-hexagon gives a vector with non-negative coordinates. Put differently, if we have a t-hexagon such that the sum of its signature and (−2, 1, 0) has non-negative coordinates, then Φ can be applied to this t-hexagon. Similar observations also apply to Ψ and (−1, −1, 1), to Θ and (0, 0, −1) and to Λ and (1, −2, 0). Consequently, the set of signatures for all t-hexagons which can be obtained from Q by all possible sequences of Φ, Ψ, Θ and Λ coincides with I(ne (1)). Our next step is to show that each distinguished t-hexagon of perimeter 2n can be obtained from Q using a sequence of operations of the form Φ, Ψ, Θ and Λ (in fact, the first three would suffice). Let K be a distinguished thexagon of perimeter 2n with character ( a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ). Assume a 5 > 0. Then, using Lemma 17, it is easy to check that the vector 1, a 2 − 1, a 3 , a 4 + 1, a 5 − 1, a 6 ) satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished t-hexagon. Therefore, K = Ψ(K ) for some distinguished thexagon K and the character of K has a smaller fifth coordinate. In particular, K is obtained, using a sequence of Ψ's, from some distinguished t-hexagon K , the character of which has zero-fifth coordinate.
Let K be a distinguished t-hexagon of perimeter 2n with character ( a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ). Assume that a 5 = 0 and a 3 > 0. Then, using Lemma 17, it is easy to check that the vector (a 1 + 1, a 2 , a 3 − 1, a 4 + 1, a 5 , a 6 − 1) satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished t-hexagon. Therefore, K = Φ(K ) for some distinguished thexagon K and the character of K has a smaller third coordinate. In particular, K is obtained, using a sequence of Φ's and Ψ's, from some distinguished t-hexagon K the character of which has zero-third and fifth coordinates.
Let K be a distinguished t-hexagon of perimeter 2n with character ( a 1 , a 2 , 0, a 4 , 0, a 6 ). Then, a 4 ≥ a 1 by Lemma 17. If a 4 = a 1 , then from (4.3) it follows that a 2 = a 6 = 0 and K = Q. If a 4 > a 1 , then from (4.3) it follows that a 2 = a 6 = a 4 − a 1 > 0. If a 4 > a 1 + 1, then, using Lemma 17, it is easy to check that the vector 1, a 2 − 1, a 3 + 1, a 4 − 1, a 5 + 1, a 6 − 1) satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished t-hexagon, say K . Note that, by construction, def(K ) < def(K) and that K = Θ(K ). Finally, if a 4 = a 1 + 1, then from (4.3) it follows that the character of K is of the form (x, 1, 0, x + 1, 0, 1), for some x. In this case, the perimeter of K is 2x + 3, which is an odd number, contradicting our assumptions. Therefore, the case a 4 = a 1 + 1 cannot occur.
Using induction on defect and the above steps, it follows that any distinguished t-hexagon of perimeter 2n is obtained using Φ, Ψ and Θ from a distinguished t-hexagon of perimeter 2n with character (a 1 , 0, 0, a 4 , 0, 0). But from Equation 4.3, it thus follows that a 1 = a 4 = n, and hence, the latter t-hexagon must be isomorphic to Q.
As a consequence of the above argument, we have that the image of the signature map is contained in I(ne (1)). So, it remains to show that the signature map is injective.
Let K be a distinguished t-hexagon with signature (x, y, z) and of perimeter 2n. Then, the character of K equals (x + y + z, a 2 , y + z, a 4 , z, a 6 ) for some a 2 , a 4 , a 6 ∈ Z ≥0 . From (4.3), we have Since the perimeter of K is 2n, we also have x + y + z + a 2 + y + z + a 4 + z + a 6 = 2n and hence a 2 , a 4 and a 6 are uniquely determined. This means that the character of K is uniquely determined and thus K is uniquely determined up to isomorphism by its signature. This completes the proof.
As an immediate corollary from Theorem 18, we have: n is the number of isomorphism classes of t-hexagons with perimeter 2n.
Our proof of Theorem 18 provides another connection to the sequence A001399(n) giving the number of partitions of n in at most three parts which was already mentioned in Subsection 3.4. Let P n denote the set of all partitions of n in at most three parts. If n < 0, we set P n = ∅. Mapping H with χ(H) = (a 1 , a 2 , a 3 , a 4 , a 5 , a 6 )  to (a 1 , a 3 , a 5 ) induces a bijection between the set of isomorphism classes of distinguished t-hexagons of perimeter 2n and the set P n ∪ P n−3 ∪ P n−6 ∪ . . . . In particular, we have Restricting the bijection constructed in the proof of Theorem 18 to the set of distinguished t-hexagons of defect 2i and thereafter mapping sign(H) = (x, y, z) to the partition (x + y + z, y + z, z) of x + 2y + 3z, provides a bijection from the set of distinguished t-hexagons of defect 2i to P n−i .

Partitions modulo d
For d ∈ N, define an equivalence relation ∼ d on Π n as follows: Given λ = (λ 1 , λ 2 , . . . , λ k ) n and μ = (μ 1 , μ 2 , . . . , μ l ) n set λ ∼ d μ provided that k = l and there is π ∈ S k such that d divides λ i − μ π(i) , for all i. In other words, λ ∼ d μ if and only if the multisets of residues modulo d for parts of λ and μ coincide. For λ n, we denote the ∼ d -class of λ by λ (d) .
Since ∼ d -equivalent partitions have the same number of parts and partitions with the same number of parts are incomparable with respect to the refinement order <, this order induces a partial order < d on the set Π n,d := Π n / ∼ d defined as the transitive closure of the relation< given by λ<μ if there are λ ∈ λ and μ ∈ μ such that λ < μ . The poset Π n,d inherits from Π n the structure of a graded poset.
Define the poset Π * n,d as follows: if d does not divide n, set Π * n,d := Π n,d with the order < d ; if d divides n, define Π * n,d as the poset obtained from (Π n,d , < d ) by adding a minimum element, denoted ∅ (for simplicity, we will keep the notation < d for the partial order on Π * n,d ). The structure of a graded poset on Π n induces the structure of a graded poset on Π * n,d by defining the degree of ∅ to be zero. The class (1, 1, . . . , 1) This map is constant on the ∼ d -equivalence classes and hence induces a map from Π n,d to P d . We extend this map to Π * n,d by sending the ∅ element to the zero vector in case d divides n. Denote the resulting map by Φ. Note that Φ preserves the degree of an element, namely, it maps a partition with k parts to a vector of height k.
First of all, we claim that Φ is a homomorphism of posets. Indeed, any refinement of partitions can be written as a composition of elementary refinements which simply refine one part of a smaller partition into two parts of a bigger partition. Such elementary refinement corresponds to the covering relation μ λ where λ has k parts while μ has k − 1 parts. Assume that this refines the part μ i into parts λ s and λ t . This means that μ i = λ s + λ t and hence Let a, b, c ∈ {1, 2, . . . , d} be such that μ i ≡ a, λ s ≡ b and λ t ≡ c mod d. Then, the element e(a) − e(b) − e(c) belong to X d . This implies that Φ(μ) ≺ Φ(λ). It follows that Φ is a homomorphism of posets.
Clearly, Φ((1, 1, . . . , 1) is the maximum element in Π * n,d , it follows that Φ maps Π * n,d to I(ne (1)). That Φ : Π * n,d → I(ne (1)) is injective follows directly from the definition. It remains to show that Φ is surjective, in particular, invertible, and that Φ −1 is order preserving. We prove this by downward induction on the height h. If h = d, the claim is clear as ne (1) is the only element of I(ne(1)) of height h.
For the induction step h → h − 1 let v and w be two elements in I(ne(1)) of heights h − 1 and h, respectively, and assume v ≺ w. Then v = w + x, for some x ∈ X d . Let x = e(k) − e(i) − e(j), for some i, j, k ∈ {1, 2, . . . , d}. From the inductive assumption, there is λ n such that Φ(λ) = w. Let λ s and λ t be two different parts of λ with residues i and j modulo d, respectively. Define μ as the partition obtained from λ by uniting λ s and λ t . Then, Φ(μ) = v. Therefore, Φ is a bijection.
From the arguments above, it follows that the covering relations in Π * n,d to I(ne(1)) match precisely under Φ. This implies that Φ is an isomorphism of posets, completing the proof of the theorem.
As an immediate corollary, we have: n .

Partition monoids
For n ∈ Z ≥0 , consider the sets n = {1, 2, . . . , n} and n = {1 , 2 , . . . , n } (these two sets are automatically disjoint). Set n := n n and consider the set P(n) of all partitions of n into a disjoint union of nonempty subsets. The cardinality of P(n) is the 2n-th Bell number, see A000110 in [19]. The set P(n) has the natural structure of a monoid, see [8,13,15,16]. The composition σ • π of two partitions σ, π ∈ P(n) is defined as follows (here n = {1 , 2 , . . . , n } is disjoint from n): • First consider the partition σ of n ∪ n which is induced from σ via the bijection n ∪ n → n ∪ n which sends i → i for i ∈ n and j → j for j ∈ n . • Letπ be the equivalence relation on n ∪ n ∪ n whose parts are those of π combined with singletons of n . • Letσ be the equivalence relation on n ∪ n ∪ n whose parts are those of σ combined with singletons of n. • Letτ denote the minimal (with respect to inclusions) equivalence relation on the set n ∪ n ∪ n which contains bothπ andσ. • Letτ be the restriction ofτ to n ∪ n .
• Define τ = σ • π as the partition of n ∪ n induced from the partitionτ by the bijection n ∪ n → n ∪ n which sends i → i for i ∈ n and j → j for j ∈ n .
The identity element in the monoid (P(n), •) is the identity partition Both elements of P(n) and the composition • admit a diagrammatic description as shown in Figure 8 (in the composition σ • π which is the left-hand side of the equality in Figure 8, the element σ is depicted on the left and the element π on the right). We refer the reader to [8,13,16] for further details.

d-tonal partition monoids
For d ∈ N, the d-tonal partition monoid P d (n), as introduced in [22], is the submonoid of P(n) which consists of all partitions σ of n such that every part σ i of σ satisfies the condition that Thus, for d = 1, we have P 1 (n) = P(n). For d = 2, the above condition is equivalent to the requirement that all parts of σ have even cardinality. Therefore, |P 2 (n)| is given by the sequence A005046 in [19] (see also [18]). The twisted monoid algebra of the d-tonal partition monoid was studied (under various names) in [17,22], see also [9][10][11] for related algebras and [7, Section 5.1] for some recent developments. We record the following open problem: in a closed form as a function of d and n. As the twisted semigroup algebra of P d (n) is generically semi-simple, see [22], and forms, for all n, a sequence of embedded algebras with multiplicityfree restrictions, see [9], there is a natural analogue of the Robinson-Schensted correspondence for P d (n) and hence Problem 23 admits a combinatorial reformulation in terms of walks on a certain Bratelli diagram.

Rank and d-signature
For σ ∈ P d (n), the rank rank(σ) is the number of parts σ i in σ such that both |σ i ∩ n| = 0 and |σ i ∩ n | = 0. Such parts are called propagating.
Note that, for σ ∈ P d (n), the cardinality of any part of σ which is entirely contained in n or in n is divisible by d.
There is a natural partial order on the set P d (n)/J given by inclusions: we write σ J π J if and only if P d (n)σP d (n) ⊂ P d (n)πP d (n).

Canonical elements
An element σ ∈ P d (n) will be called canonical provided that the following conditions are satisfied: • Each part σ i of σ satisfies |σ i ∩ n| ≤ d and |σ i ∩ n | ≤ d.
• The intersections σ i ∩ n and σ i ∩ n are connected segments of n and n , respectively, ordered by cardinalities of the intersections for those parts σ i which intersects both n and n and then followed by those parts of σ which intersect only n or n . For example, the identity element in P d (n) is canonical.
Lemma 24. For each σ ∈ P d (n), there is a canonical π ∈ P d (n) such that σJ π. Figure 9. Illustration of the proof of Lemma 24 Proof. If some part σ i of σ satisfies |σ i ∩n| > d or |σ i ∩n | > d, then there is σ ∈ P d (n) which has exactly the same parts as σ except for σ i which is split into two parts: a part with d elements which is a subset of n (respectively, n ) and its complement. Existence of σ follows using the construction shown in Figure 9 (in the case d = 3) and note that σJ σ also follows from Figure 9. Proceeding inductively, we find an element τ ∈ P d (n) which is in the same J -class as σ and which satisfies the condition that |τ i ∩n| ≤ d and |τ i ∩n | ≤ d for each part τ i of τ . Permuting, if necessary, the elements of n and, independently, of n (that is, multiplying from the left and/or from the right by permutations, noting that all permutations belong to P d (n)), one rearranges τ into a canonical element π in the same J -class as σ. The claim follows.
Proof. We use downward induction to prove that for each k = n, n − 1, n − 2, . . . , 0, the map Ψ induces a bijection between the set of all canonical elements of rank k in P d (n) and the set of all elements of height k in I(ne (1)). The statement of the corollary then will follow from Lemma 24.
The basis of the induction is k = n. In this case, on the left-hand side, we have only one canonical element, the identity element, while on the right-hand side, we have ne (1) which is the image of the identity element under Ψ.
Let v ∈ I(ne(1)) be an element of height k and let σ be a canonical element such that Ψ(σ) = v. Let e(k) − e(i) − e(j) ∈ X d be such that v + (e(k) − e(i) − e(j)) ∈ I(ne(1)). Then, σ has a part σ s such that d divides |σ s ∩ n| − i and a different part σ t such that d divides |σ t ∩ n| − j. Consider the element σ obtained from σ by uniting σ s with σ t and keeping all other parts. Then, σ σ = σ and hence P d (n)σ P d (n) ⊂ P d (n)σP d (n). Moreover, Ψ(σ ) = v + e(k) − e(i) − e(j). This implies surjectivity of the induction step.
At the same time, the form of the canonical element immediately implies that it is obtained from the identity element using the unification procedure described in the previous paragraph, followed by splitting off d-element parts contained in n or n (note that the latter parts do not affect the value of Ψ by definition). This implies that Ψ takes values inside I(ne (1)) and completes the proof.
Corollary 26. For each σ ∈ P d (n), there is a unique canonical π ∈ P d (n) such that σJ π.
Proof. Taking into account Proposition 25, the claim follows from the observation that different canonical elements are sent by Ψ to different elements in I(ne(1)).

A combinatorial description of the J -order
Our second main result, which explains our interest in C  (1)). This map is bijective by the combination of Proposition 25 and Corollary 26. From the third paragraph of the proof of Proposition 25, it follows that for each pair of elements v, w ∈ I(ne(1)) such that v ≺ w, there are σ, π ∈ P d (n) such that P d (n)σP d (n) ⊂ P d (n)πP d (n), Ψ(σ) = v and Ψ(π) = w.
On the other hand, from the last paragraph of the proof of Proposition 25, it follows that the poset (P d (n)/J , ) is a graded poset. Now, applying the argument from the third paragraph of the proof of Proposition 25 once more and counting modulo d, one checks that the covering relations in (P d (n)/J , ) and (I(ne(1)), ≺) match precisely via Ψ. The claim follows.

Enumeration via d-part partitions
The proof of Proposition 25 gives a way to write a formula for C Proof. To prove this claim, we analyse the proof of Proposition 25. According to the latter proof, C (d) n enumerates canonical elements in P d (n). Let σ be a canonical element. Let σ 1 , σ 2 , . . . , σ k be the list of all parts of σ contained in n (note that k might be zero). Then, each of these parts has cardinality d, and we may consider the set n σ := n \ (σ 1 ∪ σ 2 ∪ · · · ∪ σ k ) which thus has cardinality n − kd.
Cardinalities of intersections of all propagating parts of σ with n σ determine a partition of n − kd in which each part does not exceed d. It is straightforward that this gives a bijection between the set of all canonical elements in P d (n) with 2k non-propagating parts and all partitions of n − kd for which each part does not exceed d. The claim follows.
Proof. This follows by combining the usual equality with the statement of Theorem 28.
Remark 30. It is easy to check that for d = 3, we indeed have the equality Here, the left-hand side is the original generating function for A028289.
Remark 31. The poset Π (d) of partitions with at most d parts can be defined using the same approach as we used to define Λ d . The assertion of Theorem 28 can then be interpreted as a bijection between certain (co)ideals in Π (d) and Λ d . Such a bijection admits a direct combinatorial construction.

Examples for d = 4 and d = 5
The sequence C We note that none of the sequences C (d) n for d ≥ 4 appeared on [19] before. However, as noted, they are simple cumulative sums of classical sequences.
Note that e(i + j) − e(i) − e(j) ∈ X d .
Assume now that n − h < d and v ∈ I(ne(1)) is of height h < n. Then, v is obtained from ne(1) by adding n − h vectors from X d of the form e(i + j) − e(i) − e(j), for some i and j as above. Indeed, let s > 1 be the smallest index such that v i = 0 (which exists as h < n and n − h < d). Then, the vector v is obtained from the vector w = (v 1 + 1, v 2 , . . . , v s−2 , v s−1 + 1, v s − 1, v s+1 , . . . , v d ) by adding e((s − 1) + 1) − e(s − 1) − e(1) (here w 1 = v 1 + 2 if s = 2). Applying a similar procedure to w and proceeding inductively, we get the claim. This implies that is a partition of n − h. Since n − h is fixed and v is, clearly, recoverable from Υ(v), the map Υ from I(ne(1)) ∩ Λ To prove surjectivity of Υ, assume that n − h = x 2 + 2x 3 + 3x 4 + . . . , for some non-negative x 2 , x 3 , . . . . We proceed by induction on n − h. If n − h = 0, surjectivity of our map is obvious. To prove the induction step, we write k = i + j, for some 1 ≤ i, j ≤ k − 1, and consider the partition of n − h − 1 given by decreasing x k by 1, increasing x i by 1 and increasing x j by 1 (if i = j, the outcome is that x i is increased by 2). From the combination of the inductive assumption and the condition 2(n − h) < n, it follows that the resulting partition of n − h − 1 is in the image of our map. Applying the definition of ≺, it follows that the original partition of n − h is also in the image of our map. This completes the proof.
Problem 33. Find a closed formula for C (d) n,h for all d, n, h. and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons. org/licenses/by/4.0/.
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.