Skip to main content
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
Results tagged with
Search options not deleted user 73667

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

1 vote
1 answer
319 views

Inequalities between sums of products of certain binomial coefficients

I am a PhD student. During my researches, I often have to deal with inequalities involving sums of binomial coefficients, where the sums are indexed by some set of integer compositions. For example, l …
eti902's user avatar
  • 891
1 vote
0 answers
97 views

Two versions of the Murnaghan-Nakayama rule

I have always see the following Murnaghan-Nakayama rule for a partition $\lambda$ and a permutation $\sigma \in \mathfrak{S}_n$ of cycle structure $(\sigma_1, ..., \sigma_n)$: $$ \chi_{\lambda}(\sigma …
eti902's user avatar
  • 891
2 votes
0 answers
125 views

Yamanouchi ribbon tableaux?

Let $s_{\lambda}$ be a Schur function. The set of all such functions are known to be a linear basis of the algebra of symmetric functions. The Littlewood-Richardson coefficients $c_{\nu\mu}^{\lambda}$ …
eti902's user avatar
  • 891
3 votes
0 answers
169 views

Jucys-Murphy elements and permutation modules

So I just learn about Jucys-Murphy elements. They are elements of $\mathbb{C}[\mathfrak{S}_n]$, the group algebra of the symmetric group, defined as: $$ X_i = \displaystyle \sum_{k=1}^{i-1} (k,i) $$ f …
eti902's user avatar
  • 891
5 votes
0 answers
183 views

Number of {0,1}-matrices with an even number of 1’s in each row vs in each column

I am working on an equation that would be solved if I show the following. Let $k \geq l$, and consider the set of $\{0,1\}$-matrices of size $k \times l$ with exactly $i$ 1’s. Consider the subset $\ma …
eti902's user avatar
  • 891
3 votes
0 answers
127 views

Generalized Gaussian binomial and symmetric chain decomposition

Background Let $\mu = (\mu_1, \ldots, \mu_k)$ be a partition, meaning that $\mu_1 \geq \ldots \mu_k \geq 1$. The Young diagram associated to $\mu$ is given by the set $(r,c) \in \mathbb{N} \times \mat …
eti902's user avatar
  • 891
10 votes
2 answers
700 views

Littlewood-Richardson coefficients in terms of Specht modules

Littlewood-Richardson coefficients $c_{\nu\mu}^{\lambda}$ (where $\nu$,$\mu$ and $\lambda$ are integer partitions such that $|\nu| + |\mu| = |\lambda|$) are well-known coefficients appearing in variou …
eti902's user avatar
  • 891