scholarly journals Actions and Identities on Set Partitions

10.37236/1992 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Eric Marberg

A labeled set partition is a partition of a set of integers whose arcs are labeled by nonzero elements of an abelian group $\mathbb{A}$. Inspired by the action of the linear characters of the unitriangular group on its supercharacters, we define a group action of $\mathbb{A}^n$ on the set of $\mathbb{A}$-labeled partitions of an $(n+1)$-set. By investigating the orbit decomposition of various families of set partitions under this action, we derive new combinatorial proofs of Coker's identity for the Narayana polynomial and its type B analogue, and establish a number of other related identities. In return, we also prove some enumerative results concerning André and Neto's supercharacter theories of type B and D.

10.37236/392 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Martin Rubey ◽  
Christian Stump

In this article, we investigate bijections on various classes of set partitions of classical types that preserve openers and closers. On the one hand we present bijections for types $B$ and $C$ that interchange crossings and nestings, which generalize a construction by Kasraoui and Zeng for type $A$. On the other hand we generalize a bijection to type $B$ and $C$ that interchanges the cardinality of a maximal crossing with the cardinality of a maximal nesting, as given by Chen, Deng, Du, Stanley and Yan for type $A$. For type $D$, we were only able to construct a bijection between non-crossing and non-nesting set partitions. For all classical types we show that the set of openers and the set of closers determine a non-crossing or non-nesting set partition essentially uniquely.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Martin Rubey ◽  
Christian Stump

International audience In this extended abstract, we investigate bijections on various classes of set partitions of classical types that preserve openers and closers. On the one hand we present bijections for types $B$ and $C$ that interchange crossings and nestings, which generalize a construction by Kasraoui and Zeng for type $A$. On the other hand we generalize a bijection to type $B$ and $C$ that interchanges the cardinality of a maximal crossing with the cardinality of a maximal nesting, as given by Chen, Deng, Du, Stanley and Yan for type $A$. For type $D$, we were only able to construct a bijection between non-crossing and non-nesting set partitions. For all classical types we show that the set of openers and the set of closers determine a non-crossing or non-nesting set partition essentially uniquely. Dans ce résumé, nous étudions des bijections entre diverses classes de partitions d'ensemble de types classiques qui préservent les "openers'' et les "closers''. D'une part, nous présentons des bijections pour les types $B$ et $C$ qui échangent croisées et emboôtées, qui généralisent une construction de Kasraoui et Zeng pour le type $A$. D'autre part, nous généralisons une bijection pour le type $B$ et $C$ qui échange la cardinalité d'un croisement maximal avec la cardinalité d'un emboîtement maximal comme il a été fait par Chen, Deng, Du, Stanley et Yan pour le type $A$. Pour le type $D$, nous avons seulement construit une bijection entre les partitions non croisées et non emboîtées. Pour tout les types classiques, nous montrons que l'ensemble des "openers'' et l'ensemble des "closers'' déterminent une partition non croisées ou non emboîtées essentiellement de façon unique.


10.37236/2550 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Adam M Goyt ◽  
Brady L Keller ◽  
Jonathan E Rue

We study q-analogues of k-Fibonacci numbers that arise from weighted tilings of an $n\times1$ board with tiles of length at most k.  The weights on our tilings arise naturally out of distributions of permutations statistics and set partitions statistics.  We use these q-analogues to produce q-analogues of identities involving k-Fibonacci numbers.  This is a natural extension of results of the first author and Sagan on set partitions and the first author and Mathisen on permutations.  In this paper we give general q-analogues of k-Fibonacci identities for arbitrary weights that depend only on lengths and locations of tiles.  We then determine weights for specific permutation or set partition statistics and use these specific weights and the general identities to produce specific identities.


2000 ◽  
Vol 28 (3) ◽  
pp. 1475-1485
Author(s):  
Thomas Guédénon
Keyword(s):  

10.37236/1987 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Karen Meagher ◽  
Lucia Moura ◽  
Brett Stevens

A Sperner partition system is a system of set partitions such that any two set partitions $P$ and $Q$ in the system have the property that for all classes $A$ of $P$ and all classes $B$ of $Q$, $A \not\subseteq B$ and $B \not\subseteq A$. A $k$-partition is a set partition with $k$ classes and a $k$-partition is said to be uniform if every class has the same cardinality $c=n/k$. In this paper, we prove a higher order generalization of Sperner's Theorem. In particular, we show that if $k$ divides $n$ the largest Sperner $k$-partition system on an $n$-set has cardinality ${n-1 \choose n/k-1}$ and is a uniform partition system. We give a bound on the cardinality of a Sperner $k$-partition system of an $n$-set for any $k$ and $n$.


10.37236/294 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
William Y.C. Chen ◽  
David G.L. Wang
Keyword(s):  
Type B ◽  

Motivated by Pittel's study of minimally intersecting set partitions, we investigate minimally intersecting set partitions of type $B$. Our main result is a formula for the number of minimally intersecting $r$-tuples of $B_n$-partitions. As a consequence, it implies the formula of Benoumhani for the Dowling number in analogy to Dobiński's formula.


10.37236/8241 ◽  
2019 ◽  
Vol 26 (2) ◽  
Author(s):  
Megan Ly

Schur–Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog of Schur–Weyl duality for the group of unipotent upper triangular matrices over a finite field.  In this case, the character theory of these upper triangular matrices is "wild" or unattainable. Thus we employ a generalization, known as supercharacter theory, that creates a striking variation on the character theory of the symmetric group with combinatorics built from set partitions. In this paper, we present a combinatorial formula for calculating a restriction and induction of supercharacters based on statistics of set partitions and seashell inspired diagrams. We use these formulas to create a graph that encodes the decomposition of a tensor space, and develop an analog of Young tableaux, known as shell tableaux, to index paths in this graph. 


Integers ◽  
2010 ◽  
Vol 10 (2) ◽  
Author(s):  
Mark Shattuck

AbstractA finite set partition is said to have a


Sign in / Sign up

Export Citation Format

Share Document