Abstract
For a positive integer d, a nonnegative integer n and a nonnegative integer \(h\le n\), we study the number \(C_{n}^{(d)}\) of principal ideals; and the number \(C_{n,h}^{(d)}\) of principal ideals generated by an element of rank h, in the dtonal 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.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and description of the results
Enumeration is often the starting point in understanding a given mathematical structure. Twisted monoid algebras [6, 21] of dtonal partition monoids appear in [22] as right SchurWeyl 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 wellstudied representation theory, see [13, 14]. The dtonal 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 dtonal partition algebras using combinatorics of Green’s relations for the finite dtonal partition monoid. The main question we answer in the present paper is what is the number of different principal 2sided 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_n^{(d)}\). Algebraically, there is a natural third parameter which enters the picture: the rank \(h\in \{0,1,\dots ,n\}\) of the generating partition. Using this parameter, we write
where \(C_{n,h}^{(d)}\) denotes the number of ideals generated by an element of rank h. We seek a closed formula for both \(C_{n,h}^{(d)}\) and for \(C_n^{(d)}\). 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_n^{(d)}\) 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_{n,h}^{(3)}\) in case h is relatively big (i.e. \(h\ge \lfloor \frac{n}{2}\rfloor \)), see Proposition 4, and in case h is relatively small (i.e. \(h\le \lceil \frac{n}{3}\rceil \)), 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_n^{(3)}\) 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_n^{(3)}\) 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_n^{(d)}\) 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.
2 Graded posets
2.1 Notation and general construction
We denote by \({\mathbb {R}}\) the set of all real numbers, by \({\mathbb {R}}_{\ge 0}\) the set of all nonnegative real numbers, by \({\mathbb {Z}}\) the set of all integers, by \({\mathbb {N}}\) the set of all positive integers and by \({\mathbb {Z}}_{\ge 0}\) the set of all nonnegative integers.
Consider the set \({\mathbb {Z}}^d\) for some fixed \(d\in {\mathbb {N}}\). Elements of \({\mathbb {Z}}^d\) are vectors \({\mathbf {v}}=(v_1,v_2,\dots ,v_d)\) such that \(v_i\in {\mathbb {Z}}\) for all \(i=1,2,\dots ,d\). The number \(v_1+v_2+\dots +v_d\in {\mathbb {Z}}\) is called the height of \({\mathbf {v}}\) and denoted \(\mathrm {ht}({\mathbf {v}})\). The set \({\mathbb {Z}}^d\) has the natural structure of an abelian group given by addition. The map \(\mathrm {ht}:{\mathbb {Z}}^d\rightarrow {\mathbb {Z}}\) is a surjective group homomorphism. For \(i=1,2,\dots ,d\), we denote by \({\mathbf {e}}(i)\) the standard basis vector \((0,0,\dots ,0,1,0,0,\dots ,0)\) in \({\mathbb {Z}}^d\), in which the only nonzero element 1 stands in position i. Note that each \({\mathbf {e}}(i)\) has height 1.
Denote by \(\Lambda _d\) the subset \({\mathbb {Z}}_{\ge 0}^d\) in \({\mathbb {Z}}^d\). For \(h\in {\mathbb {Z}}_{\ge 0}\), we denote by \(\Lambda _d^{(h)}\) the set of all elements in \(\Lambda _d\) of height h and note that the set \(\Lambda _d^{(h)}\) is finite, in fact, a standard combinatorial exercise shows that
Define \( {\mathbb {Z}}^d_{(h)} = \{{\mathbf {v}}\in {\mathbb {Z}}^d\,:\, \mathrm {ht}({\mathbf {v}})= h \} \). For a fixed subset
define on \(\Lambda _d\), the structure of a poset using the transitive closure \(<_X\) of the following manifestly antisymmetric relation:
Note from the construction that \(\lessdot _X\) is a covering relation. Directly from the definitions, we have that \({\mathbf {v}}\lessdot _X{\mathbf {w}}\) implies \(\mathrm {ht}({\mathbf {v}})=\mathrm {ht}({\mathbf {w}})1\), for all \({\mathbf {v}}\) and \({\mathbf {w}}\). In particular, the poset \((\Lambda _d,<_X)\) is a graded poset with rank function \(\mathrm {ht}:\Lambda _d\rightarrow {\mathbb {Z}}\). Note that \(X\ne X'\) implies \(\lessdot _X\ne \lessdot _{X'}\).
2.2 The poset \({\mathscr {P}}_{d}\)
Consider the set
For example,
Note that \(<_{X_d}\) is defined. Denote by \({\mathscr {P}}_{d}\) the poset \((\Lambda _d,<_{X_d})\). Finite principal ideals of \({\mathscr {P}}_{d}\) are the main objects of interest in this paper. For simplicity, we will denote the relation \(<_{X_d}\) by \(\prec \). For the record, we note the following.
Lemma 1
We have \(X_d = \frac{d(d1)}{2} +1\).
Proof
The pair \(\{i,j\}\) from the definition of \(X_d\) can be chosen in \(\left( {\begin{array}{c}d\\ 2\end{array}}\right) \) different ways for \(i\ne j\) and in d different ways for \(i=j\). After choosing \(\{i,j\}\), the element k is uniquely defined. Note that the d choices when \(\{i,j\}\cap \{d\}\ne \varnothing \) result in the same vector \({\mathbf {e}}(d)\). The claim follows. \(\square \)
For \({\mathbf {v}}\in {\mathscr {P}}_{d}\), we denote by \(I({\mathbf {v}})\) the principal ideal of \({\mathscr {P}}_{d}\) generated by \({\mathbf {v}}\), that is
For \(n\in {\mathbb {Z}}_{\ge 0}\), we set \(C_{n}^{(d)}:=I(n{\mathbf {e}}(1))\). For \(h=0,1,2,\dots ,n\), we also define
Then, we have \(C_{n}^{(d)}=C_{n,0}^{(d)}+C_{n,1}^{(d)}+\dots +C_{n,n}^{(d)}\). Our interest in \(I(n{\mathbf {e}}(1))\) will be explained in Section 6 (see Theorem 27).
We observe the following structural property of \({\mathscr {P}}_{d}\): for \(k=1,2,\dots ,d\), consider the set \(\Lambda _{d,k}\) which consists of all \({\mathbf {v}}\in \Lambda _{d}\) such that \(v_1+2v_2+3v_3+\dots +dv_d\equiv k\text { mod }d\). Note that \(\Lambda _{d,k}\cap \Lambda _{d,k'}= \varnothing \) if \(k\ne k'\). Denote by \({\mathscr {P}}_{d,k}\) the poset with the underlying set \(\Lambda _{d,k}\) obtained by restricting the relation \(<_{X_d}\) to \(\Lambda _{d,k}\). For \(h\in {\mathbb {Z}}_{\ge 0}\), set \(\Lambda _{d,k}^{(h)}:= \Lambda _{d,k}\cap \Lambda _{d}^{(h)}\).
Proposition 2

(i)
The poset \({\mathscr {P}}_{d}\) is a disjoint sum of subposets \({\mathscr {P}}_{d,k}\) for \(k=1,2,\dots ,d\).

(ii)
Each \({\mathscr {P}}_{d,k}\) is an indecomposable poset in the sense that it is not isomorphic to the disjoint sum of two nonempty posets.
Proof
Claim (i) follows from the definitions since d divides \(v_1+2v_2+\dots +dv_d\), for each \({\mathbf {v}}\in X_d\).
Note that \({\mathbf {e}}(k)\in {\mathscr {P}}_{d,k}\). Therefore, to prove claim (ii), it is enough to show that \({\mathbf {e}}(k)\prec {\mathbf {v}}\), for any \({\mathbf {v}}\in {\mathscr {P}}_{d,k}\) of height at least 2. However, if \({\mathbf {v}}\) has height at least 2, then either \({\mathbf {v}}\) has a coordinate which is greater than or equal to 2, or \({\mathbf {v}}\) has at least two nonzero coordinates. Therefore, there is \({\mathbf {x}}\in X_d\) such that \({\mathbf {v}}+{\mathbf {x}}\in \Lambda _{d}\). We have \({\mathbf {v}}+{\mathbf {x}}\prec {\mathbf {v}}\) and from the observation in the previous paragraph we see that \({\mathbf {v}}+{\mathbf {x}}\in \Lambda _{d,k}\). Therefore \({\mathbf {e}}(k)\prec {\mathbf {v}}\) follows by induction on the height of \({\mathbf {v}}\). This completes the proof. \(\square \)
From the above proof, it follows that for \(k\ne d\), the element \({\mathbf {e}}(k)\) is the minimum element in \({\mathscr {P}}_{d,k}\) and that the minimum element in \({\mathscr {P}}_{d,d}\) is \({\mathbf {0}}:=(0,0,\dots ,0)\).
2.3 The case \(d=1\)
In the case \(d=1\), the map
is an isomorphism of posets. For \(n\in {\mathbb {Z}}_{\ge 0}\), we have
and thus \(C_{n}^{(1)}=n+1\). Note that in this case, the poset \({\mathscr {P}}_{1}={\mathscr {P}}_{1,1}\) is indecomposable.
2.4 The case \(d=2\)
Our first observation in this case is that the maps
are mutually inverse isomorphisms of posets. Consequently, we have \(C_{n}^{(2)}=C_{n+1}^{(2)}\), for all even \(n\in {\mathbb {Z}}_{\ge 0}\). The lower part of the Hasse diagram for \({\mathscr {P}}_{2,2}\) is shown in Figure 1.
It follows immediately that for \(k\in {\mathbb {Z}}_{\ge 0}\), we have
We also note that \(I(2k{\mathbf {e}}(1))\subset I(2(k+1){\mathbf {e}}(1))\), for all \(k\in {\mathbb {Z}}_{\ge 0}\), and that
It is also worth pointing out that for each \(k\in {\mathbb {Z}}_{\ge 0}\), the poset \(I(2k{\mathbf {e}}(1))\) is isomorphic to the poset \(I(2k{\mathbf {e}}(1))^{\mathrm {op}}\) (the latter is obtained from \(I(2k{\mathbf {e}}(1))\) by reversing the partial order).
3 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.
3.1 Isomorphism of \({\mathscr {P}}_{3,1}\) and \({\mathscr {P}}_{3,2}\)
The symmetric group \(S_2\) acts on \(\Lambda _3\) as follows: for \({\mathbf {v}}=(v_1,v_2,v_3)\) and \(\pi \in S_2\) we have \(\pi \cdot {\mathbf {v}}=(v_{\pi (1)},v_{\pi (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 \({\mathscr {P}}_{3}\) by automorphisms. Using this action, we can swap \({\mathbf {e}}(1)\) and \({\mathbf {e}}(2)\) and hence \({\mathscr {P}}_{3,1}\) and \({\mathscr {P}}_{3,2}\) (cf. proof of Proposition 2). Therefore, the posets \({\mathscr {P}}_{3,1}\) and \({\mathscr {P}}_{3,2}\) are isomorphic.
3.2 An alternative description
In this subsection, we observe that \({\mathscr {P}}_{3}\) can be defined by restriction from \({\mathbb {Z}}^3\). This is a useful property for computations using computers.
We mimic the definition of \({\mathscr {P}}_{3}\) starting from \({\mathbb {Z}}^3\) instead of \(\Lambda _3\). Consider the set \(X_3\) as defined in Subsection 2.2. Use (2.2) to define the covering relation on \({\mathbb {Z}}^3\) and let \(\prec '\) denote the partial order on \({\mathbb {Z}}^3\) induced by this covering relation. Our main observation here is the following:
Proposition 3
The relation \(\prec \) coincides with the restriction of the relation \(\prec '\) to \(\Lambda _3\).
Proof
Let \(\underline{\prec '}\) denote the restriction of the relation \(\prec '\) to \(\Lambda _3\). Clearly, \(\prec \subset \underline{\prec '}\), so we only need to show that \(\underline{\prec '}\subset \prec \).
Let \({\mathbf {v}},{\mathbf {w}}\in \Lambda _3\) be such that \({\mathbf {v}}\prec '{\mathbf {w}}\). We have to show that \({\mathbf {v}}\prec {\mathbf {w}}\). Assume that this is not the case and that the pair \(({\mathbf {v}},{\mathbf {w}})\) satisfying \({\mathbf {v}}\prec '{\mathbf {w}}\) and \({\mathbf {v}}\not \prec {\mathbf {w}}\) is chosen such that \(\mathrm {ht}({\mathbf {w}}{\mathbf {v}})=k\in {\mathbb {N}}\) is minimal possible. As \({\mathbf {v}}\prec '{\mathbf {w}}\), there is a sequence of elements \({\mathbf {x}}_1,{\mathbf {x}}_2,\dots ,{\mathbf {x}}_k\in X_3\) such that
Consider \({\mathbf {v}}_i={\mathbf {v}}{\mathbf {x}}_i\) for \(i=1,2,\dots ,k\). We claim that all \({\mathbf {v}}_i\not \in \Lambda _3\). Indeed, if \({\mathbf {v}}_i\in \Lambda _3\), then we would have \({\mathbf {v}}\prec {\mathbf {v}}_i\) and \({\mathbf {v}}_i\prec '{\mathbf {w}}\). This would imply \({\mathbf {v}}_i\not \prec {\mathbf {w}}\) which would contradict our minimal choice of k. In particular, none of the \({\mathbf {x}}_i\)’s equals \((0,0,1)\) since \({\mathbf {v}}(0,0,1)\in \Lambda _3\) because \({\mathbf {v}}\in \Lambda _3\).
The next step is to show that none of the \({\mathbf {x}}_i\)’s equals \((1,1,1)\). Otherwise, without loss of generality, we may assume that \({\mathbf {x}}_k=(1,1,1)\). Then, we have \({\mathbf {v}}_k\not \in \Lambda _3\), and hence, \({\mathbf {v}}=(*,*,0)\) and \({\mathbf {v}}_k=(*,*,1)\). Furthermore, we have
Since \({\mathbf {w}}\in \Lambda _3\), the third coordinate in \({\mathbf {w}}\) is nonnegative. This means that at least one of the \({\mathbf {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 \({\mathbf {x}}_i\)’s equals \((0,0,1)\), a contradiction.
Therefore, each \({\mathbf {x}}_i\) is equal to either \((2,1,0)\) or \((1,2,0)\). Assume that all \({\mathbf {x}}_i\) are equal, say to \((2,1,0)\) (the case of \((1,2,0)\) is similar). Then, \({\mathbf {v}}={\mathbf {w}}+k(2,1,0)\). Since both \({\mathbf {v}}\) and \({\mathbf {w}}\) are in \(\Lambda _3\), we have \({\mathbf {w}}+i(2,1,0)\in \Lambda _3\) for all i such that \(1\le i\le k\). Therefore, \({\mathbf {v}}\prec {\mathbf {w}}\), a contradiction.
The last paragraph establishes that at least one of the \({\mathbf {x}}_i\)’s equals \((2,1,0)\) and at least one equals \((1,2,0)\). This implies \({\mathbf {v}}(2,1,0)(1,2,0)={\mathbf {v}}+(1,1,0)\prec ' {\mathbf {w}}\). At the same time, we have
as \({\mathbf {v}}\in \Lambda _3\) and
This implies \({\mathbf {v}}+(1,1,0)\not \prec {\mathbf {w}}\) which again contradicts our minimal choice of k. The claim follows. \(\square \)
3.3 Small values
The table of \(C_{n,h}^{(3)}\) 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.
3.4 Values of \(C_{n,h}^{(3)}\) 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:
Comparison with columns of 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:
Proposition 4
For \(h\ge \lceil \frac{n}{2}\rceil \), we have \(C_{n,h}^{(3)}=A001399(nh)\).
Proof
Let (a, b, c) be a partition of \(nh\) in at most three parts, that is, \(a,b,c\in {\mathbb {Z}}_{\ge 0}\), \(a\ge b\ge c\) and \(a+b+c=nh\). Then, we claim that
By Proposition 3, it is enough to show that \({\mathbf {v}}_{(a,b,c)}\in \Lambda _3\). The latter however follows from \(2a+b\le n\) (thanks to \(h\ge \lceil \frac{n}{2}\rceil \)) and \(b\ge 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 \({\mathbf {v}}_{(a,b,c)}\ne {\mathbf {v}}_{(a',b',c')}\) provided that \((a,b,c)\ne (a',b',c')\). Therefore, \(C_{n,h}^{(3)}\ge A001399(nh)\).
Now, consider some \(v\in I(n{\mathbf {e}}(1))\) with height h. Then,
for some \(a,b,c,d\in {\mathbb {Z}}_{\ge 0}\). Since the second coordinate of v is nonnegative, we have \(a\ge d\). Since
we have
and thus may assume that \(d=0\) in (3.1). We have \(a+b+c=nh\) since v has height h, \(b\ge c\) as the third coordinate of v is nonnegative and \(a\ge b\) as the second coordinate of v is nonnegative. Therefore, \(v={\mathbf {v}}_{(a,b,c)}\), for the partition (a, b, c) of \(nh\). The claim of the proposition follows. \(\square \)
3.5 Values of \(C_{n,h}^{(3)}\) for small h
We start this subsection with the following observation:
Proposition 5
For \(h\le \lceil \frac{n}{3}\rceil \), we have \(\Lambda _3^{(h)}\cap I(n{\mathbf {e}}(1))= \Lambda _3^{(h)}\cap \Lambda _{3,k}\), where \(k\in \{1,2,3\}\) is such that \(n\equiv k(\mathrm {mod}\, 3)\).
Proof
As \(I(n{\mathbf {e}}(1))\subset \Lambda _{3,k}\), for our choice of k, to prove the assertion of this proposition, we only need to show that \((\Lambda _3^{(h)}\cap \Lambda _{3,k})\subset (\Lambda _3^{(h)}\cap I(n{\mathbf {e}}(1)))\). If \(v\in (\Lambda _3^{(h)}\cap \Lambda _{3,k})\setminus (\Lambda _3^{(h)}\cap I(n{\mathbf {e}}(1)))\), for some h, then \(v+(0,0,1)\in (\Lambda _3^{(h+1)}\cap \Lambda _{3,k})\setminus (\Lambda _3^{(h+1)}\cap I(n{\mathbf {e}}(1)))\) since \(I(n{\mathbf {e}}(1)))\) is an ideal. Therefore, it is enough to prove the proposition for \(h=\lceil \frac{n}{3}\rceil \) which we from now on assume. Set \(q:=\lfloor \frac{n}{3}\rfloor \). We will have to consider three different cases depending on k.
Case 1: \(k=3\). In this case, \(q=h=\frac{n}{3}\). Let \((a,b,c)\in \Lambda _3^{(h)}\cap \Lambda _{3,k}\), that is \(a,b,c\in {\mathbb {Z}}_{\ge 0}\), \(a+b+c=h\) and 3 divides \(a+2b\). In this case, we have
Now, \(n3c2b=3a+b\). Since 3 divides both \(a+2b\) and \(3a+3b\), it also divides \(2a+b\). Therefore, there is \(p\in {\mathbb {Z}}_{\ge 0}\) such that \(2a+b=3p\). We have
Combining (3.2) and (3.3) implies \((a,b,c)\prec (n,0,0)\) and hence \((a,b,c)\in I(n{\mathbf {e}}(1))\).
Case 2: \(k=2\). In this case, \(q=h1\) and \(n=3h1\). Let \((a,b,c)\in \Lambda _3^{(h)}\cap \Lambda _{3,k}\), that is \(a,b,c\in {\mathbb {Z}}_{\ge 0}\), \(a+b+c=h\) and 3 divides \(a+2b2\). Formula (3.2) still holds in this case. Now, \(n3c2b=3a+b1\). Since 3 divides both \(a+2b2\) and \(3a+3b\), it also divides \(2a+b1\). Therefore, there is \(p\in {\mathbb {Z}}_{\ge 0}\) such that \(2a+b1=3p\). Formula (3.3) still holds in this case. Again it follows that \((a,b,c)\in I(n{\mathbf {e}}(1))\).
Case 3: \(k=1\). In this case, \(q=h1\) and \(n=3h2\). Let \((a,b,c)\in \Lambda _3^{(h)}\cap \Lambda _{3,k}\), that is \(a,b,c\in {\mathbb {Z}}_{\ge 0}\), \(a+b+c=h\) and 3 divides \(a+2b1\). Formula (3.2) still holds in this case. Now, \(n3c2b=3a+b2\). Since 3 divides both \(a+2b1\) and \(3a+3b\), it also divides \(2a+b2\). Therefore, there is \(p\in {\mathbb {Z}}_{\ge 0}\) such that \(2a+b2=3p\). Formula (3.3) still holds in this case, and we similarly obtain \((a,b,c)\in I(n{\mathbf {e}}(1))\). \(\square \)
Lemma 6

(i)
If 3 does not divide h, then \(\Lambda _{3,1}^{(h)}=\Lambda _{3,2}^{(h)}= \Lambda _{3,3}^{(h)}\).

(ii)
If 3 divides h, then \(\Lambda _{3,1}^{(h)}=\Lambda _{3,2}^{(h)}= \Lambda _{3,3}^{(h)}1\).
Proof
We prove both statements at the same time by induction on h. Let us arrange elements of \(\Lambda _{3}^{(h)}\) 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
For a fixed h, the set \(\Lambda _3^{(h)}\) corresponds to the first \(h+1\) “bottomlefttotopright” diagonals starting from the bottom right corner. The induction step \(h\rightarrow h+1\) corresponds to adding the next diagonal.
By a direct inspection of the above tables, we have
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 \((a1)+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 \(h1\).
If 3 divides \(h2\), 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. \(\square \)
For a set X, we denote by \(\delta _{X}\) the indicator function of X, that is,
Corollary 7
For \(h\le \lceil \frac{n}{3}\rceil \), we have
Proof
We have \(C_{n,h}^{(3)}=I(n{\mathbf {e}}(1))\cap \Lambda _3^{(h)}\) by definition and \(I(n{\mathbf {e}}(1))\cap \Lambda _3^{(h)}=\Lambda _3^{(h)}\cap \Lambda _{3,k}\) by Proposition 5. Further, \(\Lambda _3^{(h)}\cap \Lambda _{3,k}=\Lambda _{3,k}^{(h)}\) again by definition. Now the claim follows applying Lemma 6 and Formula (2.1) and keeping \(\Lambda _{3}^{(h)}=\Lambda _{3,1}^{(h)}+\Lambda _{3,2}^{(h)}+\Lambda _{3,3}^{(h)}\) in mind. \(\square \)
In the case when 3 does not divide n, the sequence \(\frac{(h+1)(h+2)2\delta _{3{\mathbb {Z}}}(h)}{6}\) is A001840(h) from [19]. In the case when 3 divides n, the sequence \(\frac{(h+1)(h+2)+4\delta _{3{\mathbb {Z}}}(h)}{6}\) is \(A007997(h+2)\) from [19]. However, it seems that our interpretation of both these sequences does not appear on [19] at the moment. We note that the sequence \(A001840(h+1)A001840(h)\) is the sequence
while the sequence \(A007997(h+3)A007997(h+2)\) is the sequence
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 \(\lceil \frac{n}{3}\rceil \) for the value of h for which \(C_{n,h}^{(3)}\) 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 \(C_{n,h}^{(3)}\), where \(\lceil \frac{n}{3}\rceil<h<\lceil \frac{n}{2}\rceil \).
We do not know how hard this problem is, we do not see how to approach it in full generality.
3.6 Sequence A028289
The sequence A028289 in [19] lists coefficients in the expansion of \(\frac{1+t^2+t^3+t^5}{(1t)(1t^3)(1t^4)(1t^6)}\). Here are the first 25 elements in this sequence:
This sequence appears in [3]. Comparison with the first row of Figure 2 suggests that \(C_{n}^{(3)}=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.

Consider first the sequence \(0,1,2,3,4,5\dots \) of all nonnegative integers.

Construct the second sequence \(0,1,1,2,2,3,3,4,4,5,5,\dots \) by repeating all nonzero terms in the previous sequence twice.

Define the third sequence as the sequence of partial sums of the second sequence: \(0,1,2,4,6,9,12,16,20,25,30,\dots \).

Construction of the fourth sequence is the most complicated one. The sequence is:
$$\begin{aligned} 1,0,1,2,1,2,4,2,4,6,4,6,9,6,9,12,9,12,16,12,16,20,16,20,\dots \end{aligned}$$and this is obtained by adding appropriately shifted fiveterm frames of the form (i, 0, i, 0, i), where i an element of the third sequence, as shown here:
$$\begin{aligned} \begin{array}{rcccccccccccccccccc} &{}1&{}0&{}1&{}0&{}1\\ &{}&{}&{}&{}2&{}0&{}2&{}0&{}2\\ &{}&{}&{}&{}&{}&{}&{}4&{}0&{}4&{}0&{}4\\ &{}&{}&{}&{}&{}&{}&{}&{}&{}&{}6&{}0&{}6&{}0&{}6\\ &{}&{}&{}&{}&{}&{}&{}&{}&{}&{}&{}&{}&{}\dots &{}\dots &{}\dots \\ \hline \text {add:}&{}1&{}0&{}1&{}2&{}1&{}2&{}4&{}2&{}4&{}6&{}4&{}6&{}\dots &{}\dots &{}\dots \end{array} \end{aligned}$$ 
The final, fifth, sequence is the sequence of partial sums of the fourth sequence:
$$\begin{aligned} 1,1,2,4,5,7,11,13,17,23,27,33,42,48,57,69,78,90,106,118,134,154,170,190,\dots \end{aligned}$$
Proposition 9
The fifth sequence constructed above coincides with A028289.
Proof
Let us compute the generating function of all sequences constructed above. For the first sequence, the generating function is
For the second sequence, we get
Convolution with \(1,1,1,\dots \), that is, the sequence with generating function \(\frac{1}{1t}\), implies that the generating function for the third sequence is
The generating function for the fourth sequence is
Finally, yet another convolution with \(1,1,1,\dots \) gives the generating function
for the fifth sequence. The latter generating function coincides with the generating function
of A028289 since
The claim follows. \(\square \)
Our second construction of A028289 (which is relevant for Theorem 11 in the following subsection) uses the following observation:
Lemma 10
We have
Proof
We have to check that
This is a straightforward computation. \(\square \)
Lemma 10 implies that A028289 can be constructed in the following four combinatorial steps.

Consider first the sequence \(1,2,3,4,5\dots \) of all positive integers.

Construct the second sequence \(1,0,1,1,1,1,2,1,2,2,2,2,3,2,\dots \) by repeating the pattern \(i,*,i,i,i,i,*,i\) of the terms in the previous sequence using shift in six positions.

Construct the third sequence \(1,0,1,2,1,2,4,2,4,\dots \) by convolution of the second sequence with \(1,0,0,1,0,0,1,0,0,1,\dots \).

The final, fourth, sequence is the sequence of partial sums of the third sequence:
$$\begin{aligned} 1,1,2,4,5,7,11,13,17,23,27,33,42,48,57,69,78,90,106,118,134,154,170,190,\dots \end{aligned}$$
3.7 Computation of \(C_n^{(3)}\)
Here, we prove our first main result.
Theorem 11
We have \(C_{n}^{(3)}=A028289(n)\) for all \(n\in {\mathbb {Z}}_{\ge 0}\).
Proof
Taking Lemma 10 into account, to prove the assertion of our theorem, it is enough to show that
For a variable n, consider the sets
For \(v\in \tilde{D}_n\), we denote by \(\Phi (v)=\Phi _n(v)\) the unique element in \(D_n\) for which we have \( \Phi (v)v\in {\mathbb {Z}}(3,0,0)\). This is welldefined as the \({\mathbb {Z}}\)linear span of the linearly independent vectors \((2,1,0)\), \((1,1,0)\) and (0, 0, 1) coincides with the \({\mathbb {Z}}\)linear span of the linearly independent vectors \((2,1,0)\), \((3,0,1)\) and \((3,0,0)\).
Our first observation is the following:
Lemma 12
For any \({\mathbf {v}}\in I(n{\mathbf {e}}(1))\), we have
Proof
We have
for \(a,b,c,d,\in {\mathbb {Z}}_{\ge 0}\), by definition. From \({\mathbf {v}}\in I(n{\mathbf {e}}(1))\), by looking at the second and the third coordinates of \({\mathbf {v}}\), we obtain \(a2bc\ge 0\) and \(cd\ge 0\). Now we rewrite
As \((n,0,0)+(a2bc)(2,1,0)+(cd)(3,0,1)\in D_n\), the claim of the lemma follows from the definition of \(\Phi \). \(\square \)
Motivated by Lemma 12, for \(i\in {\mathbb {Z}}_{\ge 0}\), set \(f_i:=T_i\), where
Lemma 13
We have
Proof
The proof is illustrated in Figure 4. By definition, \(f_i\) enumerates lattice points of the twodimensional cone \({\mathbf {C}}:=(n,0,0)+{\mathbb {Z}}_{\ge 0}(2,1,0)+ {\mathbb {Z}}_{\ge 0}(3,0,1)\) (the points of \({\mathbf {C}}\) are depicted as bullet points in Figure 4) belonging to the line, in the plane determined by the cone, given by the condition that the first coordinate of the point on the line equals \(ni\) (these lines are depicted as dashed lines in Figure 4).
A direct calculation gives the following values for small i:
For \(i=6\), we, for the first time, have \(f_i=2>1\). This implies that \(f_i\) satisfies the recursion \(f_{i+6}=f_{i}+1\), for all \(i\ge 0\). Indeed, from Figure 4, we see that \({\mathbf {C}}\) is the disjoint union of the shifted copy \({\mathbf {C}}+(6,0,2)\) of \({\mathbf {C}}\) and the remaining strip of width 2 going northeast in Figure 4. The recursion follows by noting that for \(i\ne 1\), the corresponding dashed line intersects the remaining strip in exactly one point and that for \(i\ge 6\), the intersection of the corresponding dashed line with \({\mathbf {C}}+(6,0,2)\) has exactly \(f_{i6}\) points, due to the observation above and the linearity of the definitions.
The claim of the lemma follows by combining the recursion \(f_{i+6}=f_{i}+1\) with the initial values listed in (3.5). \(\square \)
For each \(n\in {\mathbb {Z}}_{\ge 0}\), mapping \({\mathbf {v}}\mapsto {\mathbf {v}}+(1,0,0)\) defines an injection from \(I((n1){\mathbf {e}}(1))\) to \(I(n{\mathbf {e}}(1))\). Set \(g_n:=C_{n}^{(3)}C_{n1}^{(3)}\ge 0\) (under the convention \(C_{1}^{(3)}=0\)). Then, we have
by construction. This reduces the claim of the theorem to the following crucial observation:
Lemma 14
We have \(g_n=f_n+f_{n3}+f_{n6}+\dots \), for all n, where we assume \(f_k=0\), for \(k<0\).
Proof
First of all, we claim that the map
induces a bijection between \(I((n1){\mathbf {e}}(1))\) and the set
Indeed, the inverse map is easily seen to be given by \({\mathbf {w}}\mapsto {\mathbf {w}}(1,0,0)\).
Therefore, we need to show that \(f_n+f_{n3}+f_{n6}+\dots \) enumerates the set
Note that the restriction of \(\Phi =\Phi _n\) to R is injective since the linear span of R intersects \({\mathbb {Z}}(3,0,0)\), see the definition of \(\Phi \), in exactly one element, namely (0, 0, 0). Therefore, it is enough to enumerate \(\Phi (R)\). We claim that
(note that this union is automatically disjoint), which is a reformulation of the assertion of the lemma due to the rule of sum.
We have \(\Phi (R)\subset T_{n}\cup T_{n1}\cup T_{n2}\cup \dots \) by Lemma 12. As the first coordinate of each \(v\in R\) is zero and \(\Phi (v)v\in {\mathbb {Z}}(3,0,0)\) by definition, it follows that the first coordinate of \(\Phi (v)\), for \(v\in R\), must be divisible by 3, that is \(\Phi (R)\subset T_{n}\cup T_{n3}\cup T_{n6}\cup \dots \).
For the inverse inclusion, take some \(v=(n2a3b,a,b)\in T_{n3j}\), for some \(j\ge 0\). Then, \(n2a3b=3j\), by definition. Clearly, \(v\prec n{\mathbf {e}}(1)\). If \(j=0\), then \(v\in R\) and \(\Phi (v)=v\). If \(j>0\), then we apply to v the following procedure j times: first add \((2,1,0)\), then add \((1,1,1)\), then add \((0,0,1)\). It is easy to see that, by doing this, we follow the order \(\prec \) inside \(I(n{\mathbf {e}}(1))\). As \((3,0,0)=(2,1,0)+(1,1,1)+(0,0,1)\), as the result, we obtain \((0,a,b)\prec v\). In particular, we have \((0,a,b)\in R\). From the definition of \(\Phi \) and Lemma 12, we obtain \(\Phi ((0,a,b))=v\). Therefore \(T_{n}\cup T_{n3}\cup T_{n6}\cup \dots \subset \Phi (R)\). This proves (3.7) and completes the proof of the lemma. \(\square \)
To prove our theorem, we need to prove (3.4). Lemma 13 corresponds to the last two factors on the righthand 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.
As a direct consequence of Theorem 11 and [3, 4], we get:
Corollary 15
For \(i\in {\mathbb {N}}\), we have:
4 \(C_{n}^{(3)}\) and hollow hexagons
4.1 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 \(\frac{\pi }{3}\). A tiling line of type 3 is a tiling line obtained from a tiling line of type 1 by a clockwise rotation by \(\frac{2\pi }{3}\).
4.2 Thexagons and their henvelopes
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 thexagon is, by definition, the intersection of three tiling strips, one for each type. Note that a thexagon 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 thexagon we mean its perimeter as a polygon. Clearly, each thexagon 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
generated by reflections with respect to the sides of the fundamental region of the tiling. Two thexagons which can be obtained from each other applying some element in \(\Delta (3,3,3)\) will be called isomorphic. For \(n\in {\mathbb {Z}}_{\ge 0}\), we denote by \(T_n\) the number of isomorphism classes of thexagons with perimeter 2n.
Centroids of tiling triangles form a dual hexagonal tiling of our plane. Given a thexagon 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 thexagon (bold lines) and its hexagonal envelope (dotted lines).
Lemma 16
Let H be a thexagon of perimeter i for some \(i\in {\mathbb {Z}}_{\ge 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 thexagons of perimeter i. These thexagons are given in the following list:
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 thexagon \(H'\). There are four possible cases.
Case 1. The thexagon \(H'\) is obtained from H by collapsing a line segment to a vertex as illustrated here:
In this case, we see that the perimeter of H decreases by 2 and the number of vertices of the hexagonal envelope decreases by 4.
Case 2. The thexagon \(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 1 and the number of vertices of the hexagonal envelope by 2.
Case 3. The thexagon \(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 thexagon \(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. \(\square \)
Hexagonal envelopes of thexagons 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).
4.3 Characters of thexagons
We would like to encode thexagons using vectors with nonnegative 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 thexagon 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 thexagon 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 \(\chi (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 thexagon in Figure 7, we have \(\chi (H)=(1,1,1,1,1,1)\), while for the thick thexagon in Figure 6, we have \(\chi (H)=(3,0,2,2,1,1)\). The vector \(\chi (H)\) will be called the character of H.
One could also give a description of \(\chi (H)\) as follows: Start with the rightmost vertex on the bottom edge of H. Walk along \(v_1\) until the next vertex (which might coincide with the starting one). The number \(a_1\) is the length of this walk. Continue along \(v_3\) to record \(a_2\), then along \(v_2\) to record \(a_3\) and so on in the order described above.
The original action of \(\Delta (3,3,3)\) induces an action on the set of characters of thexagons which is generated by the cyclic permutations of components of the character and the flip
Using this action, we can change H to an isomorphic thexagon \(H'\) such that we have \(\chi (H')=(a_1,a_2,a_3,a_4,a_5,a_6)\) where the following conditions are satisfied:
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 thexagon 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)\in {\mathbb {Z}}_{\ge 0}^6\) is the character of some thexagon if and only if
Taking into account \(v_3=v_1v_2\) and linear independence of \(v_1\) and \(v_2\), Equation (4.2) is equivalent to
Lemma 17
Let H be a distinguished thexagon and \(\chi (H)=(a_1,a_2,a_3,a_4,a_5,a_6)\). Then, we have
Proof
From Equation (4.3), we have \(a_1a_4=a_5a_2=a_3a_6\). Plugging \(a_1a_4=a_5a_2\) into the first inequality in (4.1) implies \(\quad a_3\le a_6\). Plugging \(a_5a_2=a_3a_6\) into the first inequality in (4.1) implies \(a_1\le a_4\). Plugging \(a_1a_4=a_3a_6\) into the first inequality in (4.1) implies \(a_5\le a_2\). \(\square \)
4.4 Elementary operations on distinguished thexagons
Let H be a distinguished thexagon and \(\chi (H)=(a_1,a_2,a_3,a_4,a_5,a_6)\). We consider four elementary operations on hexagons.
Operation \({\varvec{\Phi }}\). Assume \(a_1a_3\ge 2\). Then, using Lemma 17, it is easy to check that the vector
satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished thexagon which we denote by \(\Phi (H)\). Here is an example of this operation:
Operation \({\varvec{\Psi }}\). Assume \(a_1>a_3>a_5\). Then, using Lemma 17, it is easy to check that the vector
satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished thexagon which we denote by \(\Psi (H)\). Here is an example of this operation:
Operation \({\varvec{\Theta }}\). Assume \(a_5>0\). Then, using Lemma 17, it is easy to check that the vector
satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished thexagon which we denote by \(\Theta (H)\). Here is an example of this operation:
Operation \({\varvec{\Lambda }}\). Assume \(a_3a_5\ge 2\). Then, using Lemma 17, it is easy to check that the vector
satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished thexagon which we denote by \(\Lambda (H)\). Here is an example of this operation:
Directly from the definitions, it is easy to see that all maps \(\Phi \), \(\Psi \), \(\Theta \) and \(\Lambda \) do not change the perimeter. As illustrated by the examples, all these maps have rather transparent geometric interpretations which could be obtained by moving the boundary tiling lines of the tiling strips which define the original thexagon.
4.5 Signature and defect
Let H be a distinguished thexagon. Assume that \(\chi (H)=(a_1,a_2,a_3,a_4,a_5,a_6)\). Then, the vector \(\mathrm {sign}(H):=(a_1a_3,a_3a_5,a_5)\in {\mathbb {Z}}_{\ge 0}^3\) will be called the signature of H. For example, the regular hexagon in Figure 7 has signature (0, 0, 1) while a distinguished thexagon isomorphic to the thexagon in Figure 6 has signature (1, 1, 0). Directly from the definitions, one computes that for any distinguished thexagon H, we have:
provided that the thexagons \(\Phi (H)\), \(\Psi (H)\), \(\Theta (H)\) or, respectively, \(\Lambda (H)\), are defined.
We define the defect of H as
and note that the defect of a distinguished thexagon is always nonnegative.
4.6 The number of thexagons
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\in {\mathbb {Z}}_{\ge 0}\), mapping H to \(\mathrm {sign}(H)\) induces a bijection between the set of isomorphism classes of distinguished thexagons of perimeter 2n and the set \(I(n{\mathbf {e}}(1))\).
Proof
Consider a distinguished thexagon Q having the character (n, 0, 0, n, 0, 0). The signature of this thexagon is \((n,0,0)=n{\mathbf {e}}(1)\). Applying, whenever possible, a sequence of operations \(\Phi \), \(\Psi \), \(\Theta \) and \(\Lambda \) to Q, produces a set of thexagons 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(n{\mathbf {e}}(1))\). Observe that the operation \(\Phi \) is defined as soon as \(a_1a_3\ge 2\) and that this condition is equivalent to the fact that adding \((2,1,0)\) to the signature of the input thexagon gives a vector with nonnegative coordinates. Put differently, if we have a thexagon such that the sum of its signature and \((2,1,0)\) has nonnegative coordinates, then \(\Phi \) can be applied to this thexagon. Similar observations also apply to \(\Psi \) and \((1,1,1)\), to \(\Theta \) and \((0,0,1)\) and to \(\Lambda \) and \((1,2,0)\). Consequently, the set of signatures for all thexagons which can be obtained from Q by all possible sequences of \(\Phi \), \(\Psi \), \(\Theta \) and \(\Lambda \) coincides with \(I(n{\mathbf {e}}(1))\).
Our next step is to show that each distinguished thexagon of perimeter 2n can be obtained from Q using a sequence of operations of the form \(\Phi \), \(\Psi \), \(\Theta \) and \(\Lambda \) (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
satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished thexagon. Therefore, \(K=\Psi (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 \(\Psi \)’s, from some distinguished thexagon \(K'\), the character of which has zerofifth coordinate.
Let K be a distinguished thexagon 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
satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished thexagon. Therefore, \(K=\Phi (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 \(\Phi \)’s and \(\Psi \)’s, from some distinguished thexagon \(K'\) the character of which has zerothird and fifth coordinates.
Let K be a distinguished thexagon of perimeter 2n with character \((a_1,a_2,0,a_4,0,a_6)\). Then, \(a_4\ge 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_4a_1>0\). If \(a_4>a_1+1\), then, using Lemma 17, it is easy to check that the vector
satisfies all conditions in (4.1) and (4.3) and hence is the character of a unique distinguished thexagon, say \(K'\). Note that, by construction, \(\mathrm {def}(K')<\mathrm {def}(K)\) and that \(K=\Theta (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 thexagon of perimeter 2n is obtained using \(\Phi \), \(\Psi \) and \(\Theta \) from a distinguished thexagon 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 thexagon 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(n{\mathbf {e}}(1))\). So, it remains to show that the signature map is injective.
Let K be a distinguished thexagon 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\in {\mathbb {Z}}_{\ge 0}\). From (4.3), we have
Since the perimeter of K is 2n, we also have
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. \(\square \)
As an immediate corollary from Theorem 18, we have:
Corollary 19
For all \(n\in {\mathbb {Z}}_{\ge 0}\), \(C_{n}^{(3)}\) is the number of isomorphism classes of thexagons 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=\varnothing \).
Corollary 20
Let \(n\in {\mathbb {Z}}_{\ge 0}\). Mapping H with \(\chi (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 thexagons of perimeter 2n and the set \(P_{n}\cup P_{n3}\cup P_{n6}\cup \dots \). In particular, we have
Proof
Restricting the bijection constructed in the proof of Theorem 18 to the set of distinguished thexagons of defect 2i and thereafter mapping \(\mathrm {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 thexagons of defect 2i to \(P_{ni}\). \(\square \)
5 Partitions modulo d
5.1 Partitions and refinement
For \(n\in {\mathbb {Z}}_{\ge 0}\) denote by \(\Pi _n\) the set of all partitions of n, that is, the set of all tuples \(\varvec{\lambda }=(\lambda _1,\lambda _2,\dots ,\lambda _k)\) such that \(\lambda _1,\lambda _2,\dots ,\lambda _k\in {\mathbb {N}}\), \(n=\lambda _1+\lambda _2+\dots +\lambda _k\) and \(\lambda _1\ge \lambda _2\ge \dots \ge \lambda _k\). As usual, we write \(\varvec{\lambda }\vdash n\) for \(\varvec{\lambda }\in \Pi _n\).
For \(\varvec{\lambda }=(\lambda _1,\lambda _2,\dots ,\lambda _k)\vdash n\) and \(\varvec{\mu }=(\mu _1,\mu _2,\dots ,\mu _l)\vdash n\), we say that \(\varvec{\lambda }\) refines \(\varvec{\mu }\) and write \(\varvec{\mu }< \varvec{\lambda }\) provided that \(l<k\) and there is a partition \(J_1\cup J_2\cup \dots \cup J_l\) of \(\{1,2,\dots ,k\}\) into a disjoint union of nonempty subsets such that
The partially ordered set \((\Pi _n,<)\) was studied in [1, 2, 23]. In particular, in [23], it was shown that it has some nasty properties. We refer the reader to [23] for more details on this poset.
The poset \((\Pi _n,<)\) is graded with respect to the rank function \((\lambda _1,\lambda _2,\dots ,\lambda _k)\mapsto k\).
5.2 Partitions modulo d
For \(d\in {\mathbb {N}}\), define an equivalence relation \(\sim _d\) on \(\Pi _n\) as follows: Given \(\varvec{\lambda }=(\lambda _1,\lambda _2,\dots ,\lambda _k)\vdash n\) and \(\varvec{\mu }=(\mu _1,\mu _2,\dots ,\mu _l)\vdash n\) set \(\varvec{\lambda }\sim _d\varvec{\mu }\) provided that \(k=l\) and there is \(\pi \in S_k\) such that d divides \(\lambda _i\mu _{\pi (i)}\), for all i. In other words, \(\varvec{\lambda }\sim _d\varvec{\mu }\) if and only if the multisets of residues modulo d for parts of \(\varvec{\lambda }\) and \(\varvec{\mu }\) coincide. For \(\varvec{\lambda }\vdash n\), we denote the \(\sim _d\)class of \(\varvec{\lambda }\) by \(\overline{\varvec{\lambda }}^{(d)}\).
Since \(\sim _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 \(\Pi _{n,d}:=\Pi _{n}/\sim _d\) defined as the transitive closure of the relation \(\tilde{<}\) given by \(\overline{\varvec{\lambda }}\tilde{<}\overline{\varvec{\mu }}\) if there are \(\varvec{\lambda }'\in \overline{\varvec{\lambda }}\) and \(\varvec{\mu }'\in \overline{\varvec{\mu }}\) such that \(\varvec{\lambda }'<\varvec{\mu }'\). The poset \(\Pi _{n,d}\) inherits from \(\Pi _{n}\) the structure of a graded poset.
Define the poset \(\Pi ^*_{n,d}\) as follows: if d does not divide n, set \(\Pi ^*_{n,d}:=\Pi _{n,d}\) with the order \(<_d\); if d divides n, define \(\Pi ^*_{n,d}\) as the poset obtained from \((\Pi _{n,d},<_d)\) by adding a minimum element, denoted \(\varnothing \) (for simplicity, we will keep the notation \(<_d\) for the partial order on \(\Pi ^*_{n,d}\)). The structure of a graded poset on \(\Pi _{n}\) induces the structure of a graded poset on \(\Pi ^*_{n,d}\) by defining the degree of \(\varnothing \) to be zero. The class \(\overline{(1,1,\dots ,1)}^{(d)}=\{(1,1,\dots ,1)\}\) of the partition \((1,1,\dots ,1)\) is the maximum element in \(\Pi ^*_{n,d}\).
5.3 \(\Pi ^*_{n,d}\) versus \({\mathscr {P}}_{d}\)
Our main result in this section is the following:
Theorem 21
The (graded) posets \((\Pi ^*_{n,d},<_d)\) and \((I(n{\mathbf {e}}(1)),\prec )\) are isomorphic.
Proof
To each \(\varvec{\lambda }\vdash n\), we associate the vector \((v_1^{\varvec{\lambda }},v_2^{\varvec{\lambda }},\dots , v_d^{\varvec{\lambda }})\), where, for \(i=1,2,\dots ,d\), we have
This map is constant on the \(\sim _d\)equivalence classes and hence induces a map from \(\Pi _{n,d}\) to \({\mathscr {P}}_{d}\). We extend this map to \(\Pi ^*_{n,d}\) by sending the \(\varnothing \) element to the zero vector in case d divides n. Denote the resulting map by \(\Phi \). Note that \(\Phi \) 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 \(\Phi \) 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 \(\varvec{\mu }\lessdot \varvec{\lambda }\) where \(\varvec{\lambda }\) has k parts while \(\varvec{\mu }\) has \(k1\) parts. Assume that this refines the part \(\mu _i\) into parts \(\lambda _s\) and \(\lambda _t\). This means that \(\mu _i=\lambda _s+\lambda _t\) and hence
Let \(a,b,c\in \{1,2,\dots ,d\}\) be such that \(\mu _i\equiv a\), \(\lambda _s\equiv b\) and \(\lambda _t\equiv c\,\,\mathrm {mod}\,\, d\). Then, the element \({\mathbf {e}}(a){\mathbf {e}}(b){\mathbf {e}}(c)\) belong to \(X_d\). This implies that \(\Phi (\overline{\varvec{\mu }})\prec \Phi (\overline{\varvec{\lambda }})\). It follows that \(\Phi \) is a homomorphism of posets.
Clearly, \(\Phi (\overline{(1,1,\dots ,1)}^{(d)})=n{\mathbf {e}}(1)\). Since \(\overline{(1,1,\dots ,1)}^{(d)}\) is the maximum element in \(\Pi ^*_{n,d}\), it follows that \(\Phi \) maps \(\Pi ^*_{n,d}\) to \(I(n{\mathbf {e}}(1))\).
That \(\Phi :\Pi ^*_{n,d}\rightarrow I(n{\mathbf {e}}(1))\) is injective follows directly from the definition. It remains to show that \(\Phi \) is surjective, in particular, invertible, and that \(\Phi ^{1}\) is order preserving. We prove this by downward induction on the height h. If \(h=d\), the claim is clear as \(n{\mathbf {e}}(1)\) is the only element of \(I(n{\mathbf {e}}(1))\) of height h.
For the induction step \(h\rightarrow h1\) let \({\mathbf {v}}\) and \({\mathbf {w}}\) be two elements in \(I(n{\mathbf {e}}(1))\) of heights \(h1\) and h, respectively, and assume \({\mathbf {v}}\prec {\mathbf {w}}\). Then \({\mathbf {v}}={\mathbf {w}}+{\mathbf {x}}\), for some \({\mathbf {x}}\in X_d\). Let \({\mathbf {x}}={\mathbf {e}}(k){\mathbf {e}}(i){\mathbf {e}}(j)\), for some \(i,j,k\in \{1,2,\dots ,d\}\). From the inductive assumption, there is \(\varvec{\lambda }\vdash n\) such that \(\Phi (\overline{\varvec{\lambda }})={\mathbf {w}}\). Let \(\lambda _s\) and \(\lambda _t\) be two different parts of \(\lambda \) with residues i and j modulo d, respectively. Define \(\mu \) as the partition obtained from \(\lambda \) by uniting \(\lambda _s\) and \(\lambda _t\). Then, \(\Phi (\overline{\varvec{\mu }})={\mathbf {v}}\). Therefore, \(\Phi \) is a bijection.
From the arguments above, it follows that the covering relations in \(\Pi ^*_{n,d}\) to \(I(n{\mathbf {e}}(1))\) match precisely under \(\Phi \). This implies that \(\Phi \) is an isomorphism of posets, completing the proof of the theorem. \(\square \)
As an immediate corollary, we have:
Corollary 22
For \(n\in {\mathbb {Z}}_{\ge 0}\) and \(d\in {\mathbb {N}}\), we have \(\Pi ^*_{n,d}=C_{n}^{(d)}\).
6 Connection to dtonal partition monoid
6.1 Partition monoids
For \(n\in {\mathbb {Z}}_{\ge 0}\), consider the sets \({\underline{n}}=\{1,2,\dots ,n\}\) and \({\underline{n}}'=\{1',2',\dots ,n'\}\) (these two sets are automatically disjoint). Set \({\mathbf {n}}:={\underline{n}}\bigcup {\underline{n}}'\) and consider the set \({\mathcal {P}}({\mathbf {n}})\) of all partitions of \({\mathbf {n}}\) into a disjoint union of nonempty subsets. The cardinality of \({\mathcal {P}}({\mathbf {n}})\) is the 2nth Bell number, see A000110 in [19].
The set \({\mathcal {P}}({\mathbf {n}})\) has the natural structure of a monoid, see [8, 13, 15, 16]. The composition \(\sigma \circ \pi \) of two partitions \(\sigma ,\pi \in {\mathcal {P}}({\mathbf {n}})\) is defined as follows (here \({\underline{n}}''=\{1'',2'',\dots ,n''\}\) is disjoint from \({\mathbf {n}}\)):

First consider the partition \(\sigma '\) of \({\underline{n}}'\cup {\underline{n}}''\) which is induced from \(\sigma \) via the bijection \({\underline{n}}\cup {\underline{n}}'\rightarrow {\underline{n}}'\cup {\underline{n}}''\) which sends \(i\mapsto i'\) for \(i\in {\underline{n}}\) and \(j'\rightarrow j''\) for \(j'\in {\underline{n}}'\).

Let \({\tilde{\pi }}\) be the equivalence relation on \({\underline{n}}\cup {\underline{n}}'\cup {\underline{n}}''\) whose parts are those of \(\pi \) combined with singletons of \({\underline{n}}''\).

Let \({\tilde{\sigma }}\) be the equivalence relation on \({\underline{n}}\cup {\underline{n}}'\cup {\underline{n}}''\) whose parts are those of \(\sigma '\) combined with singletons of \({\underline{n}}\).

Let \({\tilde{\tau }}\) denote the minimal (with respect to inclusions) equivalence relation on the set \({\underline{n}}\cup {\underline{n}}'\cup {\underline{n}}''\) which contains both \({\tilde{\pi }}\) and \({\tilde{\sigma }}\).

Let \({\tilde{\tau }}'\) be the restriction of \({\tilde{\tau }}\) to \({\underline{n}}\cup {\underline{n}}''\).

Define \(\tau =\sigma \circ \pi \) as the partition of \({\underline{n}}\cup {\underline{n}}'\) induced from the partition \({\tilde{\tau }}'\) by the bijection \({\underline{n}}\cup {\underline{n}}''\rightarrow {\underline{n}}\cup {\underline{n}}'\) which sends \(i\mapsto i\) for \(i\in {\underline{n}}\) and \(j''\rightarrow j'\) for \(j''\in {\underline{n}}''\).
The identity element in the monoid \(({\mathcal {P}}({\mathbf {n}}),\circ )\) is the identity partition
Both elements of \({\mathcal {P}}({\mathbf {n}})\) and the composition \(\circ \) admit a diagrammatic description as shown in Figure 8 (in the composition \(\sigma \circ \pi \) which is the lefthand side of the equality in Figure 8, the element \(\sigma \) is depicted on the left and the element \(\pi \) on the right). We refer the reader to [8, 13, 16] for further details.
6.2 dtonal partition monoids
For \(d\in {\mathbb {N}}\), the dtonal partition monoid \({\mathcal {P}}_d({\mathbf {n}})\), as introduced in [22], is the submonoid of \({\mathcal {P}}({\mathbf {n}})\) which consists of all partitions \(\sigma \) of \({\mathbf {n}}\) such that every part \(\sigma _i\) of \(\sigma \) satisfies the condition that
Thus, for \(d=1\), we have \({\mathcal {P}}_1({\mathbf {n}})={\mathcal {P}}({\mathbf {n}})\). For \(d=2\), the above condition is equivalent to the requirement that all parts of \(\sigma \) have even cardinality. Therefore, \({\mathcal {P}}_2({\mathbf {n}})\) is given by the sequence A005046 in [19] (see also [18]).
The twisted monoid algebra of the dtonal 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:
Problem 23
Compute \({\mathcal {P}}_d({\mathbf {n}})\) in a closed form as a function of d and n.
As the twisted semigroup algebra of \({\mathcal {P}}_d({\mathbf {n}})\) is generically semisimple, see [22], and forms, for all n, a sequence of embedded algebras with multiplicityfree restrictions, see [9], there is a natural analogue of the RobinsonSchensted correspondence for \({\mathcal {P}}_d({\mathbf {n}})\) and hence Problem 23 admits a combinatorial reformulation in terms of walks on a certain Bratelli diagram.
6.3 Rank and dsignature
For \(\sigma \in {\mathcal {P}}_d({\mathbf {n}})\), the rank \(\mathrm {rank}(\sigma )\) is the number of parts \(\sigma _i\) in \(\sigma \) such that both \(\sigma _i\cap {\underline{n}}\ne 0\) and \(\sigma _i\cap {\underline{n}}'\ne 0\). Such parts are called propagating.
Note that, for \(\sigma \in {\mathcal {P}}_d({\mathbf {n}})\), the cardinality of any part of \(\sigma \) which is entirely contained in \({\underline{n}}\) or in \({\underline{n}}'\) is divisible by d.
Define the function \(\Psi :{\mathcal {P}}_d({\mathbf {n}})\rightarrow {\mathbb {Z}}_{\ge 0}^d\), called the dsignature function, as follows: for \(\sigma \in {\mathcal {P}}_d({\mathbf {n}})\) define \(\Psi (\sigma )=(v_1,v_2,\dots ,v_d)\), where for \(i=1,2,\dots ,d\) the number \(v_i\) is the number of parts \(\sigma _j\) in \(\sigma \) satisfying the conditions
Note that \(v_1+v_2+\dots +v_d=\mathrm {rank}(\sigma )\).
6.4 \({\mathcal {J}}\)classes of dtonal partition monoids
Two elements \(\sigma ,\pi \in {\mathcal {P}}_d({\mathbf {n}})\) are called \({\mathcal {J}}\)equivalent, written \(\sigma {\mathcal {J}}\pi \), provided that \({\mathcal {P}}_d({\mathbf {n}})\sigma {\mathcal {P}}_d({\mathbf {n}})={\mathcal {P}}_d({\mathbf {n}})\pi {\mathcal {P}}_d({\mathbf {n}})\), see [5, Section 4.4]. For \(\sigma \in {\mathcal {P}}_d({\mathbf {n}})\) we denote by \({\overline{\sigma }}^{{\mathcal {J}}}\) the \({\mathcal {J}}\)equivalence class containing \(\sigma \).
There is a natural partial order on the set \({\mathcal {P}}_d({\mathbf {n}})/{\mathcal {J}}\) given by inclusions: we write \({\overline{\sigma }}^{{\mathcal {J}}} \rightsquigarrow {\overline{\pi }}^{{\mathcal {J}}}\) if and only if \({\mathcal {P}}_d({\mathbf {n}})\sigma {\mathcal {P}}_d({\mathbf {n}}) \subset {\mathcal {P}}_d({\mathbf {n}})\pi {\mathcal {P}}_d({\mathbf {n}})\).
6.5 Canonical elements
An element \(\sigma \in {\mathcal {P}}_d({\mathbf {n}})\) will be called canonical provided that the following conditions are satisfied:

Each part \(\sigma _i\) of \(\sigma \) satisfies \(\sigma _i\cap {\underline{n}}\le d\) and \(\sigma _i\cap {\underline{n}}'\le d\).

The intersections \(\sigma _i\cap {\underline{n}}\) and \(\sigma _i\cap {\underline{n}}'\) are connected segments of \({\underline{n}}\) and \({\underline{n}}'\), respectively, ordered by cardinalities of the intersections for those parts \(\sigma _i\) which intersects both \({\underline{n}}\) and \({\underline{n}}'\) and then followed by those parts of \(\sigma \) which intersect only \({\underline{n}}\) or \({\underline{n}}'\).
For example, the identity element in \({\mathcal {P}}_d({\mathbf {n}})\) is canonical.
Lemma 24
For each \(\sigma \in {\mathcal {P}}_d({\mathbf {n}})\), there is a canonical \(\pi \in {\mathcal {P}}_d({\mathbf {n}})\) such that \(\sigma {\mathcal {J}}\pi \).
Proof
If some part \(\sigma _i\) of \(\sigma \) satisfies \(\sigma _i\cap {\underline{n}}>d\) or \(\sigma _i\cap {\underline{n}}'>d\), then there is \(\sigma '\in {\mathcal {P}}_d({\mathbf {n}})\) which has exactly the same parts as \(\sigma \) except for \(\sigma _i\) which is split into two parts: a part with d elements which is a subset of \({\underline{n}}\) (respectively, \({\underline{n}}'\)) and its complement. Existence of \(\sigma '\) follows using the construction shown in Figure 9 (in the case \(d=3\)) and note that \(\sigma {\mathcal {J}}\sigma '\) also follows from Figure 9. Proceeding inductively, we find an element \(\tau \in {\mathcal {P}}_d({\mathbf {n}})\) which is in the same \({\mathcal {J}}\)class as \(\sigma \) and which satisfies the condition that \(\tau _i\cap {\underline{n}}\le d\) and \(\tau _i\cap {\underline{n}}'\le d\) for each part \(\tau _i\) of \(\tau \). Permuting, if necessary, the elements of \({\underline{n}}\) and, independently, of \({\underline{n}}'\) (that is, multiplying from the left and/or from the right by permutations, noting that all permutations belong to \({\mathcal {P}}_d({\mathbf {n}})\)), one rearranges \(\tau \) into a canonical element \(\pi \) in the same \({\mathcal {J}}\)class as \(\sigma \). The claim follows. \(\square \)
Proposition 25
We have \(\Psi ({\mathcal {P}}_d({\mathbf {n}}))=I(n{\mathbf {e}}(1))\).
Proof
We use downward induction to prove that for each \(k=n,n1,n2,\dots ,0\), the map \(\Psi \) induces a bijection between the set of all canonical elements of rank k in \({\mathcal {P}}_d({\mathbf {n}})\) and the set of all elements of height k in \(I(n{\mathbf {e}}(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 lefthand side, we have only one canonical element, the identity element, while on the righthand side, we have \(n{\mathbf {e}}(1)\) which is the image of the identity element under \(\Psi \).
Let \({\mathbf {v}}\in I(n{\mathbf {e}}(1))\) be an element of height k and let \(\sigma \) be a canonical element such that \(\Psi (\sigma )={\mathbf {v}}\). Let \({\mathbf {e}}(k){\mathbf {e}}(i){\mathbf {e}}(j)\in X_d\) be such that \({\mathbf {v}}+({\mathbf {e}}(k){\mathbf {e}}(i){\mathbf {e}}(j))\in I(n{\mathbf {e}}(1))\). Then, \(\sigma \) has a part \(\sigma _s\) such that d divides \(\sigma _s\cap {\underline{n}}i\) and a different part \(\sigma _t\) such that d divides \(\sigma _t\cap {\underline{n}}j\). Consider the element \(\sigma '\) obtained from \(\sigma \) by uniting \(\sigma _s\) with \(\sigma _t\) and keeping all other parts. Then, \(\sigma '\sigma =\sigma '\) and hence \({\mathcal {P}}_d({\mathbf {n}})\sigma '{\mathcal {P}}_d({\mathbf {n}})\subset {\mathcal {P}}_d({\mathbf {n}})\sigma {\mathcal {P}}_d({\mathbf {n}})\). Moreover, \(\Psi (\sigma ')={\mathbf {v}}+{\mathbf {e}}(k){\mathbf {e}}(i){\mathbf {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 delement parts contained in \({\underline{n}}\) or \({\underline{n}}'\) (note that the latter parts do not affect the value of \(\Psi \) by definition). This implies that \(\Psi \) takes values inside \(I(n{\mathbf {e}}(1))\) and completes the proof. \(\square \)
Corollary 26
For each \(\sigma \in {\mathcal {P}}_d({\mathbf {n}})\), there is a unique canonical \(\pi \in {\mathcal {P}}_d({\mathbf {n}})\) such that \(\sigma {\mathcal {J}}\pi \).
Proof
Taking into account Proposition 25, the claim follows from the observation that different canonical elements are sent by \(\Psi \) to different elements in \(I(n{\mathbf {e}}(1))\). \(\square \)
6.6 A combinatorial description of the \({\mathcal {J}}\)order
Our second main result, which explains our interest in \(C_n^{(d)}\), is the following:
Theorem 27
The map \(\Psi :({\mathcal {P}}_d({\mathbf {n}})/{\mathcal {J}},\rightsquigarrow )\rightarrow (I(n{\mathbf {e}}(1)),\prec )\) is an isomorphism of posets.
Proof
From Proposition 25, we have a map \(\Psi :{\mathcal {P}}_d({\mathbf {n}})/{\mathcal {J}}\rightarrow I(n{\mathbf {e}}(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 \({\mathbf {v}},{\mathbf {w}}\in I(n{\mathbf {e}}(1))\) such that \({\mathbf {v}}\prec {\mathbf {w}}\), there are \(\sigma ,\pi \in {\mathcal {P}}_d({\mathbf {n}})\) such that \({\mathcal {P}}_d({\mathbf {n}})\sigma {\mathcal {P}}_d({\mathbf {n}})\subset {\mathcal {P}}_d({\mathbf {n}})\pi {\mathcal {P}}_d({\mathbf {n}})\), \(\Psi (\sigma )={\mathbf {v}}\) and \(\Psi (\pi )={\mathbf {w}}\).
On the other hand, from the last paragraph of the proof of Proposition 25, it follows that the poset \(({\mathcal {P}}_d({\mathbf {n}})/{\mathcal {J}},\rightsquigarrow )\) 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 \(({\mathcal {P}}_d({\mathbf {n}})/{\mathcal {J}},\rightsquigarrow )\) and \((I(n{\mathbf {e}}(1)),\prec )\) match precisely via \(\Psi \). The claim follows. \(\square \)
7 Enumeration of \({\mathcal {J}}\)classes for arbitrary d
7.1 Enumeration via dpart partitions
The proof of Proposition 25 gives a way to write a formula for \(C_{n}^{(d)}\) in the general case. Let \(d\in {\mathbb {N}}\) and \(n\in {\mathbb {Z}}_{\ge 0}\). Denote by \(P_n^{(d)}\) the number of partitions of n with at most d parts. By taking the dual partition, we get the usual fact that \(P_n^{(d)}\) also equals the number of partitions of n in which each part does not exceed d. For simplicity, we set \(P_n^{(d)}=0\) when \(n<0\).
Theorem 28
We have \(C_{n}^{(d)}=P_n^{(d)}+P_{nd}^{(d)}+P_{n2d}^{(d)}+P_{n3d}^{(d)}+\dots \).
Proof
To prove this claim, we analyse the proof of Proposition 25. According to the latter proof, \(C_{n}^{(d)}\) enumerates canonical elements in \({\mathcal {P}}_d({\mathbf {n}})\). Let \(\sigma \) be a canonical element. Let \(\sigma _1,\sigma _2,\dots ,\sigma _k\) be the list of all parts of \(\sigma \) contained in \({\underline{n}}\) (note that k might be zero). Then, each of these parts has cardinality d, and we may consider the set
which thus has cardinality \(nkd\).
Cardinalities of intersections of all propagating parts of \(\sigma \) with \({\underline{n}}^{\sigma }\) determine a partition of \(nkd\) in which each part does not exceed d. It is straightforward that this gives a bijection between the set of all canonical elements in \({\mathcal {P}}_d({\mathbf {n}})\) with 2k nonpropagating parts and all partitions of \(nkd\) for which each part does not exceed d. The claim follows. \(\square \)
Corollary 29
For \(d\ge 1\), we have
Proof
This follows by combining the usual equality
with the statement of Theorem 28. \(\square \)
Remark 30
It is easy to check that for \(d=3\), we indeed have the equality
Here, the lefthand side is the original generating function for A028289.
Remark 31
The poset \(\Pi ^{(d)}\) of partitions with at most d parts can be defined using the same approach as we used to define \(\Lambda _d\). The assertion of Theorem 28 can then be interpreted as a bijection between certain (co)ideals in \(\Pi ^{(d)}\) and \(\Lambda _d\). Such a bijection admits a direct combinatorial construction.
7.2 Examples for \(d=4\) and \(d=5\)
The sequence \(C_n^{(4)}\) starts as follows:
The sequence \(C_n^{(5)}\) starts as follows:
We note that none of the sequences \(C_n^{(d)}\) for \(d\ge 4\) appeared on [19] before. However, as noted, they are simple cumulative sums of classical sequences.
7.3 Relation to partition function
Recall the classical partition function P(n) which gives, for \(n\in {\mathbb {Z}}_{\ge 0}\), the number of partitions of n, see the sequence A000041 in [19]. One general observation for the numbers \(C_{n,h}^{(d)}\) is the following:
Proposition 32
If \(nh<d\) and \(2(nh)<n\), then \(C_{n,h}^{(d)}=P(nh)\).
Proof
To prove the assertion, we construct a bijective map between \(I(n{\mathbf {e}}(1))\cap \Lambda _d^{(h)}\) and the set of all partitions of \(nh\).
For \({\mathbf {v}}\in \Lambda _d\), set \(\alpha ({\mathbf {v}})=v_2+2v_3+3v_4+\dots \). For \(i,j\in \{1,2,\dots ,d\}\) such that \(i+j<d\), we have \((i+j1)(i1)(j1)=1\). Therefore, for such values of i and j and for any \({\mathbf {v}},{\mathbf {w}}\in \Lambda _d\), we have \(\alpha ({\mathbf {v}})=\alpha ({\mathbf {w}})+1\) provided that
Note that \({\mathbf {e}}(i+j){\mathbf {e}}(i){\mathbf {e}}(j)\in X_d\).
Assume now that \(nh<d\) and \({\mathbf {v}}\in I(n{\mathbf {e}}(1))\) is of height \(h<n\). Then, \({\mathbf {v}}\) is obtained from \(n{\mathbf {e}}(1)\) by adding \(nh\) vectors from \(X_d\) of the form \({\mathbf {e}}(i+j){\mathbf {e}}(i){\mathbf {e}}(j)\), for some i and j as above. Indeed, let \(s>1\) be the smallest index such that \(v_i\ne 0\) (which exists as \(h<n\) and \(nh<d\)). Then, the vector \({\mathbf {v}}\) is obtained from the vector
by adding \({\mathbf {e}}((s1)+1){\mathbf {e}}(s1){\mathbf {e}}(1)\) (here \(w_1=v_1+2\) if \(s=2\)). Applying a similar procedure to \({\mathbf {w}}\) and proceeding inductively, we get the claim. This implies that
is a partition of \(nh\). Since \(nh\) is fixed and \({\mathbf {v}}\) is, clearly, recoverable from \(\Upsilon ({\mathbf {v}})\), the map \(\Upsilon \) from \(I(n{\mathbf {e}}(1))\cap \Lambda _d^{(h)}\) to the set of all partitions of \(nh\) is injective.
To prove surjectivity of \(\Upsilon \), assume that \(nh=x_2+2x_3+3x_4+\dots \), for some nonnegative \(x_2,x_3,\dots \). We proceed by induction on \(nh\). If \(nh=0\), surjectivity of our map is obvious. To prove the induction step, we write \(k=i+j\), for some \(1\le i,j \le k1\), and consider the partition of \(nh1\) 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(nh)<n\), it follows that the resulting partition of \(nh1\) is in the image of our map. Applying the definition of \(\prec \), it follows that the original partition of \(nh\) is also in the image of our map. This completes the proof. \(\square \)
Problem 33
Find a closed formula for \(C_{n,h}^{(d)}\) for all d, n, h.
References
G. Birkhoff. Lattice Theory. American Mathematical Society Colloquium Publications 25, revised edition. American Mathematical Society, New York, N. Y., 1948.
A. Björner. Shellable and CohenMacaulay partially ordered sets. Trans. Amer. Math. Soc. 260 (1980), no. 1, 159–183.
B. N. Cyvin, L. J. Brunvoll and S. J. Cyvin. Enumeration of Conjugated Hydrocarbons: Hollow Hexagons Revisited. Structural Chemistry 6 (1995), No. 2, 85–88.
S. Cyvin, J. Brunvoll, B. Cyvin, J. Bergan, and E. Brendsdal. The Simplest Coronoids: Hollow Hexagons. Structural Chemistry 2 (1991), No. 6, 555–566.
O. Ganyushkin, V. Mazorchuk. Classical finite transformation semigroups. An introduction. Algebra and Applications, 9. SpringerVerlag London, Ltd., London, 2009.
O. Ganyushkin, V. Mazorchuk and B. Steinberg. On the irreducible representations of a finite semigroup, Proc. Amer. Math. Soc. 137 (2009), 35853592.
N. Ham. The planar modular partition monoid. PhD Thesis, University of Tasmania, 2015.
V. Jones. The Potts model and the symmetric group. In: Subfactors: Proceedings of the Taniguchi Symposium on Operator Algebras (Kyuzeso, 1993), River Edge, NJ, World Sci. Publishing, 1994, pp. 259–267.
M. Kosuda. Characterization for the party algebra, Ryukyu Math. J. 13 (2000), 7–22.
M. Kosuda. Irreducible representations of the party algebra. Osaka J. Math. 43 (2006), no. 2, 431–474.
M. Kosuda. Party algebra of type \(B\) and construction of its irreducible representations. Manuscript available via google.
P. P. Martin. Potts models and related problems in statistical mechanics. World Scientific, Singapore, 1991.
P. P. Martin. TemperleyLieb algebras for nonplanar statistical mechanics — the partition algebra construction. Journal of Knot Theory and its Ramifications 3 (1994), no. 1, 51–82.
P. P. Martin. The structure of the partition algebras. J. Algebra 183 (1996), no. 2, 319–358.
V. Mazorchuk. On the structure of Brauer semigroup and its partial analogue. Problems in Algebra 13 (1998), Gomel: University Press, 29–45.
V. Mazorchuk. Endomorphisms of \({\mathfrak{B}}_n\), \({\cal{P}}{\mathfrak{B}}_n\) and \({\mathfrak{C}}_n\). Comm. Algebra 30 (2002), no. 7, 3489–3513.
R. Orellana. On partition algebras for complex reflection groups. J. Algebra 313 (2007), no. 2, 590–616.
R. Orellana. On the algebraic decomposition of a centralizer algebra of the hyperoctahedral group. Algebraic structures and their representations, 345–357, Contemp. Math., 376, Amer. Math. Soc., Providence, RI, 2005.
N. Sloane. The OnLine Encyclopedia of Integer Sequences. https://oeis.org/
G. Polya and R. Read. Combinatorial enumeration of groups, graphs and chemical compounds. Springer, 1987.
L. Rigal, P. Zadunaisky. Twisted semigroup algebras. Algebr. Represent. Theory 18 (2015), no. 5, 1155–1186.
K. Tanabe. On the centralizer algebra of the unitary reflection group \(G(m, p, n)\). Nagoya Math. J. 148 (1997), 113–126.
G. Ziegler. On the poset of partitions of an integer. J. Combin. Theory Ser. A 42 (1986), no. 2, 215–222.
Acknowledgements
An essential part of the research was done during the visit of the third author to Leeds in October 2014, which was supported by EPSRC under grant EP/I038683/1. The paper was completed during the stay of the second and the third authors at the Institute MittagLeffler in the spring of 2015. The financial support and hospitality of both the University of Leeds and the Institute MittagLeffler are gratefully acknowledged. The first author is supported by the KRG via the HCDP Scholarship program. For the third author, the research was partially supported by the Royal Swedish Academy of Sciences, Knut and Alice Wallenbergs Stiftelse and the Swedish Research Council. We thank M. Kosuda for helpful discussions. We thank the referee for helpful comments and for pointing out several inaccuracies in the original version of the paper.
Funding
Open Access funding provided by Uppsala University.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, 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/.
About this article
Cite this article
Ahmed, C., Martin, P. & Mazorchuk, V. On the number of principal ideals in dtonal partition monoids. Ann. Comb. 25, 79–113 (2021). https://doi.org/10.1007/s0002602000518z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s0002602000518z