In how many distinct ways can flocks be formed?
A problem in sheep combinatorics
Abstract
In this short paper, we extend the concept of the strict order polynomial , which enumerates the number of strict order-preserving maps for a poset , to the extended strict order polynomial , which enumerates analogous maps for the elements of the power set . The problem at hand immediately reduces to the problem of enumeration of linear extensions for the subposets of . We show that for every a given linear extension of can be associated with a unique linear extension of . The number of such linear extensions (of length ) associated with a given linear extension of can be expressed compactly as , where is the number of deletable elements of defined in the text. Consequently the extended strict order polynomial can be represented as follows
The derived equation can be used for example for solving the following combinatorial problem: Consider a community of shepherds, some of whom are connected by a master-apprentice relation (expressed as a poset ). Every morning, of the shepherds go out and each of them herds a flock of sheep. Community tradition stipulates that each of these shepherds will herd at least one and at most sheep, and an apprentice will always herd fewer sheep than his master (or his master’s master, etc). In how many ways can the flocks be formed? The strict order polynomial answers this question for the case in which all shepherds go to work, and the extended strict order polynomial considers also all the situations in which some of the shepherds decide to take a day off.
Department of Applied Chemistry and Institute of Molecular Science, National Chiao Tung University, University Rd., 30010 Hsinchu, Taiwan
1 Notation and Definitions
1.1 Standard terminology
The current communication closely follows the poset terminology introduced in Stanley’s book [1]. The reader familiar with the terminology can jump directly to Subsection 1.2. A partially ordered set , or poset for short, is a set together with a binary relation . In this manuscript, we are concerned with finite posets consisting of elements and with strict partial orders, meaning that the relation is irreflexive, transitive and asymmetric. An induced subposet is a subset of together with the order inherited from which is defined by . The symbol shall denote the usual relation ,,larger than” in . The symbol stands for the set , and stands for the set . The symbol represents the chain . A map is a strict order-preserving map if it satisfies . A natural labeling of a poset is an order-preserving bijection . A linear extension of is an order-preserving bijection . A linear extension can be represented as a permutation expressed as a sequence with ; the sequence shall also be referred to as a linear extension in the following. The set of all such sequences is denoted by and is referred to as the Jordan-Hölder set of . If two subsequent labels and in stand in the relation , then the index is called a descent of . The total number of descents of is denoted by . The strict order polynomial of a poset [2, 3, 1], which enumerates the strict order-preserving maps , is given by
(1) |
1.2 Non-standard terminology
We will often construct—by slight abuse of notation—a subposet of by specifying a set of labels : The expression stands for the induced subposet with the elements . Clearly the subposet constructed in this way has elements; and the full set of subposets of stands in direct correspondence to the power set of : . Similarly, if is a sequence in and is a subset of , let us denote by the subsequence obtained by deleting all the elements of from . For example, . Clearly, deleting some arbitrary set from two different sequences may produce the same sequence: for example, . We will later (Lemma 12) see that deleting deletable elements (see Def. 6) from two distinct sequences always results in two distinct subsequences.
Further, let us slightly change the representation of linear extensions of subposets: Normally, one would assign to each subposet a new natural labeling , and then express the linear extensions of as sequences of the elements of . Instead, we avoid re-labeling each subposet, and use instead the labeling inherited from . Then, a linear extension of is represented by a sequence defined in the usual way: . The set of such sequences shall still be denoted by . Using this notation, it is now easy to see (but properly demonstrated later in Lemma 14) that if is a linear extension of , then is a linear extension of .
2 Main results
In this short communication, we extend the concept of the strict order polynomial given by Eq. (1) to the extended strict order polynomial given by Eq. (2), which enumerates and classifies the totality of strict order-preserving maps with . We show below in Theorem 3 that there exists a compact combinatorial expression characterizing . In the following, we shall always assume that is a poset with with elements, a strict order , and a natural labeling . Subposets of are always assumed to be induced.
Definition 1.
The extended strict order polynomial of a poset is defined as
(2) |
where the sum runs over all the induced subposets of .
Example 2.
Consider a family of three shepherds: Fiadh, Fiadh’s father Aidan, and Aidan’s father Lorcan. Every day, some of the shepherds go out and each herd a flock of at least one and at most sheep. Aidan always herds more sheep than Fiadh, and Lorcan always herds more sheep than both Fiadh and Aidan. How many possible ways are there of assigning flock sizes to the shepherds?

