All Questions
9 questions
7
votes
0
answers
98
views
Pattern avoidance and P-recursiveness
A sequence $\{a_n\}_{n \geq 0}$ is said to be P-recursive if there exist polynomials $p_0(n), p_1(n), \dots , p_k(n)$ such that
$$
\sum_{i=0}^k p_i(n) a_{n+i}=0
$$
for all $n \in \mathbb N$.
Let $ P$ ...
- 1,608
0
votes
0
answers
91
views
Addition theorem for Schur function in multivariable
Working with the following problem Expansion in Schur function of negative binomial exponent
I need to find the expansion of
$$ s_{\lambda}(x_1 + y , x_2 +y, \ldots, x_n +y)$$
in terms of schur ...
- 685
3
votes
0
answers
135
views
Expansion in Schur function of negative binomial exponent
I want to know if there exist a known expansion or can be derived of the polynomial
$$ \prod_{i=1}^{m}\prod_{j= 1}^{n}(1-z(x_i + y_i))^{-w} \tag{*}$$
in terms of Schur function. That is asking for (*) ...
- 685
5
votes
1
answer
804
views
Expressing symmetric function in power-sum basis
I am trying to prove the following identity
\begin{equation}
\prod_{i=1}^{m}(1-x_{i}z)^{-u}\prod_{j=1}^{n}(1-y_{i}z)^{-v} \prod_{i=1}^{m}\prod_{j=1}^{n}(1-(x_i +y_j)z)^{-w}\\ = \sum_{\lambda, \mu}c_{\...
- 685
1
vote
0
answers
177
views
Combinatorial bijection on monotone sequences
Let $(n),\mu$ be the partition of $n$ define $H_g^{m}((n);\mu)$ count's the number of tuples $(\tau_1,\ldots,\tau_r)$ of transposition in symmetric group $S_n$ with the following conditions
$$ (1,2,\...
- 685
1
vote
0
answers
291
views
On the number of Eulerian orderings
This post is a sequel of Eulerian ordering of the integers modulo n.
Let us recall the definition of an Eulerian ordering:
Let $n>1$ be an integer. Consider the set $C_n := \{0,1, \dots , n-1\}$....
13
votes
1
answer
651
views
The Möbius number of the nonabelian finite simple groups
Let $L$ be a finite lattice with minimum $\hat{0}$ and maximum $\hat{1}$. The Möbius function $\mu$ for $L$ is defined recursively by: for $\forall a,b \in L$ with $a<b$, $\mu(b,b) = 1$ and $\mu(...
13
votes
1
answer
929
views
Two to the power of a triangular number: bijections
The numbers $2^{n(n+1)/2}$ come up in various enumerative contexts. In addition to the trivial example (bit-strings of length $n(n+1)/2$) and the old example of domino tilings of Aztec diamonds (...
- 19.7k
4
votes
3
answers
1k
views
Polya's theory of counting and commutative algebra
Do you know if there exist algebraic studies of the ring of the power series which emerge when using the theory of Polya for enumeration of sets with certain symmetries? For instance if some ideals ...
- 902