scholarly journals Extending the parking space

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Andrew Berget ◽  
Brendon Rhoades
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Algebraic Combinatorics ◽  
Parking Space ◽  
Parking Functions ◽  
Dyck Paths ◽  
International Audience ◽  
Special Case

International audience The action of the symmetric group $S_n$ on the set $\mathrm{Park}_n$ of parking functions of size $n$ has received a great deal of attention in algebraic combinatorics. We prove that the action of $S_n$ on $\mathrm{Park}_n$ extends to an action of $S_{n+1}$. More precisely, we construct a graded $S_{n+1}$-module $V_n$ such that the restriction of $V_n$ to $S_n$ is isomorphic to $\mathrm{Park}_n$. We describe the $S_n$-Frobenius characters of the module $V_n$ in all degrees and describe the $S_{n+1}$-Frobenius characters of $V_n$ in extreme degrees. We give a bivariate generalization $V_n^{(\ell, m)}$ of our module $V_n$ whose representation theory is governed by a bivariate generalization of Dyck paths. A Fuss generalization of our results is a special case of this bivariate generalization. L’action du groupe symétrique $S_n$ sur l’ensemble $\mathrm{Park}_n$ des fonctions de stationnement de longueur $n$ a reçu beaucoup d’attention dans la combinatoire algébrique. Nous démontrons que l’action de $S_n$ sur $\mathrm{Park}_n$ s’étend à une action de $S_{n+1}$. Plus précisément, nous construisons un gradué $S_{n+1}$-module $V_n$ telles que la restriction de $S_n$ est isomorphe à $\mathrm{Park}_n$. Nous décrivons la $S_n$-Frobenius caractères des modules $V_n$ à tous les degrés et décrivent le $S_{n+1}$-Frobenius caractères de $V_n$ en degrés extrêmes. Nous donnons une généralisation bivariée $V_n^{(\ell, m)}$ de notre module $V_n$ dont la représentation théorie est régie par une généralisation bivariée des chemins de Dyck. Une généralisation Fuss de nos résultats est un cas particulier de cette généralisation bivariée.

scholarly journals Constructing combinatorial operads from monoids

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Samuele Giraudo
Keyword(s):  
Rooted Trees ◽  
Parking Functions ◽  
Combinatorial Objects ◽  
Dyck Paths ◽  
International Audience ◽  
Motzkin Paths ◽  
Planar Rooted Trees

International audience We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial objects: parking functions, packed words, planar rooted trees, generalized Dyck paths, Schröder trees, Motzkin paths, integer compositions, directed animals, etc. We also retrieve some known operads: the magmatic operad, the commutative associative operad, and the diassociative operad.

scholarly journals The Robinson―Schensted Correspondence and $A_2$-webs

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Matthew Housley ◽  
Heather M. Russell ◽  
Julianna Tymoczko
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Quantum Group ◽  
Classical Limit ◽  
Young Tableaux ◽  
Tensor Power ◽  
Recent Interest ◽  
International Audience ◽  
Standard Young Tableaux ◽  
Graphical Algorithm

International audience The $A_2$-spider category encodes the representation theory of the $sl_3$ quantum group. Kuperberg (1996) introduced a combinatorial version of this category, wherein morphisms are represented by planar graphs called $\textit{webs}$ and the subset of $\textit{reduced webs}$ forms bases for morphism spaces. A great deal of recent interest has focused on the combinatorics of invariant webs for tensors powers of $V^+$, the standard representation of the quantum group. In particular, the invariant webs for the 3$n$th tensor power of $V^+$ correspond bijectively to $[n,n,n]$ standard Young tableaux. Kuperberg originally defined this map in terms of a graphical algorithm, and subsequent papers of Khovanov–Kuperberg (1999) and Tymoczko (2012) introduce algorithms for computing the inverse. The main result of this paper is a redefinition of Kuperberg's map through the representation theory of the symmetric group. In the classical limit, the space of invariant webs carries a symmetric group action. We use this structure in conjunction with Vogan's generalized tau-invariant and Kazhdan–Lusztig theory to show that Kuperberg's map is a direct analogue of the Robinson–Schensted correspondence.

scholarly journals Affine permutations and rational slope parking functions

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Eugene Gorsky ◽  
Mikhail Mazin ◽  
Monica Vazirani
Keyword(s):  
Hyperplane Arrangements ◽  
Parking Functions ◽  
New Approach ◽  
Dyck Paths ◽  
International Audience ◽  
Affine Permutations ◽  
Combinatorial Constructions

