Startseite Mathematik Two by two squares in set partitions
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Two by two squares in set partitions

  • Margaret Archibald , Aubrey Blecher , Charlotte Brennan , Arnold Knopfmacher und Toufik Mansour
Veröffentlicht/Copyright: 13. Januar 2020
Veröffentlichen auch Sie bei De Gruyter Brill

Abstract

A partition π of a set S is a collection B1, B2, …, Bk of non-empty disjoint subsets, alled blocks, of S such that i=1kBi=S. We assume that B1, B2, …, Bk are listed in canonical order; that is in increasing order of their minimal elements; so min B1 < min B2 < ⋯ < min Bk. A partition into k blocks can be represented by a word π = π1π2πn, where for 1 ≤ jn, πj ∈ [k] and i=1n{πi}=[k], and πj indicates that jBπj. The canonical representations of all set partitions of [n] are precisely the words π = π1π2πn such that π1 = 1, and if i < j then the first occurrence of the letter i precedes the first occurrence of j. Such words are known as restricted growth functions. In this paper we find the number of squares of side two in the bargraph representation of the restricted growth functions of set partitions of [n]. These squares can overlap and their bases are not necessarily on the x-axis. We determine the generating function P(x, y, q) for the number of set partitions of [n] with exactly k blocks according to the number of squares of size two. From this we derive exact and asymptotic formulae for the mean number of two by two squares over all set partitions of [n].

MSC 2010: Primary 05A15

The first, third and fourth authors are supported by the National Research Foundation under grant numbers 89147, 86329 and 81021, respectively.


  1. Communicated by Anatolij Dvurečenskij

References

[1] Sloane, N. J.: The On-Line Encyclopedia of Integer Sequences, Published electronically at http://oeis.org, 2013.Suche in Google Scholar

[2] Kasraoui, A.: Average values of some z-parameters in a random set partition, Electron. J. Combin. 18(1) (2011), #R228.10.37236/715Suche in Google Scholar

[3] Mansour, T.: Combinatorics of Set Partitions. Discrete Math. Appl., CRC Press, Chapman and Hall, Taylor and Francis group, 2013.10.1201/b12691Suche in Google Scholar

[4] Mansour, T.—Munagi, A. O.: Enumeration of gap-bounded set partitions, J. Autom. Lang. Comb. 14:3–4 (2009), 237–245.Suche in Google Scholar

[5] Mansour, T.—Shattuck, M.: Enumerating finite set partitions according to the number of connectors, Online J. Anal. Comb. 6 (2011), Article #3.Suche in Google Scholar

[6] Mansour, T.—Munagi, A. O.—Shattuck, M.: Recurrence relations and two-dimensional set partitions, J. Integer Seq. 14 (2011), Article 11.4.1.Suche in Google Scholar

[7] Mansour, T.—Shattuck, M.—Song, C.: Enumerating set partitions according to the number of descents of size d or more, Proc. Math. Sci. 122:4 (2012), 507–517.10.1007/s12044-012-0098-zSuche in Google Scholar

[8] Mansour, T.—Shattuck, M.—Wagner, S.: Enumerating set partitions by the number of positions between adjacent occurrences of a letter, Appl. Anal. Discrete Math. 4.2 (2010), 284–308.10.2298/AADM100425019MSuche in Google Scholar

[9] Stanley, R.P.: Enumerative Combinatorics. Vol. I., Cambridge Stud. Adv. Math. 49, Cambridge University Press, 1999.10.1017/CBO9780511609589Suche in Google Scholar

Received: 2018-07-20
Accepted: 2019-07-23
Published Online: 2020-01-13
Published in Print: 2020-02-25

© 2020 Mathematical Institute Slovak Academy of Sciences

Heruntergeladen am 16.12.2025 von https://www.degruyterbrill.com/document/doi/10.1515/ms-2017-0328/html?lang=de
Button zum nach oben scrollen