Results 41 to 50 of about 1,209 (75)
On maximal dihedral reflection subgroups and generalized noncrossing partitions [PDF]
Thomas Gobet
openalex +1 more source
Nonhomogeneous parking functions and noncrossing partitions
For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are given in terms ...
Armstrong, Drew, Eu, Sen-Peng
core +1 more source
Crossings and nestings in colored set partitions [PDF]
Chen, Deng, Du, Stanley, and Yan introduced the notion of $k$-crossings and $k$-nestings for set partitions, and proved that the sizes of the largest $k$-crossings and $k$-nestings in the partitions of an $n$-set possess a symmetric joint distribution ...
Marberg, Eric
core
Cumulants, Spreadability and the Campbell-Baker-Hausdorff Series
We define spreadability systems as a generalization of exchangeability systems in order to unify various notions of independence and cumulants known in noncommutative probability.
Hasebe, Takahiro, Lehner, Franz
core +1 more source
The cyclic sieving phenomenon: a survey [PDF]
The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients.
Sagan, Bruce E.
core +3 more sources
Crossings and nestings in set partitions of classical types [PDF]
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 that interchange crossings and nestings.
Rubey, Martin, Stump, Christian
core +5 more sources
Enumerative properties of generalized associahedra
Some enumerative aspects of the fans, called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras are considered, in relation with a bicomplex and its two spectral sequences.
Chapoton, Frederic
core +3 more sources
An instance of umbral methods in representation theory: the parking function module
We test the umbral methods introduced by Rota and Taylor within the theory of representation of symmetric group. We define a simple bijection between the set of all parking functions of length $n$ and the set of all noncrossing partitions of $\{1,2,...,n\
Petrullo, P., Senato, D.
core
Faces of generalized cluster complexes and noncrossing partitions [PDF]
Eleni Tzanaki
openalex +1 more source
Asymptotic Behaviour of Random Vandermonde Matrices with Entries on the Unit Circle
Analytical methods for finding moments of random Vandermonde matrices with entries on the unit circle are developed. Vandermonde Matrices play an important role in signal processing and wireless applications such as direction of arrival estimation ...
Mérouane Debbah +2 more
core +4 more sources

