Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Combinatorial Properties of the Antichains of a Garland

Veröffentlicht/Copyright: 31. August 2009
Veröffentlichen auch Sie bei De Gruyter Brill
Integers
Aus der Zeitschrift Band 9 Heft 4

Abstract

In this paper we study some combinatorial properties of the antichains of a garland, or double fence (see Figure 1 for an example). Specifically, we encode the order ideals and the antichains in terms of words of a regular language, we obtain several enumerative properties (such as generating series, recurrences and explicit formulae), we consider some statistics leading to Riordan matrices, we study the relations between the lattice of ideals and the semilattice of antichains, and finally we give a combinatorial interpretation of the antichains as lattice paths with no peaks and no valleys.

Received: 2008-05-16
Revised: 2009-02-24
Accepted: 2009-03-05
Published Online: 2009-08-31
Published in Print: 2009-September

© de Gruyter 2009

Heruntergeladen am 12.4.2026 von https://www.degruyterbrill.com/document/doi/10.1515/INTEG.2009.030/html
Button zum nach oben scrollen