Skip to content

Use fewer q-Pochhammer calls when computing ghosts #9

@sflammia

Description

@sflammia

Currently a lot of time is spend computing finite q-Pochhammer symbols with large values of $n$. For non-principal ghosts, this makes calculation quite slow. We know that this can be avoided by using more compact formulas, but we need to derive these very carefully and then implement them.

Metadata

Metadata

Assignees

Labels

No labels
No labels

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions