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.
17
votes
1
answer
378
views
Do mutually dual finite vector spaces have the same orbit cardinalities under a linear group...
Let $G$ be a finite group acting linearly on a finite dimensional vector space $V$ over a finite field. By Burnside's lemma,
$$
|V/G| = \frac 1{|G|} \sum_{g\in G} q^{\dim(ker(g - I))}.
$$
Since $g-I$ …
15
votes
4
answers
3k
views
Ordinary Generating Function for Bell Numbers
In the OEIS entry for Bell numbers, there appears a generating function
$$\sum_{k=0}^\infty B_k t^k = \sum_{r=0}^\infty \prod_{i=1}^r \frac{t}{1-it}$$
However, I could not locate any proof of refere …
14
votes
2
answers
847
views
Do you know an elegant proof for this expression for a Schur function?
I know that the identity
$$
s_\mu = \sum_{\mu-\lambda \text{ is a horizontal strip}} \;\sum_{\alpha\vdash|\lambda|} \frac{\chi^\lambda_\alpha}{z_\alpha} \prod_i(p_i-1)^{a_i}
$$
holds.
Here $\alpha=1^{ …
13
votes
1
answer
697
views
Counting representations of $k[x,y]$ when $k$ is finite
$\newcommand{\GFq}{\mathbf F_q}$
Let $r_n(q)$ denote the number of isomorphism classes of $n$-dimensional modules of the $\GFq$-algebra $\GFq[x,y]$. Is it known whether there exists a polynomial $p_n( …
12
votes
0
answers
592
views
$q$-analogue of the multinomial theorem?
The $q$-binomial theorem states that
$$
\prod_{k=0}^{n-1}(1+q^kt) = \sum_{k=0}^n q^{\binom k2}{n\brack k}_q t^k.
$$
This identity is a $q$-analogue of the binomial theorem
$$
(1+t)^n = \sum_{k=0}^n \b …
10
votes
2
answers
805
views
Viennot-type geometric description for dual RSK correspondence?
Is a geometric construction of the dual RSK correspondence along the lines of Viennot's "light and shadows construction" written up somewhere? This is a bijective correspondence between 0-1 matrices a …
7
votes
Hall polynomial when the subgroup is cyclic?
Let's say you want to compute the Hall polynomial $g^\lambda_{(r),\mu}(p)$.
According to [Dutta and Prasad, Degenerations and orbits in finite abelian groups], the orbits under the automorphism group …
7
votes
Sum of Gaussian binomial coefficients.
For Gaussian binomial coefficients we have
$$
\sum_{k = 0}^n \binom nk_q = \sum_{m = 0}^\infty a_m q^m,
$$
where
$$
a_m = \sum_{\lambda\vdash m} \#\{k\in \mathbf Z_{\geq 0}\mid \lambda_1\leq n-k, \l …
6
votes
1
answer
326
views
Counting equivalence relations with marked classes
The number of equivalence relations on a set of $n$ elements is the Bell number $B_n$.
If we wish to count the number of equivalence classes on a set of $n$ elements where one of the classes is mark …
6
votes
Provoking involutions further
Define a standard bitableau of size $n$ to be a pair $(P_1, P_2)$ of standard tableaux of total size $n$ such that each of the integers $1,\dotsc, n$ occurs exactly once in either tableau.
Then $I_2( …
5
votes
3
answers
1k
views
RS to RSK correspondence
The RS correspondence is a correspondence which associates to each permutation a pair of standard Young tableaux of the same shape.
The RSK correspondence associates to each integer matrix (with non- …
5
votes
1
answer
346
views
Identity involving partitions coming from representations of alternating groups
It is not difficult to show that the number of conjugacy classes in the alternating group $A_n$ is given by
classes in the alternating group = no. of even partitions + no. of self-transpose partit …
5
votes
0
answers
465
views
Have you seen this sort of an anti-involution on a lattice?
While looking at a representation theory question, I came up with the following sort of object. I want to know if it comes up often in combinatorics or some other area of mathematics.
Let $P$ be a fi …
4
votes
Good combinatorics textbooks for teaching undergraduates?
Combinatorics: Theory and Applications by V. Krishnamurthy.
This is an undergraduate text. Comprehensive and clear. If you live in India, there is an additional benefit: it can be yours for Rs. 275 …
4
votes
Linear Extension of the $n\times n$ lattice
The $n\times n$ lattice is the set $X_n :=\{(i,j)\mid 1\leq i,j\leq n\}$, partially ordered by $(i,j)\leq (k,l)$ if $i\leq k$ and $j\leq l$.
A linear extension of any poset $P$ (of cardinality $N$) i …