Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
1 answer
216 views

Any conjectures about Jack Littlewood-Richardson coefficients when Schur LR > 1?

Stanley famously conjectured ("Some combinatorial properties of Jack symmetric functions" Adv. in Math. (77) 1989, doi:10.1016/0001-8708(89)90015-7, MR1014073, Zbl 0743.05072) that the Jack ...
Ryan Mickler's user avatar
6 votes
1 answer
449 views

A summation involving fraction of binomial coefficients

I need to prove the following statement. Let $ n, g, m, a ,t$ be integers. Prove that the following statement is true for all $ n \geq g(1+2m)+1 $, $ g\geq 2t $, $ m\geq t $, $ 0\leq a <t $, and $ ...
Arda Aydin's user avatar
14 votes
2 answers
647 views

Curious identity between the two kinds of Chebyshev polynomials

I have found, by accident, an identity that relates a sum of Chebyshev polynomials of the first kind to a Chebyshev polynomial of the second kind. It goes as follows: Given an integer partition of $n$...
MannyC's user avatar
  • 243
5 votes
1 answer
351 views

"Non-associative" standard polynomials

I saw somewhere (I appreciate if anyone has any references to proof of this fact) that if $A$ is a finite dimensional associative algebra such that $\textrm{dim}(A)<n$, then $A$ satisfies the ...
cl4y70n____'s user avatar
33 votes
7 answers
3k views

On the polynomial $\sum_{k=0}^n\binom{n}{k}(-1)^kX^{k(n-k)}$

Let $n = 2m$ be an even integer and let $F_n(X)$ be the polynomial $$F_n(X):=\sum_{k=0}^n\binom{n}{k}(-1)^kX^{k(n-k)}.$$ I observed (but cannot prove) that the polynomial $F_n$ is always divisible by $...
WhatsUp's user avatar
  • 3,432
18 votes
3 answers
860 views

$\prod_k(x\pm k)$ in binomial basis?

Let $x$ be an indeterminate and $n$ a non-negative integer. Question. The following seems to be true. Is it? $$x\prod_{k=1}^n(k^2-x^2)=\frac1{4^n}\sum_{m=0}^n\binom{n-x}m\binom{n+x}{n-m}(x+2m-n)^...
T. Amdeberhan's user avatar
3 votes
1 answer
242 views

system of complex equations

I am working on a system of complex equations The question is the following: Let $a_1,a_2,\ldots,a_N\in \mathbb{C}$ such that $$\sum_{j=1}^N \sum_{q=0}^{N-1-k} {N-1 \choose q} {N-1 \choose k+q} |a_j|...
Suracha Bosunoi's user avatar
2 votes
0 answers
153 views

system of complex number equations

Let $a_1,a_2,a_3,a_4\in \mathbb{C}$ be distinct such that $$a_1^3+a_2^3+a_3^3+a_4^3=0$$ $$(1+|a_1|^2)a_1^2+(1+|a_2|^2)a_2^2+(1+|a_3|^2)a_3^2+(1+|a_4|^2)a_4^2=0$$ $$(1+2|a_1|^2+2|a_1|^4)a_1+(1+2|a_2|^...
Ma Na's user avatar
  • 309