Zulip Chat Archive

Stream: Is there code for X?

Topic: Quantum (q-analog) numbers


Robert Spencer (Oct 28 2024 at 07:45):

Do we have statements and any results for q-numbers? These are (in some normalisations) [n]=qnqnqq1.[n] = \frac{q^{n}-q^{-n}}{q-q^{-1}}. in the ring Z[q+q1]\mathbb{Z}[q + q^{-1}].

Kim Morrison (Oct 28 2024 at 08:23):

I would love to see some of this done! You should look around for existing material on Pochhammer, but I think there is no quantum stuff yet.

Kim Morrison (Oct 28 2024 at 08:23):

Unfortunately there are many conventions in this world.

Kim Morrison (Oct 28 2024 at 08:24):

My bias is to use the representations theorists conventions (mostly as you've written above, balanced Laurent polynomials), rather than the combinatorialist conventions (which tend to be honest polynomials).

Robert Spencer (Oct 29 2024 at 21:49):

Sounds like a good place to start then. I agree regarding the convention of balanced Laurent polynomials, but might actually propose to work as much with the recursive definition of [n]=[2][n1][n2][n] = [2][n-1] - [n-2] in Z[X]\mathbb{Z}[X] under [2]=X[2] = X as possible.

Kim Morrison (Oct 29 2024 at 23:52):

Chebyshev polynomials might already be out there, actually!


Last updated: May 02 2025 at 03:31 UTC