Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
16
votes
Accepted
A double grading of catalan numbers
It appears that the zeta map which I used to answer Vince Vatter's initial question and which I describe in my answer there, see also page 50 of Jim Haglund's book, indeed solves also this problem:
A …
15
votes
Accepted
A family of words counted by the Catalan numbers
Below my modified answer containing a complete bijection between the above sequences and Dyck paths:
Let $a = (a_1,\ldots,a_n)$ be a sequence of $n$ integers. $a$ satisfies Property $A$ if it satisfi …
13
votes
1
answer
589
views
Explicit forms for the roots of Eulerian polynomials
Let $E_n(z)$ be the Eulerian polynomial
$$E_n(z) = \sum_{\tau \in \mathfrak{S}_n} z^{\operatorname{des}(\tau)}$$
where $\mathfrak{S}_n$ denotes the set of all permutations of $\{1,\ldots,n\}$ and $\op …
11
votes
Accepted
Hyperplane arrangements whose regions all have the same shape
This is a known open problem (for isometric regions), which, as far as I know, is still not settled.
The dimension 3 case was proved affirmatively in https://arxiv.org/abs/1501.05991, where also some …
10
votes
Accepted
What does the $q$-Catalan Numbers count?
As Vasu commented already: there is not "the" q-analogue of the Catalan numbers. And indeed, you're mixing two different here.
Your first q-Catalan numbers defined by the $q$-binomials is MacMahon's …
10
votes
Accepted
An introduction to Macdonald polynomials other (better?!) than SFHP
I recommend reading Macdonald's volume University Lecture Series Vol 12 Symmetric functions and orthogonal polynomials.
It is a rather short introduction to Macdonald polynomials for the symmetric gr …
10
votes
Accepted
Natural bijection between Dyck paths and tilting modules
This is more of an expansion of Sam's comments, but too long for a comment itself:
As pointed out by Sam in that Theorem 4.2.2.2, tilting modules of the linear type $A_n$ quiver are in natural corres …
10
votes
1
answer
782
views
Demazure product in Coxeter and Artin groups
As a follow-up of Allen's question Coxeter exchanges in non-reduced words, I wonder whether it is known that the Demazure product is well-defined in Artin groups. This is:
Let $(W,S)$ be a Coxeter sy …
8
votes
1
answer
243
views
Finite posets for which all intervals are atomic
Let $P$ be a finite poset which is a lattice with $0,1 \in P$.
An atom in $P$ is an upper cover of $0$ and a coatom is a lower cover of $1$.
$P$ is atomic if every element is a join of atoms and coat …
8
votes
Bijection directly from (n,n+1)-core partitions to parking functions?
Increasing parking functions are in (more or less canonical) bijection with Dyck paths (see, e.g., here), so your question can be rephrased as
Is there a direct bijection between (n,n+1)-cores and Dy …
8
votes
Accepted
Databases for sequences indexed by partitions
Thanks for asking this question! It really is a perfect occation for me advertising (once again) the combinatorial statistic finder http://www.FindStat.org!
To search the database for partitions, see …
8
votes
Accepted
Parking functions to non-crossing partitions
I still hope there is a complete (and easy) answer to the question, but as mentioned in my comment above, and since no one else answered so far, I give a description of the inverse map that is not com …
8
votes
Intuition behind Hook Length Formula
Here is a bijection to Dyck paths (or to well-formed bracketings):
Take a SYT of shape $2\times n$ (so it contains the numbers $\{1,\ldots,2n\}$, and we aim to form a word of $n$ up-steps (opening br …
7
votes
Accepted
References request: reflections in coxeter groups
As you find in "Humphreys, Reflection and Coxeter groups" (link behind paywall) in Section 5.7, the set of reflections of a Coxeter system $(W,S)$ is given by $R = \{ wsw^{-1} : w \in W, s \in S\}$, t …
7
votes
Examples of errors in computational combinatorics results
The Catalan numbers have a famous generalization associated to finite irreducible reflection groups. Afaik, the formula
$$\operatorname{Catalan}(W)=\prod_{i=1}^n \frac{d_i+h}{d_i}$$
appeared first in …