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 11877

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

2 votes
0 answers
93 views

Counting the number of weakly separated pairs

Given two $k$-subsets $I$ and $J$ of $\{1 \dots n\}$, denote by $\min(J)$ the minimal element in $J$ and by $\max(I)$ the maximal element in $I$, we write $I \prec J$ if $\max(I)<\min(J)$. The sets $I …
Jianrong Li's user avatar
  • 6,201
1 vote
0 answers
162 views

Bender-Knuth involution on $SSYT(\lambda, [n])$

Denote by $SSYT(\lambda, [n])$ the set of all semi-standard Young tableaux of shape lambda with entries in $[n]=\{1, \ldots, n\}$. Denote by $SSYT(\lambda, \infty)$ the set of all semi-standard Young …
Jianrong Li's user avatar
  • 6,201
2 votes
1 answer
158 views

How to show that $x_{k+1}+x_{k+2} + \cdots + x_n < 2m$?

Let $k \le n$ be positive integers and let $m$ be a positive integer. Assume that $x_1, \ldots, x_n$ are non-negative integers and \begin{align} & x_1^2 + x_2^2 + \cdots + x_n^2 - (k-2) m^2=2, \\ & x_ …
Jianrong Li's user avatar
  • 6,201
4 votes
1 answer
530 views

Geometric RSK correspondece and classical RSK correspondence

In the paper, geometric RSK correspondence is given by $$ \left( \begin{matrix} a & b \\ c & d \end{matrix} \right) \mapsto \left( \begin{matrix} \frac{bc}{b+c} & ab \\ ac & \frac{ad}{b+c} \end{matri …
Jianrong Li's user avatar
  • 6,201
2 votes
0 answers
155 views

Reference request: 321-avoiding patterns

Are there some references about the following result in the literature of combinatorics? Let $P$ be a permutation on $\{1,2,\ldots,n\}$. Let $\min P$ be the minimal number in the codomain of $P$. Fo …
Jianrong Li's user avatar
  • 6,201
6 votes
1 answer
477 views

Reference request: type C, D Catalan numbers

Catalan numbers are generalized to type B: https://oeis.org/A000984. Are there some references about Catalan numbers of type C, D? Thank you very much.
Jianrong Li's user avatar
  • 6,201
2 votes
2 answers
3k views

Recursion formula for analogue of Catalan numbers

Let $C_n = {2n \choose n}\frac{1}{n+1} = \frac{(2n)!}{n!(n+1)!}$ be the $n$th Catalan number. Then there is a recursion formula: $C_{n+1} = \sum_{i=0}^n C_i C_{n-i}$. Now let $C_{n,k} = {2n+k-1 \choos …
Jianrong Li's user avatar
  • 6,201
3 votes
0 answers
109 views

What is the combinatorial rule from the array of integers to the semistandard Young tableau?

Rigid indecomposable modules in the category ${\rm CM}(A)$ of Cohen-Macaulay $A$-module are parametrized by certain arrays of integers called profiles as shown in the paper A categorification of Grass …
Jianrong Li's user avatar
  • 6,201
3 votes
0 answers
127 views

How to compute the asymptotic of a summation which involves binomial coefficients?

Let $v_1,v_2 \in \{0,1\}^n$. Denote $v_1v_2=((v_1)_1 (v_2)_1, \ldots, (v_1)_n (v_2)_n)$ and $|v|=\sum v_{i}$. \begin{align} {\scriptsize f(v_1, v_2) = \sum_{x_1=0}^{|v_1|} \sum_{x_2=0}^{|v_2|} \sum_{d …
Jianrong Li's user avatar
  • 6,201
2 votes
1 answer
149 views

How to estimate a summation?

For $v, w \in \{0,1\}^n$, denote $v w = (v_1 w_1, \ldots, v_n w_n)$ and $|v|=\sum_{i} v_i$. Let $v_1, v_2 \in \{0,1\}^n$ and \begin{align*} f(x_1, x_2) = \sum_{d=0}^{|v_1 v_2|} \frac{1}{2^{|v_1|+|v_ …
Jianrong Li's user avatar
  • 6,201
0 votes
1 answer
78 views

Estimate an expression about probability about Bernoulli random variables

Given $v_{ij} \in \{0,1\}$, $i \in \{1,2\}$, $j \in \{1,2,\ldots,n\}$. Let $X_1, X_2, \ldots, X_n$ be random variables, $P[X_i=1]=P[X_i=0]=1/2$, $i \in \{1,\ldots, n\}$. By checking many examples, I t …
Jianrong Li's user avatar
  • 6,201
1 vote
1 answer
234 views

Decomposition of product of two Plucker coordinates

Let $Gr(k,n)$ be the set of all $k$-dimensional subspaces of an $n$-dimensional vector space. Then $Gr(k,n)$ is a projective variety and it has Plucker coordinates $P_{i_1, \ldots, i_k}$ ($i_1<\ldots< …
Jianrong Li's user avatar
  • 6,201
1 vote
1 answer
282 views

Reference request: conditions for the cardinality of the kernel of a linear map from $\mathb...

Let $\mathbb{Z}_m = \mathbb{Z}/m\mathbb{Z}$. Let $A$ be an $k \times n$ matrix over $\mathbb{Z}_m$. Let $f: \mathbb{Z}_m^n \to \mathbb{Z}_m^k$ be a linear map defined by $f(x) = Ax$, $x \in \mathbb{Z} …
Jianrong Li's user avatar
  • 6,201
1 vote
1 answer
104 views

How to draw a quiver for a pseudoline arragement?

In the lecture notes, on page 24, there is an example of drawing a quiver for a pseudoline arragement. What is the rule to draw a quiver for a pseudoline arragement? I don't know how to put the direct …
Jianrong Li's user avatar
  • 6,201
1 vote
1 answer
208 views

Positive roots and elements in a Coxeter group.

In the paper, a set $L$ associated to an element $w$ in a Coxeter group $W$ is defined as follows. Let $w=s_{i_1} \cdots s_{i_m}$ be a reduced expression. Define $L=\{\beta_1, \ldots, \beta_m\}$, wher …
Jianrong Li's user avatar
  • 6,201

15 30 50 per page