The three shepherds together with the seniority relation form a poset isomorphic to the chain : , see Fig. 1 (a). Let us denote the number of sheep in Fiadh’s flock by , the size of Aidan’s flock by and the size of Lorcan’s flock by ; then the above conditions tell us that . On a day when all three shepherds go to work, such as depicted in Fig. 1 (b), the numbers , and can be chosen in ways. When only Fiadh and Aidan go to work, see Fig. 1 (c), i.e. for the subposet , we have to choose the two numbers and such that ; there are ways to do so. The same is true whenever two of the three shepherds are present. Clearly, whenever only one shepherd works, there are ways to choose his flock size, and when all shepherds take the day off, there is only one possibility. Therefore, the extended strict order polynomial has the form
The very compact expression for given in the last line of Eq. (2) can be obtained directly by applying the following theorem.
Theorem 3.
The extended strict order polynomial is given by
(4) |
where denotes the number of deletable labels in .
Intuitively speaking, deletable labels can be understood to be the entries of which are not essential for distinguishing from other elements of . Theorem 3 is based on the fact that every element of can be uniquely associated with some element of . Formally speaking, it is possible to define an equivalence relation on such that . This concept is illustrated below in Examples 4 and 5. The proof of Theorem 3 will be given at the end of this paper after formalizing the concept of deletable labels and proving some technical lemmata.
Example 4.
Let us consider the lattice , for which and . Our results allow us to partition the set of linear extensions into two equivalence classes and :
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/d75951c7-941a-4ace-81b7-338bd6be803f/x2.png)
The first family, originating from the linear extension , is characterized by zero descents () and zero non-deletable elements (), and thus contains sequences of each length . The second family, originating from the linear extension , is characterized by one descent () and two non-deletable elements 3 and 2 (), and thus contains sequences of each length . Consequently, the extended strict order polynomial is given by
Example 5.
Let us consider the poset of three non-comparable elements. We have and . Our results allow us to classify the linear extensions in into six families
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/d75951c7-941a-4ace-81b7-338bd6be803f/x3.png)
each of which is characterized by a pair of numbers specified above. The extended strict order polynomial is given by
3 Classification of linear extensions
Definition 6.
Consider a sequence which represents a linear extension of . A label is deletable if
-
neither nor is a descent, and
-
at least one the following is true:
-
for any , or
-
there exists a label with such that for all .
-
The set of deletable elements of is denoted by , and its cardinality by . Labels that are not deletable from are called fixed in .
Loosely speaking, a label is fixed if it contributes to a descent, or if it appears after a descent even though it would also be allowed to appear in front of it. An inclined reader might have already noticed that every deletable element appears in a uniquely defined position of , which may be described as ,,as early as possible without interfering with the descent pattern”. In other words, removing a deletable element from and reinserting it at any earlier position cannot result in a linear extension with the same labels involved in the descent pairs. This concept constitutes the main idea behind associating a linear extension with a unique linear extension developed in detail later in this communication.
Let us now demonstrate how Definition 6 can be used in a direct manner to identify deletable and fixed labels in linear extensions. A useful, easy-to-use-in-practice graphical reinterpretation of Definition 6 is introduced in Example 9.
Example 7.
Consider again the poset shown in Fig. 2 and its two linear extensions and . Let us first determine which of the labels are deletable from . We have no descents in , so the condition of Definition 6 is satisfied for all of the labels. We only need to verify condition of Definition 6. The label is deletable because the interval is empty, and therefore condition is vacuously satisfied. Since , we find also for the remaining labels that condition is satisfied. This shows that all four labels in the linear extension are deletable: and . This is not the case for the linear extension . The labels and are fixed by condition because the position is a descent. The labels and can be shown to be deletable in exactly the same way as for . Consequently, in the linear extension the set of deletable elements is and .
Example 8.
Consider the linear extension of the poset shown in Fig. 2. By condition of Definition 6, the labels and are not deletable; the remaining labels might be deletable if they satisfy condition or of Definition 6. Since , the labels and are deletable by condition ; likewise, due to for all , the labels and are deletable by condition . Thus the only remaining label for which the deletability (or non-deletability) is not immediately obvious—and hence the machinery of Definition 6 must be fully put to work—is . There exists the label with , and for the only label with we find , so by condition , the label is deletable. Therefore, and .
Example 9.
Linear extensions and their fixed and deletable elements can be visualized and analyzed graphically in the following way. For a given linear extension , plot the Hasse diagram of in such a way that each element of is represented as a point in a Cartesian plane with the coordinates , see Fig. 3. The total order implied by the linear extension is easily determined by connecting the elements in the resulting diagram from left to right, as shown using red arrows in Fig. 3. The fixed and deletable labels can now be identified in a graphical way, as illustrated in Fig. 3: Whenever is a descent, i.e. whenever an element (in the position ) is displayed above (in the position ), both and are fixed (compare condition of Definition 6); this is marked by coloring the corresponding elements. The line connecting the points and then casts a ,,shadow” to the right; and all elements in the shadow have fixed labels as long as they are not covered by any elements in the same shadow including and (if they are covered, their labels are deletable by condition ).






