All Questions
Tagged with enumerative-combinatorics algebraic-combinatorics
17 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
3
votes
0
answers
214
views
Does every finite lattice embed into a finite Eulerian lattice?
A finite Boolean lattice is a lattice isomorphic to the subset lattice of a finite set. Every Boolean lattice is Eulerian, namely, a graded lattice $L$ such that $\mu(a,b) = (-1)^{|b|-|a|}$ for all $a,...
2
votes
0
answers
71
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$ ...
- 5,039
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
2
votes
0
answers
66
views
Annihilator of the of the generating function not holonomic
The following is a generating function in $x,h$ with infinite parameters
$q_1,q_2\ldots,$ and $w_1, w_2,\ldots$.
$$\Psi(x, h)= \sum_{d=0}^{\infty} s_{(d)} (q_1, q_2, \ldots) \exp \bigg( \sum_{r=1}^{\...
- 685
1
vote
0
answers
29
views
Extension of definition of Holonomic closure
My question is about finding the annihilator of a series. Let me begin with what is known and then ask my question. Let $s_d(\frac{q_1}{h},\ldots )$ denote schur function for partition $\lambda =[d]$ ...
- 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\}$....
1
vote
0
answers
43
views
Counting arrangements around a table with constraints
I have $n$ guests seated around a circular table. I want to serve them meals so that given any two guests $u$ and $v$, either
i. $u$ and $v$ have different meals, or
ii. $u$'s two neighbors have a ...
- 325
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
5
votes
0
answers
249
views
Counting perfect matchings with integrals
Has anyone used the Joni-Rota-Godsil integral formula (see details below) to count perfect matchings of square-grid graphs, Aztec diamond graphs, hexagon-honeycomb graphs, etc.? (Or even just to ...
- 19.7k
0
votes
2
answers
539
views
Morse matching with 0-cells and (n-1)-cells
Suppose one has a Morse matching (acyclic matching) of a poset $P$ of rank $n$ in which the only unmatched cells are 0-cells and $(n-1)$-cells, the same number $k$ of each one.
If $P$ is connected ...
- 9
21
votes
1
answer
1k
views
A strange sum over bipartite graphs
While mucking around with some generating functions related to enumeration of regular bipartite graphs, I stumbled across the following cutie. I wonder if anyone has seen it before, and/or if anyone ...
- 37.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