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
4
answers
1k
views
Reference request: Grassmannian and Plucker coordinates in type B, C, D
Grassmannian $Gr(k,n)$ is the set of $k$-dimensional subspace of an $n$-dimensional vector space. What are the Grassmannian in types B, C, D? What are the analog of Plucker coordinates and Plucker rel …
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.
5
votes
1
answer
194
views
Number of real roots in type $\tilde{E}_8$
Let $\Phi_+$ be the set of all positive roots for a Kac-Moody algebra. Denote by $\alpha_i$ the simple root associated with node $i$
by for $i \in \{1, \ldots, n-1\}$ and by $\beta$ the simple root as …
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 …
4
votes
1
answer
295
views
Big cells in a Grassmann and permutations
In the lecture notes, it is said that (Theorem 3.1.3) the set of positroid cells in $Gr(k,n)$ are in one to one correspondence with the set of bounded affine permutations of type $(k,n)$. In Example 4 …
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 …
3
votes
1
answer
310
views
Trying to understand the proof of Laurent phenomenon of cluster algebras
I am trying to understand the proof of Laurent phenomenon of cluster algebras in the book (Sergey Fomin, Lauren Williams, Andrei Zelevinsky, Introduction to Cluster Algebras. Chapters 1-3, arXiv:1608. …
3
votes
0
answers
222
views
Definition of loop amplituhedrons
In the paper The Amplituhedron
, Nima Arkani-Hamed and Jaroslav Trnka introduced the geometric object amplituhedron. It is defined as follows (see also the lecture notes).
Let $Z$ be a $(k+m)\times …
3
votes
4
answers
607
views
Factorization in the group algebra of symmetric groups
Let $S_n$ be the symmetric group on $\{1, \ldots, n\}$. Let
\begin{align}
T=\sum_{g\in S_n} g.
\end{align}
Are there some references about the factorization of $T$?
In the case of $n=3$, we have
\b …
3
votes
2
answers
348
views
Reference request: from a reduced expression of an element in a Coxeter group to another red...
Are there some references which proves the following result?
Let $W$ be a Coxeter group and $w \in W$. Then different reduced expressions of $w$ can be transformed from one into anther using only the …
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 …
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_ …
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 …
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_ …
2
votes
1
answer
312
views
Cluster algebras of finite type
In the webpage, there is a result:
Theorem 1. Coefficient free cluster algebras without frozen variables are in bijection with Dynkin diagrams of type $A_n$, $B_n$, $C_n$, $D_n$, $E_6, E_7, E_8$, $F_ …