Example 10.
Fig. 4 shows six of the linear extensions of the poset shown in Fig. 2. The introduced graphical representation of each of the linear extensions allows us to identify easily the sets of deletable labels: , , , , , . Note that in cases , there are elements in the shadow which are not colored because they are covered by another element in the same shadow – that is, elements that are deletable by condition of Definition 6.
We are now ready to investigate formally the relation between the linear extensions of and the linear extensions of its subposets .
3.1 Correspondence between linear extensions of a poset and of its subsets
Deleting deletable elements does not affect the number of descents:
Lemma 11.
Consider a linear extension and a subsequence , where . Then, .
Proof.
Let us augment the linear extension with two auxiliary fixed labels and . Then any deletable label of is located between two fixed labels and , which can be selected in such a way that all the labels in between are deletable. If there is any such that , would be a descent in and and would be fixed according to condition of Def. 6, contradicting the choice of and . Therefore, we have . Every deletable element belongs to such an interval containing monotonously increasing deletable labels flanked by two fixed labels, therefore constructing by deleting any deletable elements from does not remove or introduce any descents. ∎
The following two lemmata establish the correspondence between the elements of and the elements of .
Lemma 12.
Let , and let be a subposet of . For every linear extension of there exists exactly one linear extension of such that and .
Proof.
Denote in the following by the length of . For the sake of brevity of the following expositions, assume during this proof that and . Let us attempt to construct a sequence of elements of such that
-
,
-
,
-
.
A sequence can only satisfy condition if it contains the labels appearing in the same order as in , preceded, interleaved, and/or succeeded by the elements of Let us denote by the set of elements of appearing in before , by the set of elements appearing between and , and so on. Clearly, is a disjoint union of the subsets . We can thus construct a sequence in two steps:
-
Step 1:
Partition into (possibly empty) subsets containing elements, respectively.
-
Step 2:
Arrange the elements of each subset into a subsequence and form a sequence by concatenating the labels in and the consecutive subsequences in the following way
Obviously, many different sequences can be constructed in this way by choosing different partitionings of and by selecting distinct orders of the elements in each ; we show during the following construction process that the conditions and restrict this abundance to a single, unique sequence .
Every must be inserted in such a way that that , otherwise, would—by condition of Definition 6—not be deletable from , thus violating condition . Therefore, the subsequence inserted between and must satisfy . This shows that, in Step 2, when we augment with the elements of a subset , the only choice is to arrange these elements into a monotonously increasing sequence before doing so. Moreover, this requirement seriously reduces the number of allowed partitions of into subsets , as each needs to satisfy the condition .
Consider an element . Let us now narrow down the family of subsets into which the element may be placed. Let , or if this set is empty. In order to not violate condition , must be in some with . Denote by the set of possible choices for limited by the so far derived conditions and . The set is nonempty: It follows from the order-preserving nature of that , so there must be at least one value of with such that . Let .
We will now show by reductio ad absurdum that placing into a subset other than leads to a violation of condition . (Recollect that every deletable element appears in ,,as early as possible”.) Assume that with and . Then, by definition of , we know that . In order for to be deletable from the sequence , there must be an element such that and which appears in between and . Denote by the set of such elements: , where denotes the map , implied by . If there is an with , then must appear in at some position , . Since , according to the definitions of and we find that , in contradiction with the requirement that precede in . Therefore, and thus . Consider now the element . It follows from that . In order for to be deletable from the finished sequence , there must be an element such that and which appears in between and . Because of and since must precede in , the aforementioned element must be in , and therefore . At the same time, since is a natural labeling, implies . This contradiction shows that cannot be deletable from , . However we have found before that , which means that the assumption leads to a violation of condition . Therefore, we must have . Since is defined as the minimum allowed value of we have .
To summarize, we have shown until now that the only way to construct a sequence in a way that does not contradict conditions is to follow the construction introduced above, which can be described in the following way:
-
Step 1:
For every , let
(5) (6) and assign to the set .
-
Step 2:
For every , insert between and the elements of in increasing order:
where and .
It remains to be demonstrated that the sequence uniquely defined in this way indeed satisfies all conditions . Condition is satisfied by construction.
Next, let us verify that satisfies condition . Consider two arbitrary elements such that . Each of their labels and can be in or in . For each case, we have to show that precedes in .
-
•
If , then and for some . Since is an induced subposet of , we have , and therefore we know that , i.e., precedes in . Then, by construction, precedes also in .
- •
-
•
If and , then for some . Any with also satisfies , and therefore . Therefore, application of Step to results in and, due to the fact that , we have . Thus, is assigned to a with , and therefore it appears in before .
-
•
If , then for any with , it follows directly that . Therefore, in Step , we find , and as a result, in addition to (due to Eq. (6)) we also know that . By construction of and as well as the order-preserving nature of , we find . Therefore, there must be at least one value of in the interval such that . It follows that . If , then obviously appears in before , which in turn appears before . Finally, even if , in Step the elements of each are inserted into the sequence in increasing order, so in any case will be inserted before .
We have shown that the constructed sequence satisfies the condition , .
Finally let us verify that satisfies condition . Consider an element which is inserted into at some position , thus . We have ensured during the construction process that , therefore condition of Def. 6 is satisfied. If for all , then condition of Def. 6 is satisfied and is deletable in . Otherwise, the set is nonempty. Let . It is clear that for all . Thus, if we can find a value of such that , then condition of Def. 6 is satisfied. We show below that indeed this is the case.
It follows directly from the definition of that and simultaneously (since ); therefore , and is a descent. We already have seen that condition of Def. 6 is satisfied for all the elements of ; therefore and are not in , but appear somewhere in the original sequence , in the form and for some . Since , during Step 1 must have been assigned to some with .
Let us assume that ; we will see that this assumption leads to a contradiction. From it follows that . By construction of , we have . Therefore, if , then there must be a such that . Then, by definition of , we would have , in contradiction with . Therefore, the assumption made at the beginning of this paragraph must be wrong and we have . Since , we find , and therefore (by Eq. (5)) . This reasoning shows that .
The entry of appears in in the form at some position . Since and elements of appear in the same order in , we find . As we have shown earlier, by construction of , we have for all (and thus especially for all ); and by construction of , we have . Therefore, condition of Def. 6 is satisfied. It follows that every is deletable in , meaning that .
We have demonstrated that there is exactly one sequence of elements of that satisfies conditions given at the beginning of this proof, i.e., there is exactly one linear extension such that and . ∎
Example 13.
Let us demonstrate the insertion process described in Steps 1&2 during the proof above. Consider the sequence with the poset shown in Fig. 2 and the set of deleted elements . For the labels and , we find for the set in Eq. (5) , and thus . Since , in Eq. (6) we find . Therefore, the labels and are assigned to the subset , and will be inserted into the sequence between and . For the label , we find that in Eq. (5), , and thus . Since however the label is larger than any of the following labels in , , and , we find in Eq. (6) that and therefore . Finally, for the label , we find that in Eq. (5), , and thus and . To summarize, in Step 1, we split the set into the subsets , , , , and . In Step 2, the elements of each subset are arranged into a growing sequence, specifically and , and inserted into :
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/d75951c7-941a-4ace-81b7-338bd6be803f/x10.png)
The resulting sequence was previously considered and illustrated in Fig. 4 .
Lemma 14.
Let be a linear extension of with the set of deletable elements . For every set , the sequence is a linear extension of .
Proof.
Consider two elements with . In order to show that is a linear extension of , we have to demonstrate that appears in before . Since is an induced subposet of , it follows from that , and since is a linear extension, this implies that precedes in . Clearly then, by construction of , also precedes in . ∎
By combining the previous two lemmata, we find that
Lemma 15.
The union of the Jordan-Hölder sets of all subposets of is given by
4 Proof of Theorem 3
We are now ready to combine the so far derived lemmata into the derivation of the closed from of the extended order polynomial given in the first section.
5 Perspectives
Our main motivation to develop the extended strict order polynomial introduced in the current communication is its close relation to the Zhang-Zhang polynomial [4, 5, 6] enumerating Clar covers of benzenoid hydrocarbons [7], a topic to which we devoted feverish activity in our laboratory for almost a decade now [8, 9, 10, 11, 12, 13, 14]. Our recent contribution, introducing the interface theory of benzenoids [13, 14], demonstrated that enumeration of Clar covers of a benzenoid can be efficiently achieved by studying distributions of covered interface edges in interfaces of . The relative positions of the covered edges can be expressed in a form of a poset. Without giving too many unnecessary details, we can say that for a regular benzenoid strip of length , there exists a poset such that the extended strict order polynomial coincides with the Zhang-Zhang polynomial of (with ). A detailed proof of this fact is quite technical and will be announced soon. The announced equivalence between the extended strict order polynomials developed in the current study and the Zhang-Zhang polynomials of regular benzenoid strips allows us to recognize (currently without a formal proof) a large collection of facts about due to the previously discovered facts about the ZZ polynomials. Among others, the following facts are easy to deduce:
-
1.
The chain corresponds to a parallelogram
-
2.
The poset containing non-comparable elements corresponds, according to the interface theory of benzenoids, to a prolate rectangle
-
3.
The poset corresponds to a hexagonal graphene flake
-
4.
The strict order polynomial for the lattice is unknown, following the fact that this poset corresponds to the hexagonal flake
-
5.
The fence with elements corresponds to a zigzag chain
The expression for —and consequently, —is given by a very lengthy formula [17, 10, 23], but the associated generating function has the form of a continued fraction [23]
(10) An analogous generating function with respect to is unknown.
The extended order polynomial can be also computed in an efficient fashion directly from Eq. (4) through an algorithm based on a graph of ,,compatible” antichains of . Propagating weights through this graph in a certain way yields the extended order polynomial without ever having to construct the entire set . This algorithm has been implemented in Maple 16 [24] and will be reported later. For the example of the poset depicted in Fig. 2, we obtain in this way
We suspect that the coefficients appearing in in front of the terms are #P-complete to compute, in close analogy to the coefficients corresponding to the number of linear extensions of . These coefficients are growing very fast with the size of the poset . The largest of the coefficients is only 17 (as can be easily seen from Eq. (5)), but larger are characterized by much greater coefficients, e.g., , , , and .
It seems that the introduced here extended strict order polynomial can be immediately generalized to the non-strict case using the reciprocity theorem of Stanley (Corollary 3.15.12 of [1]), but this problem is not pursued here further.
References
- [1] R. Stanley, Enumerative Combinatorics, volume 1 of The Wadsworth & Brooks/Cole Mathematics Series, Springer US, 2nd edition, 2012.
- [2] R. P. Stanley, A chromatic-like polynomial for ordered sets, Proc. Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications (1970) 421–427.
- [3] R. P. Stanley, Ordered structures and partitions, volume 0 of Memoirs of the American Mathematical Society, American Mathematical Society, 1972, ISSN: 0065-9266, 1947-6221 Issue: 119.
- [4] H. P. Zhang, F. J. Zhang, The Clar covering polynomial of hexagonal systems I, Discrete Appl. Math. 69 (1996) 147–167.
- [5] F. J. Zhang, H. P. Zhang, Y. T. Liu, The Clar covering polynomial of hexagonal systems II, Chin. J. Chem. 14 (1996) 321–325.
- [6] H. P. Zhang, F. J. Zhang, The Clar covering polynomial of hexagonal systems III, Discrete Math. 212 (2000) 261–269.
- [7] E. Clar, The Aromatic Sextet, Wiley, London, 1972.
- [8] C. P. Chou, H. A. Witek, An algorithm and FORTRAN program for automatic computation of the Zhang–Zhang polynomial of benzenoids, MATCH Commun. Math. Comput. Chem. 68(1) (2012) 3–30.
- [9] C. P. Chou, H. A. Witek, ZZDecomposer: A graphical toolkit for analyzing the Zhang–Zhang polynomials of benzenoid structures, MATCH Commun. Math. Comput. Chem. 71(3) (2014) 741–764.
- [10] C. P. Chou, H. A. Witek, Determination of Zhang–Zhang polynomials for various classes of benzenoid systems: Non–heuristic approach, MATCH Commun. Math. Comput. Chem. 72(1) (2014) 75–104.
- [11] H. A. Witek, G. Moś, C. P. Chou, Zhang–Zhang polynomials of regular 3– and 4–tier benzenoid strips, MATCH Commun. Math. Comput. Chem. 73(2) (2015) 427–442.
- [12] H. A. Witek, J. Langner, G. Moś, C. P. Chou, Zhang–Zhang polynomials of regular 5–tier benzenoid strips, MATCH Commun. Math. Comput. Chem. 78(2) (2017) 487–504.
- [13] J. Langner, H. A. Witek, Interface theory of benzenoids, MATCH Commun. Math. Comput. Chem. (Submitted) 84 (2020) 143–176.
- [14] J. Langner, H. A. Witek, Interface theory of benzenoids: Basic applications, MATCH Commun. Math. Comput. Chem. 84 (2020) 177–215.
- [15] I. Gutman, B. Borovićanin, Zhang–Zhang polynomial of multiple linear hexagonal chains, Z. Naturforsch. A 61 (2006) 73–77.
- [16] C. P. Chou, H. A. Witek, Closed–form formulas for the Zhang–Zhang polynomials of benzenoid structures: Chevrons and generalized chevrons, MATCH Commun. Math. Comput. Chem. 72(1) (2014) 105–124.
- [17] C. P. Chou, Y. T. Li, H. A. Witek, Zhang–Zhang polynomials of various classes of benzenoid systems, MATCH Commun. Math. Comput. Chem. 68(1) (2012) 31–64.
- [18] C. P. Chou, J.-S. Kang, H. A. Witek, Closed–form formulas for the Zhang–Zhang polynomials of benzenoid structures: Prolate rectangles and their generalizations, Discrete Appl. Math. 198 (2016) 101–108.
- [19] B. H. He, J. Langner, H. A. Witek, Hexagonal flakes as fused parallelograms: A determinantal formula for Zhang-Zhang polynomials of the benzenoids, J. Chin. Chem. Soc. (submitted) (2020).
- [20] B. H. He, H. A. Witek, J. Langner, R. Podeszwa, Can the John-Sachs theory of Kekulé structures be extended to enumerate Clar covers of benzenoids?, MATCH Commun. Math. Comput. Chem. (to be submitted) (2020).
- [21] H. A. Witek, J. Langner, Clar covers of overlapping benzenoids: Case of two identically-oriented parallelograms, Symmetry 12 (2020) 1599 (20 pages).
- [22] H. A. Witek, J. Langner, R. Podeszwa, Closed-form formulas for Zhang-Zhang polynomials of hexagonal graphene flakes O(k,m,n) with k, m=1-8 and arbitrary n, MATCH Commun. Math. Comput. Chem. (to be submitted) (2020).
- [23] J. Langner, H. A. Witek, G. Moś, Zhang–Zhang polynomials of multiple zigzag chains, MATCH Commun. Math. Comput. Chem. 80(1) (2018) 245–265.
- [24] Maple 16. Maplesoft, a division of Waterloo Maple Inc., Waterloo, Ontario. Maple is a trademark of Waterloo Maple Inc.