# Questions tagged [algebraic-combinatorics]

The tag has no usage guidance.

255 questions
Filter by
Sorted by
Tagged with
150 views

### Identities involving Littlewood–Richardson coefficients?

I am not aware of that many identities that involve several Littlewood–Richardson coefficients. One recent identity, is a generating function as sum of squares of LR-coefficients, due to Harris and ...
• 14.7k
432 views

• 1,000
222 views

### Hives for other root systems? [duplicate]

Littlewood-Richardson coefficients $c^\lambda_{\mu\nu}$ have numerous combinatorial interpretations, including the hive model by Knutson and Tao, see here. For other root systems, there are also ...
• 15.8k
189 views

• 2,120
361 views

### Question for averaging the overall quantities by averaging a part

There is a question: If integers $a$ and $b$ satisfy the following properties: for any $a$ real numbers, we can do an operation to average $b$ of them to the same quantities, and we can do a finite ...
• 511
527 views

• 643
66 views

### Algebraic ode of exponential generating series

Let $G(z)$ be a rational function. So if we have a series $$S(x):=\sum_{n}a_n x^n$$ where $$a_n = \prod_{i=1}^{n}G((i-1)h)$$ We can conclude that the series satisfies a Linear differential ...
• 643
218 views

### A special class of weighted Motzkin paths

Consider Motzkin paths with the following weight: All up-steps and the horizontal steps on height $0$ have weight $1$, all down-steps have weight $t$ and the horizontal steps on even heights have ...
• 5,183
93 views

### Geometric or combinatorial interpretations of the (weak) Bruhat order?

$\DeclareMathOperator\Inv{Inv}$The weak Bruhat order on the symmetric group has a straightforward combinatorial interpretation: Consider a set of labelled balls $1,2,\dotsc,n$. Then for two ...
203 views

### $2$-adic valuation of Schur $P$-functions in the power-sum basis

For a partition $\lambda$, let $P_\lambda$ be the Schur $P$-functions (case $t=-1$ of Hall-Littlewood symmetric functions) and let $p_\lambda=p_{\lambda_1}p_{\lambda_1}\cdots p_{\lambda_k}$ be the ...
• 2,120
617 views

• 23.6k
74 views

• 5,404
684 views

### Number of conjugacy classes of finite reductive groups

Let $G$ be a connected reductive group over $\mathbb{Z}$. Let $c_{G(\mathbb{F}_q)}$ be the number of conjugacy classes of $G(\mathbb{F}_q)$. Question: Is it true that $c_{G(\mathbb{F}_q)}$ is a quasi-...
• 2,171
294 views

### Another characterization of matroids

Has anyone seen the following characterization of matroids? Let $\Delta$ be a simplicial complex on finite ground set $E$. Then $\Delta$ is a matroid complex if and only if, for every $X\subseteq E$ ...
• 1,380
252 views

### Combinatorial representation of function

Let $f(x, y, z)$ is the number of distinct ways of representing $x$ as a sum of at most $y$ positive integers that are all smaller or equal to $z$. Moreover, If $yz < x$, then the function gives 0....
• 73
109 views

### A combinatorial proof of an identity of partitions (Macdonald I.5)

This is a statement from Symmetric Functions and Hall Polynomials by Macdonald: $\sum_{x\in \lambda} (h(x)^2-c(x)^2)=|\lambda|^2$ where $\lambda$ denotes a partition or a Young diagram, and for each ...
• 528
369 views

### Generalization of symmetric functions

A $n$-variable function $f$ is a symmetric function if $$f(x_1,x_2, \ldots, x_n) = f(x_{\sigma(1)}, x_{\sigma(2)}, \ldots, x_{\sigma(n)})$$ for every permutation $\sigma \in S_n$. In particular, if $f$...
• 245
169 views

### Relationship between crystal root operators and usual $e_i, f_i$?

Suppose I am working in a symmetrizable Kac–Moody Lie algebra $\mathfrak{g}$. Let $e_1,\dotsc,e_n,f_1,\dotsc,f_n$ denote the usual Chevalley generators of $\mathfrak{g}$. Let $V$ be a highest weight ...
• 528
69 views

### Bijections between binary sequences and primitive elements in a finite field [duplicate]

Let $n>1$ be a natural number. We call a binary sequence $(b_1,\ldots, b_n)\in \{0,1\}^n$ $rigid$ if it is not a proper power of a sequence of shorter length. So for example $(0,1,0,1) = (0,1)^2$ ...
• 4,819
### Digraphs with unique walk of length $k$ between any two vertices
Let $G$ be a digraph such that there is an unique directed walk of length $k$ between any two vertices. Equivalently, if $A$ is the adjacency matrix of $G$, then $A^k$ is the matrix with all entries \$...