International audience We introduce a new approach to the enumeration of rational slope parking functions with respect to the <mathrm>area</mathrm> and a generalized <mathrm>dinv</mathrm> statistics, and relate the combinatorics of parking functions to that of affine permutations. We relate our construction to two previously known combinatorial constructions: Haglund's bijection ζ exchanging the pairs of statistics (<mathrm>area</mathrm>,<mathrm>dinv</mathrm>) and (<mathrm>bounce</mathrm>, <mathrm>area</mathrm>) on Dyck paths, and Pak-Stanley labeling of the regions of k-Shi hyperplane arrangements by k-parking functions. Essentially, our approach can be viewed as a generalization and a unification of these two constructions.

scholarly journals Partial categorification of Hopf algebras and representation theory of towers of \mathcalJ-trivial monoids

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Aladin Virmaux
Keyword(s):  
Representation Theory ◽  
Hopf Algebras ◽  
Hecke Algebras ◽  
Parking Functions ◽  
General Lemma ◽  
Combinatorial Description ◽  
Coalgebra Structure ◽  
International Audience ◽  
Grothendieck Rings ◽  
Boolean Lattices

International audience This paper considers the representation theory of towers of algebras of $\mathcal{J} -trivial$ monoids. Using a very general lemma on induction, we derive a combinatorial description of the algebra and coalgebra structure on the Grothendieck rings $G_0$ and $K_0$. We then apply our theory to some examples. We first retrieve the classical Krob-Thibon's categorification of the pair of Hopf algebras QSym$/NCSF$ as representation theory of the tower of 0-Hecke algebras. Considering the towers of semilattices given by the permutohedron, associahedron, and Boolean lattices, we categorify the algebra and the coalgebra structure of the Hopf algebras $FQSym , PBT$ , and $NCSF$ respectively. Lastly we completely describe the representation theory of the tower of the monoids of Non Decreasing Parking Functions.

scholarly journals The representation of the symmetric group on $m$-Tamari intervals (conference version)

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Mireille Bousquet-Mélou ◽  
Guillaume Chapuy ◽  
Louis-François Préville-Ratelle
Keyword(s):  
Symmetric Group ◽  
Lattice Structure ◽  
Parking Functions ◽  
Tamari Lattice ◽  
The North ◽  
Starting Point ◽  
International Audience ◽  
Associated Representation ◽  
Frobenius Series ◽  
Refined Version

International audience An $m$-ballot path of size $n$ is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at $(mn,n)$, and never going below the line $\{x=my\}$. The set of these paths can be equipped with a lattice structure, called the $m$-Tamari lattice and denoted by $\mathcal{T}{_n}^{(m)}$, which generalizes the usual Tamari lattice $\mathcal{T}n$ obtained when $m=1$. This lattice was introduced by F. Bergeron in connection with the study of diagonally coinvariant spaces in three sets of $n$ variables. The representation of the symmetric group $\mathfrak{S}_n$ on these spaces is conjectured to be closely related to the natural representation of $\mathfrak{S}_n$ on (labelled) intervals of the $m$-Tamari lattice studied in this paper. An interval $[P,Q$] of $\mathcal{T}{_n}^{(m)}$ is labelled if the north steps of $Q$ are labelled from 1 to $n$ in such a way the labels increase along any sequence of consecutive north steps. The symmetric group $\mathfrak{S}_n$ acts on labelled intervals of $\mathcal{T}{_n}^{(m)}$by permutation of the labels. We prove an explicit formula, conjectured by F. Bergeron and the third author, for the character of the associated representation of $\mathfrak{S}_n$. In particular, the dimension of the representation, that is, the number of labelled $m$-Tamari intervals of size $n$, is found to be $(m+1)^n(mn+1)^{n-2}$. These results are new, even when $m=1$. The form of these numbers suggests a connection with parking functions, but our proof is not bijective. The starting point is a recursive description of $m$-Tamari intervals. It yields an equation for an associated generating function, which is a refined version of the Frobenius series of the representation. The form of this equation is highly non-standard: it involves two additional variables $x$ and $y$, a derivative with respect to $y$ and iterated divided differences with respect to $x$. The hardest part of the proof consists in solving it, and we develop original techniques to do so.

Induced Representations and Alternating Groups

