All Questions
47 questions
2
votes
1
answer
358
views
q-polynomials in terms of a basis
Consider the polynomials
$$f_n(q)=\prod_{j=1}^n(1+q^j) \qquad \text{and} \qquad g_m(q)=1+q+q^2+\cdots+q^m.$$
I'll list a few examples to motivate my question. Direct calculations show that
$$f_1=g_1, \...
CommunityBot
- 1
0
votes
1
answer
349
views
Log associahedra and log noncrossing partitions--raising ops and symmetric function theory for $A_n$ (references)
Where do the following three sets $[LA]$, $[ILA]$, and $[LN]$ of partition polynomials appear in the literature?
There are two sets of partition polynomials, not in the OEIS, that serve as the ...
- 10.5k
1
vote
0
answers
63
views
Factorization of the symmetric function identity $E(t)=1/H(t)$ with the refined Euler characteristic polynomials of associahedra / Lagrange inversion
I've come across two matrix identities, flagged with daggers below, relating the two sets of elementary and complete homogeneous symmetric polynomials/functions via the two sets of refined Lah and ...
- 10.5k
2
votes
0
answers
73
views
An iterative formula for the Kreweras-Voiculescu polynomials (reference request)
Let
$$N(x) = 1 + \sum_{k \ge 1} N_k(h_1,h_2,...,h_k) \;x^k$$
$$ = 1 + h_1 x + (h_1^2 + h_2) x^2 + (h_1^3 + 3h_1h_2 + h_3)x^3 + (h_1^4 + 6 h_2 h_1^2 + 4 h_3 h_1 + 2 h_2^2 + h_4) x^4 + \cdots$$
be the ...
- 10.5k
5
votes
1
answer
268
views
Enumerating monomials in Schur polynomials
Let $s_{\lambda}(x_1,\dots,x_k)$ be the Schur polynomial associated to the partition $\lambda=(\lambda_1\geq\lambda_2\geq\cdots\geq\lambda_k>0)$.
Among the many things involved with these ...
- 85.6k
2
votes
1
answer
205
views
Catalan and path pairs in polynomials
Define $\mathbf{K}_n$ to be the set of all $(2n+1)$-tuple sequences $\mathbf{a}=(a_0,a_1,\dots,a_{2n})\in\{-1,1\}^{n+1}$ satisfying: (a) there are $n$ occurrences of $-1$ and $n+1$ of $+1$; (b) all ...
- 23.7k
6
votes
1
answer
588
views
A numerical matrix of power sum polynomials
Let $p_i=x_1^i+x_2^i+\cdots+x_m^i=\sum_{k=1}^mx_k^i$ be the power sum polynomials. Then, the determinant of the $m\times m$ Hankel matrix $M_m=(p_{i+j-2})$, for $1\leq i,j\leq m$, has a neat ...
- 43.2k
0
votes
0
answers
109
views
Applications of Jack polynomials
I developed four libraries (Julia, R, Python, Haskell) for the computation of Jack polynomials. I developed them for fun because I found this was programmatically interesting. But now I'd like them to ...
- 2,560
3
votes
0
answers
151
views
Extension of work by Novelli and Thibon on noncommutative symmetric functions and Lagrange inversion
(Edit May 12, 2023: I just put up a brief summary of some of my notes on the partition polynomials described below in my WordPress mini-arXiv at "As Above, So Below". It contains multinomial ...
- 10.5k
3
votes
2
answers
459
views
Short sequence beats long sequence
I have encountered some comparison between two binomial sums. It was amusing how the one with "fewer" summands exceeds (in value) than the other which consists of many more terms. In fact, ...
- 128k
2
votes
0
answers
77
views
Flexagons and noncrossing partitions
Turns out a couple of series related to the faces of flexagons
popped up in my explorations of combinatorial reciprocities in a group algebra for sets of partition polynomial (ParPs) related to the ...
- 10.5k
3
votes
0
answers
116
views
A theory of refined h- and f-polynomials for the permutahedra, associahedra, noncrossing partitions, and tropical Grassmannians (references)
Looking for references (insights) on a theory encompassing a notion of refined face polynomials and their associated refined h-polynomials that are generalizations of the relation between ordinary f-...
- 10.5k
1
vote
1
answer
196
views
Largest part and length of a partition in play
If $\lambda=(\lambda_1\geq\lambda_2\geq\dots\geq\lambda_k)\vdash n$ is an integer partition of $n$ then $\lambda_1$ is its largest part and $k$ is its length, $\ell(\lambda)$.
Define the statistic $...
- 4,589
11
votes
1
answer
884
views
And, yet, another evaluation to Catalan numbers
Construct the $n$-tuple Cartesian product of the ternary set $X_n=\{0,1,2\}\times\cdots\times\{0,1,2\}=\{0,1,2\}^n$. Define its subset $W_n$ according to the rule (here $y=(y_1,\dots,y_n)$ is made use ...
- 79.9k
2
votes
1
answer
173
views
Matching polynomial, but $K_2$ is replaced by $K_3$. Have these been studied?
Given a simple graph $G=(V,E)$, we can consider matchings, $M\subseteq E$,
where $M$ is a matching iff no vertex is shared between different edges.
The number of edges in $M$ is denoted $|M|$.
The ...
- 15.8k
3
votes
2
answers
255
views
Inequality for Gaussian polynomials III
Recall the constructions $[n]_q=\frac{1-q^n}{1-q}, [n]!_q=[1]_q[2]_q\cdots[n]_q$ with $[0]!_q:=1$ and the $q$-binomials (Gaussian polynomials)
$$\binom{n}k_q=\frac{[n]!_q}{[k]!_q[n-k]!_q}.$$
Given two ...
- 43.2k
4
votes
0
answers
128
views
Inequality for $q$-binomials
Recall the constructions $[n]_q=\frac{1-q^n}{1-q}, [n]!_q=[1]_q[2]_q\cdots[n]_q$ with $[0]!_q:=1$ and the $q$-binomials (Gaussian polynomials)
$$\binom{n}k_q=\frac{[n]!_q}{[k]!_q[n-k]!_q}.$$
Given two ...
- 43.2k
2
votes
0
answers
80
views
Inequality on polynomials
Recall $[n]_q=\frac{1-q^n}{1-q}, [n]!_q=[1]_q[2]_q\cdots[n]_q$ and the Gaussian polynomial $\binom{a}{b}_q=\frac{[a]!_q}{[b]!_q[a-b]!_q}$ with $[0]!_q:=1$.
Given two polynomials $U(q)=\sum_k\alpha_kq^...
- 43.2k
2
votes
0
answers
117
views
A multi-variable "Fibonacci polynomial"?
There is a tremendous literature on the Fibonacci sequence, including its polynomial analogue $F_{-1}=0, F_0=1$ and
$$F_n(x)=xF_{n-1}(x)+F_{n-2} \qquad \text{for $n\geq1$}.$$
What I have found is the ...
- 43.2k
8
votes
1
answer
269
views
MacMahon Master Theorem for non-matching coefficients
Let $ A$ be a complex $ n$ by $ n$ matrix and $ x_1, \dots, x_n$ be a set of commuting variables. Let $ X_i = \sum_i a_{ij}x_j$. MacMahon's Master Theorem (MMT) states that
\begin{align}
[x_1^{...
- 1,608
2
votes
1
answer
162
views
Maximally independent polynomial families with row symmetry
Introduction:
In the 1-dimensional case, given $m$-variables
$$\mathbf{x} = (x_1,x_2,\dots,x_m)^T,$$
the elementary symmetric polynomials $(e_k(\mathbf{x}))_{k=1}^m$ give a "symmetric basis",...
- 156k
3
votes
1
answer
165
views
The inverse of a symbolic matrix (with reciprocal binomials) has Laurent entries
Recalling the $q$-binomials (Gaussian polynomials). Let $[n]_q!=\prod_{j=1}^n\frac{1-q^j}{1-q}$ and
$\binom{n}k_q=\frac{[n]_q!}{[k]_q!\cdot[n-k]_q!}$.
Now, consider the $n\times n$ matrix $\mathbf{M}...
- 109k
3
votes
0
answers
207
views
On a variation of the Vandermonde matrix
The ubiquitous Vandermonde matrix, of entries $(x_i^{j-1})_{i,j}^{1,n}$, and its determinant
$$\prod_{i<j}^{1,n}(x_j-x_i)$$
have found many utilities in Combinatorics and Physics, among other ...
- 43.2k
4
votes
0
answers
186
views
A problem in the spirit of P. Borwein's polynomials
A well-known conjecture (now a theorem) of P. Borwein (see Wang and Krattenthaler - An asymptotic approach to Borwein-type sign pattern theorems) states:
For all positive integers $n$, the sign ...
- 12.9k
1
vote
1
answer
204
views
Interpret this matrix and its determinant
Let $n\geq1$ be an integer. Take the matrix $M(n)$, with entries, $M_{i,j}(n)=\sin\left(\frac{(i+j)\pi}2\right)$ if $i\neq j$ and $M_{i,i}(n)=x_i$.
I wish to ask (this question has been modified from ...
- 43.2k
1
vote
0
answers
159
views
A follow up on Bergeron's conjecture and a question
We say two polynomials satisfy $P(x)\geq Q(x)$ iff $P(x)-Q(x)$ has non-negative coefficients. Recall $(n)_q!=\prod_{j=1}^n(1-q^j)$ and the Gaussian polynomials $\binom{n}k_q=\frac{(n)_q!}{(k)_q!(n-k)...
- 43.2k
4
votes
1
answer
539
views
A (mild?) question on the number of monomials
Let $[n]_q=\frac{1-q^n}{1-q}$ with $[0]_q=0$. Recall the $q$-factorials $[n]_q!=[1]_q[2]_q\cdots[n]_q$ (with $[0]_q!=1$) and the $q$-binomials
$$\binom{n}k_q=\frac{[n]_q!}{[k]_q!\,[n-k]_q!}.$$
Now, ...
- 85.6k
6
votes
1
answer
186
views
Hook lengths, contents and recurrence
For a cell $\square$ in the Young diagram of a partition $\lambda$, let $h_{\square}$ and $c_{\square}$ denote the hook length and content of $\square$, respectively.
Define the functions
$$f_n(t):=\...
- 43.2k
6
votes
0
answers
207
views
Parameter independence of Stanley's "content formula". Why?
For a cell $\square$ in the Young diagram of a partition $\lambda$, let $h_{\square}$ and $c_{\square}$ denote the hook length and content of $\square$, respectively.
R. Stanley remarked following ...
- 43.2k
3
votes
1
answer
272
views
Generating function for parity in hooks
Let $\lambda\vdash n$ denote an integer partition of $n$ and $\frak{H}_{\lambda}$ be the multiset of hook lengths of $\lambda$. Further, let $o(\lambda)=\#$ of odd entries and $e(\lambda)=\#$ of even ...
- 43.2k
3
votes
0
answers
195
views
Congruence for the polynomials $(t+1)^n$
An interesting polynomial congruence is given by
$$A_n(t^m)\equiv \left(\frac{1+t+\cdots+t^{m-1}}m\right)^{n+1}A_n(t) \qquad \mod (t-1)^{n+1}, \tag1$$
where $A_n(t)$ are the Eulerian polynomials with ...
- 43.2k
5
votes
1
answer
163
views
Polynomials vanishing on prescribed layers
Given a prime $p$ and an integer $n\ge p$, what is the smallest possible degree of a polynomial $Q\in\mathbb F_p[x_1,\dotsc, x_n]$ such that $Q$ vanishes on every vector $x\in\{0,1\}^n$ of weight $w(x)...
- 148k
13
votes
2
answers
2k
views
Riemann zeta function at positive integers and an Appell sequence of polynomials related to fractional calculus
I was exploring some raising and lowering operators related to an infinitesimal generator for fractional integro-derivatives and found an Appell sequence of polynomials, i.e., an infinite sequence of ...
- 10.5k
5
votes
1
answer
213
views
Matrix-valued periodic Fibonacci polynomials
Consider the Fibonacci polynomials $f_n(x)$, defined by the recursion $f_n(x)=xf_{n-1}(x)-f_{n-2}(x)$ with initial values $f_0(x)=0$ and $f_1(x)=1$. It is well known that the values of these ...
- 20.2k
2
votes
1
answer
192
views
A Vandermonde-type system
For a prime $p$ and $a_1,\dotsc,a_n\in\mathbb F_p^\times$, consider the system of equations
$$ \begin{cases}
\begin{align}
a_1 + \dotsb + a_n &= 0 \\
a_1x_1 + \dotsb + a_nx_n &...
- 109k
11
votes
4
answers
1k
views
What is the correspondence between combinatorial problems and the location of the zeroes of polynomials called?
(From MSE)
In the wikipedia article on the Italian-born American mathematician and philosopher Gian-Carlo Rota, it is stated that the one combinatorial idea he would like to be remembered for
".....
- 188k
13
votes
1
answer
602
views
Explicit forms for the roots of Eulerian polynomials
Let $E_n(z)$ be the Eulerian polynomial
$$E_n(z) = \sum_{\tau \in \mathfrak{S}_n} z^{\operatorname{des}(\tau)}$$
where $\mathfrak{S}_n$ denotes the set of all permutations of $\{1,\ldots,n\}$ and $\...
- 50.8k
8
votes
1
answer
498
views
Loday's characterization and enumeration of faces of associahedra (Stasheff polytopes)
From "The multiple facets of the associahedra" by Loday:
Let us consider the formal power series
$$f(x) = x+a_1 x^2 +a_2 x^3 + \cdots+ a_n x^{n+1} + \cdots$$
and let
$$ g(x) = x+b_1 x^2 + ...
CommunityBot
- 1
3
votes
0
answers
111
views
When does the constant term in the following expansion is nonzero?
Dyson's Theorem
The constant term in the expansion of
$$\prod_{1\leq i\neq j\leq n}\left(1-\frac{x_i}{x_j}\right)^{a_i}$$
is the multinomial coefficient
$$\frac{(a_1+\cdots+a_n)!}{a_1!\cdots a_n!},$$
...
2
votes
1
answer
431
views
Lagrange interpolation vs homogeneous symmetric polynomials?
This question is a follow-up on another MO query here.
Question. For $r\geq$ an integer, is it true that there exists homogeneous symmetric polynomial $P_r(x_1,\dots,x_n)$ with positive ...
CommunityBot
- 1
7
votes
0
answers
229
views
Has anyone seen these binary trees (Catalan-type related to the Gegenbauer polynomials and Motzkin paths)?
The OEIS entry A121448 enumerates binary trees with $n$ edges and $k$ vertices with outdegree 1.
Has anyone seen these trees?
The o.g.f. for this entry, $G(x,t)$, is essentially a discriminant ...
- 5,822
6
votes
0
answers
115
views
Recursions which define polynomials?
Let $k$ be a positive integer and let
$$h(n,k,q)=\frac{1-(1+q^{k})q^{2k(n-1)+1}+q^{2}}{1-q^{2n-1}}h(n-1,k,q)-\frac{(1-q^{k(2n-3)})(1-q^{2k(n-1)})q^2}{(1-q^{2n-1})(1-q^{2n-3})}h(n-2,k,q)$$
with ...
CommunityBot
- 1
7
votes
2
answers
789
views
"MultiCatalan numbers"
Could anyone provide a reference for the following (sort of) generalization of Catalan numbers: the multinomial coefficient
$$
\binom{2k_1+3k_2+4k_3+...}{k_1+2k_2+3k_3+...,k_1,k_2,k_3,...}
$$
is ...
- 10.5k
3
votes
1
answer
447
views
A number array related to colored necklaces and the primes
I stumbled upon entry OEIS-A208535 on the enumeration of certain kinds of colored necklaces and noticed that the integers for the odd prime rows of the table there seem to be given by the Moreau ...
- 17k
8
votes
2
answers
1k
views
What is known about zero-sets of Schur polynomials?
Consider a set S of partitions not containing the empty partition (I would be happy with, say, all the partitions of size less than k, except for the empty one).
Let $U_\lambda^{(r)}$ be the zero-...
CommunityBot
- 1
1
vote
3
answers
801
views
Characteristic polynomials for $K$-Bonacci numbers: what's their name?
Fibonacci numbers are defined by the recurrence relation
$f_{n+2}=f_{n+1}+f_{n}$ and
Tribonacci numbers by
$f_{n+3}=f_{n+2}+f_{n+1}+f_{n}$
One can define, in general, K-Bonacci numbers as
$f_{n+K}=f_{...
- 39.9k
2
votes
3
answers
634
views
Variant of binomial coefficients
I've recently come across a variant of the binomial polynomials, and I'm curious if anyone has seen these before. If so, I'd love a reference, a name, etc.
First recall the following. If z is a ...
- 2,955