1964 ◽  
Vol 16 ◽  
pp. 587-601 ◽  
Author(s):  
B. M. Puttaswamaiah ◽  
G. de B. ROBINSON
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Alternating Group ◽  
Alternating Groups ◽  
Induced Representations ◽  
University Of Toronto ◽  
Group A ◽  
The University ◽  
Special Case

This paper is based on part of the thesis of one of the authors (5), submitted at the University of Toronto in 1963. In the first part of the paper a result on induced representations (2, 4, 9) is generalized slightly and a number of corollaries are derived. In the rest of the paper a special case of this result is applied to put the representation theory of the alternating group on a par with that of the symmetric group. A knowledge of the representation theory of Sn (7) on the part of the reader is assumed.

scholarly journals Rational Dyck Paths in the Non Relatively Prime Case

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Eugene Gorsky ◽  
Mikhail Mazin ◽  
Monica Vazirani
Keyword(s):  
Representation Theory ◽  
Dyck Paths ◽  
International Audience ◽  
Springer Fibers ◽  
The Relationship ◽  
Prime Case

International audience We study the relationship between rational slope Dyck paths and invariant subsets in Z, extending the work of the first two authors in the relatively prime case. We also find a bijection between (dn, dm)–Dyck paths and d-tuples of (n, m)-Dyck paths endowed with certain gluing data. These are first steps towards understanding the relationship between the rational slope Catalan combinatorics in non relatively prime case and the geometry of affine Springer fibers and representation theory.

scholarly journals Pseudo-Permutations II: Geometry and Representation Theory

2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
François Boulier ◽  
Florent Hivert ◽  
Daniel Krob ◽  
Jean-Christophe Novelli
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Hyperplane Arrangements ◽  
Complete Analysis ◽  
International Audience

International audience In this paper, we provide the second part of the study of the pseudo-permutations. We first derive a complete analysis of the pseudo-permutations, based on hyperplane arrangements, generalizing the usual way of translating the permutations. We then study the module of the pseudo-permutations over the symmetric group and provide the characteristics of this action.

scholarly journals A Generalization of Parking Functions Allowing Backward Movement

10.37236/8948 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Alex Christensen ◽  
Pamela E. Harris ◽  
Zakiya Jones ◽  
Marissa Loving ◽  
Andrés Ramos Rodríguez ◽  
...  
Keyword(s):  
Recursive Formula ◽  
Parking Space ◽  
Parking Functions ◽  
Parking Function ◽  
Dyck Paths ◽  
Positive Integers

Classical parking functions are defined as the parking preferences for $n$ cars driving (from west to east) down a one-way street containing parking spaces labeled from $1$ to $n$ (from west to east). Cars drive down the street toward their preferred spot and park there if the spot is available. Otherwise, the car continues driving down the street and takes the first available parking space, if such a space exists. If all cars can park using this parking rule, we call the $n$-tuple containing the cars' parking preferences a parking function.   In this paper, we introduce a generalization of the parking rule allowing cars whose preferred space is taken to first proceed up to $k$ spaces west of their preferred spot to park before proceeding east if all of those $k$ spaces are occupied. We call parking preferences which allow all cars to park under this new parking rule $k$-Naples parking functions of length $n$. This generalization gives a natural interpolation between classical parking functions, the case when $k=0$, and all $n$-tuples of positive integers $1$ to $n$, the case when $k\geq n-1$. Our main result provides a recursive formula for counting $k$-Naples parking functions of length $n$. We also give a characterization for the $k=1$ case by introducing a new function that maps $1$-Naples parking functions to classical parking functions, i.e. $0$-Naples parking functions. Lastly, we present a bijection between $k$-Naples parking functions of length $n$ whose entries are in weakly decreasing order and a family of signature Dyck paths. 

scholarly journals A $\lambda$-ring Frobenius Characteristic for $G\wr S_n$

10.37236/1809 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Anthony Mendes ◽  
Jeffrey Remmel ◽  
Jennifer Wagner
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Kronecker Product ◽  
Reproducing Kernel ◽  
Irreducible Representations ◽  
Inner Product ◽  
Irreducible Components ◽  
Lambda Ring

A $\lambda$-ring version of a Frobenius characteristic for groups of the form $G \wr S_n$ is given. Our methods provide natural analogs of classic results in the representation theory of the symmetric group. Included is a method decompose the Kronecker product of two irreducible representations of $G\wr S_n$ into its irreducible components along with generalizations of the Murnaghan-Nakayama rule, the Hall inner product, and the reproducing kernel for $G\wr S_n$.

Sign in / Sign up

Export Citation Format

Share Document